./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/Narrowing_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/Narrowing_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 30c1dcaa423edd95f50127b236ab2e09f14129f4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-2e94e6a [2019-01-01 21:39:42,672 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:39:42,674 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:39:42,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:39:42,687 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:39:42,693 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:39:42,694 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:39:42,698 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:39:42,702 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:39:42,703 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:39:42,709 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:39:42,710 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:39:42,711 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:39:42,712 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:39:42,713 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:39:42,714 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:39:42,720 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:39:42,722 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:39:42,724 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:39:42,728 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:39:42,730 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:39:42,731 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:39:42,737 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:39:42,738 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:39:42,738 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:39:42,739 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:39:42,742 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:39:42,743 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:39:42,745 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:39:42,746 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:39:42,748 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:39:42,749 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:39:42,749 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:39:42,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:39:42,752 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:39:42,753 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:39:42,753 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:39:42,779 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:39:42,779 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:39:42,781 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:39:42,781 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:39:42,781 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:39:42,781 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:39:42,781 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:39:42,782 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:39:42,782 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:39:42,782 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:39:42,782 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:39:42,782 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:39:42,782 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:39:42,784 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:39:42,784 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:39:42,784 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:39:42,784 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:39:42,785 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:39:42,786 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:39:42,787 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:39:42,787 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:39:42,787 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:39:42,787 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:39:42,787 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:39:42,789 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:39:42,789 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:39:42,789 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:39:42,790 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:39:42,791 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:39:42,791 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 -> 30c1dcaa423edd95f50127b236ab2e09f14129f4 [2019-01-01 21:39:42,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:39:42,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:39:42,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:39:42,887 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:39:42,888 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:39:42,889 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/Narrowing_false-termination_true-no-overflow.c [2019-01-01 21:39:42,947 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df0e7aab/07f25f1552c94c2ca5277bc0fbe10822/FLAGdf7937ffb [2019-01-01 21:39:43,405 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:39:43,406 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/Narrowing_false-termination_true-no-overflow.c [2019-01-01 21:39:43,414 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df0e7aab/07f25f1552c94c2ca5277bc0fbe10822/FLAGdf7937ffb [2019-01-01 21:39:43,789 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df0e7aab/07f25f1552c94c2ca5277bc0fbe10822 [2019-01-01 21:39:43,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:39:43,796 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:39:43,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:39:43,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:39:43,802 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:39:43,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:39:43" (1/1) ... [2019-01-01 21:39:43,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@511a9c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:43, skipping insertion in model container [2019-01-01 21:39:43,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:39:43" (1/1) ... [2019-01-01 21:39:43,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:39:43,837 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:39:44,054 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:39:44,059 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:39:44,081 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:39:44,095 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:39:44,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:44 WrapperNode [2019-01-01 21:39:44,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:39:44,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:39:44,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:39:44,097 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:39:44,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:44" (1/1) ... [2019-01-01 21:39:44,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:44" (1/1) ... [2019-01-01 21:39:44,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:39:44,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:39:44,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:39:44,134 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:39:44,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:44" (1/1) ... [2019-01-01 21:39:44,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:44" (1/1) ... [2019-01-01 21:39:44,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:44" (1/1) ... [2019-01-01 21:39:44,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:44" (1/1) ... [2019-01-01 21:39:44,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:44" (1/1) ... [2019-01-01 21:39:44,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:44" (1/1) ... [2019-01-01 21:39:44,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:44" (1/1) ... [2019-01-01 21:39:44,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:39:44,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:39:44,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:39:44,154 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:39:44,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:44" (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-01 21:39:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:39:44,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:39:44,515 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:39:44,515 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:39:44,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:39:44 BoogieIcfgContainer [2019-01-01 21:39:44,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:39:44,518 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:39:44,518 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:39:44,523 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:39:44,524 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:39:44,530 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:39:43" (1/3) ... [2019-01-01 21:39:44,532 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bbf12a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:39:44, skipping insertion in model container [2019-01-01 21:39:44,532 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:39:44,533 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:44" (2/3) ... [2019-01-01 21:39:44,533 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bbf12a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:39:44, skipping insertion in model container [2019-01-01 21:39:44,533 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:39:44,533 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:39:44" (3/3) ... [2019-01-01 21:39:44,538 INFO L375 chiAutomizerObserver]: Analyzing ICFG Narrowing_false-termination_true-no-overflow.c [2019-01-01 21:39:44,640 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:39:44,641 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:39:44,641 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:39:44,642 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:39:44,642 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:39:44,642 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:39:44,642 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:39:44,642 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:39:44,643 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:39:44,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 21:39:44,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:39:44,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:44,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:44,702 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:39:44,702 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:39:44,702 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:39:44,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 21:39:44,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:39:44,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:44,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:44,707 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:39:44,707 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:39:44,728 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 13#L26-1true [2019-01-01 21:39:44,729 INFO L796 eck$LassoCheckResult]: Loop: 13#L26-1true assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12#L14true assume 0 == main_~i~0;main_~up~0 := 1; 8#L14-2true assume main_~i~0 == main_~range~0;main_~up~0 := 0; 5#L17-1true assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11#L20-1true assume !(0 == main_~up~0); 7#L23-1true assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13#L26-1true [2019-01-01 21:39:44,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:44,738 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:39:44,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:44,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:44,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:44,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:44,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:44,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:44,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1186392078, now seen corresponding path program 1 times [2019-01-01 21:39:44,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:44,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:44,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:44,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:44,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:44,947 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-01 21:39:44,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:39:44,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:39:44,955 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:39:44,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:39:44,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:39:44,973 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-01 21:39:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:45,055 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2019-01-01 21:39:45,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:39:45,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2019-01-01 21:39:45,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-01 21:39:45,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 13 states and 21 transitions. [2019-01-01 21:39:45,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:39:45,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 21:39:45,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 21 transitions. [2019-01-01 21:39:45,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:39:45,071 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 21 transitions. [2019-01-01 21:39:45,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 21 transitions. [2019-01-01 21:39:45,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-01 21:39:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 21:39:45,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2019-01-01 21:39:45,107 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 21 transitions. [2019-01-01 21:39:45,108 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 21 transitions. [2019-01-01 21:39:45,108 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:39:45,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 21 transitions. [2019-01-01 21:39:45,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-01 21:39:45,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:45,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:45,109 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:39:45,110 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:39:45,110 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 42#L26-1 [2019-01-01 21:39:45,111 INFO L796 eck$LassoCheckResult]: Loop: 42#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 47#L14 assume 0 == main_~i~0;main_~up~0 := 1; 48#L14-2 assume !(main_~i~0 == main_~range~0); 49#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 50#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 45#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 42#L26-1 [2019-01-01 21:39:45,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:45,111 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-01 21:39:45,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:45,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:45,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:45,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:45,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:45,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:45,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1186451598, now seen corresponding path program 1 times [2019-01-01 21:39:45,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:45,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:45,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:45,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:45,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:45,200 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-01 21:39:45,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:39:45,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:39:45,201 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:39:45,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:39:45,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:39:45,202 INFO L87 Difference]: Start difference. First operand 13 states and 21 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-01 21:39:45,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:45,262 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2019-01-01 21:39:45,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:39:45,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 19 transitions. [2019-01-01 21:39:45,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-01 21:39:45,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 19 transitions. [2019-01-01 21:39:45,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:39:45,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 21:39:45,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-01-01 21:39:45,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:39:45,266 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-01 21:39:45,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-01-01 21:39:45,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-01 21:39:45,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 21:39:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2019-01-01 21:39:45,269 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-01 21:39:45,269 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-01 21:39:45,269 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:39:45,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2019-01-01 21:39:45,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-01 21:39:45,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:45,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:45,271 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:39:45,271 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:39:45,271 INFO L794 eck$LassoCheckResult]: Stem: 76#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 77#L26-1 [2019-01-01 21:39:45,271 INFO L796 eck$LassoCheckResult]: Loop: 77#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 80#L14 assume 0 == main_~i~0;main_~up~0 := 1; 81#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 74#L17-1 assume !(1 == main_~up~0); 75#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 78#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 77#L26-1 [2019-01-01 21:39:45,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:45,272 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-01-01 21:39:45,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:45,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:45,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:45,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:45,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:45,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:45,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1186393938, now seen corresponding path program 1 times [2019-01-01 21:39:45,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:45,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:45,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:45,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:45,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:45,352 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-01 21:39:45,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:39:45,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:39:45,353 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:39:45,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:39:45,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:39:45,355 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-01 21:39:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:45,549 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2019-01-01 21:39:45,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:39:45,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 43 transitions. [2019-01-01 21:39:45,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-01-01 21:39:45,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 43 transitions. [2019-01-01 21:39:45,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-01-01 21:39:45,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-01-01 21:39:45,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 43 transitions. [2019-01-01 21:39:45,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:39:45,555 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2019-01-01 21:39:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 43 transitions. [2019-01-01 21:39:45,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2019-01-01 21:39:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 21:39:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-01 21:39:45,561 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-01 21:39:45,561 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-01 21:39:45,561 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:39:45,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-01 21:39:45,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-01 21:39:45,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:45,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:45,563 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:39:45,563 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:39:45,563 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 126#L26-1 [2019-01-01 21:39:45,565 INFO L796 eck$LassoCheckResult]: Loop: 126#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 142#L14 assume !(0 == main_~i~0); 131#L14-2 assume !(main_~i~0 == main_~range~0); 127#L17-1 assume !(1 == main_~up~0); 128#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 143#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 126#L26-1 [2019-01-01 21:39:45,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:45,566 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-01-01 21:39:45,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:45,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:45,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:45,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:45,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:45,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:45,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1188300564, now seen corresponding path program 1 times [2019-01-01 21:39:45,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:45,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:45,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:45,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:45,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:45,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:45,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1363856397, now seen corresponding path program 1 times [2019-01-01 21:39:45,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:45,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:45,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:45,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:45,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:45,866 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-01-01 21:39:45,932 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:45,933 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:45,933 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:45,933 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:45,934 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:45,934 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:45,935 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:45,935 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:45,935 INFO L131 ssoRankerPreferences]: Filename of dumped script: Narrowing_false-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:39:45,935 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:45,936 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:45,958 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-01 21:39:45,966 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-01 21:39:45,968 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-01 21:39:45,974 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-01 21:39:46,209 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 15 [2019-01-01 21:39:46,255 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:46,256 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-01 21:39:46,262 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:46,262 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:46,289 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:46,289 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-01 21:39:46,295 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:46,296 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:46,322 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:46,322 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-01 21:39:46,330 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:46,330 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:46,336 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:46,336 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-01 21:39:46,360 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:46,360 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) [2019-01-01 21:39:46,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:46,422 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:46,476 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:46,479 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:46,479 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:46,479 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:46,480 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:46,481 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:46,481 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:46,481 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:46,482 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:46,482 INFO L131 ssoRankerPreferences]: Filename of dumped script: Narrowing_false-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:39:46,482 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:46,482 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:46,486 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-01 21:39:46,504 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-01 21:39:46,509 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-01 21:39:46,514 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-01 21:39:47,013 WARN L181 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 15 [2019-01-01 21:39:47,199 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:47,204 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:47,206 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-01 21:39:47,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:47,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:47,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:47,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:47,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:47,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:47,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:47,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:47,217 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-01 21:39:47,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:47,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:47,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:47,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:47,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:47,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:47,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:47,227 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-01 21:39:47,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:47,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:47,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:47,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:47,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:47,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:47,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:47,239 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-01 21:39:47,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:47,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:47,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:47,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:47,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:47,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:47,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:47,248 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:47,253 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:39:47,253 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:39:47,256 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:47,256 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:47,257 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:47,257 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-01 21:39:47,259 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:47,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:47,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:47,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:47,434 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-01 21:39:47,439 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-01 21:39:47,440 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-01-01 21:39:47,516 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 54 states and 75 transitions. Complement of second has 7 states. [2019-01-01 21:39:47,517 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-01 21:39:47,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:39:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:39:47,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-01 21:39:47,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:47,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-01 21:39:47,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:47,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 12 letters. [2019-01-01 21:39:47,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:47,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 75 transitions. [2019-01-01 21:39:47,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-01 21:39:47,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 47 states and 64 transitions. [2019-01-01 21:39:47,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-01-01 21:39:47,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-01 21:39:47,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 64 transitions. [2019-01-01 21:39:47,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:47,530 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 64 transitions. [2019-01-01 21:39:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 64 transitions. [2019-01-01 21:39:47,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2019-01-01 21:39:47,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 21:39:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2019-01-01 21:39:47,536 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 57 transitions. [2019-01-01 21:39:47,536 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 57 transitions. [2019-01-01 21:39:47,536 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:39:47,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 57 transitions. [2019-01-01 21:39:47,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-01 21:39:47,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:47,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:47,539 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:39:47,539 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:39:47,539 INFO L794 eck$LassoCheckResult]: Stem: 252#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 253#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 270#L14 assume 0 == main_~i~0;main_~up~0 := 1; 278#L14-2 assume !(main_~i~0 == main_~range~0); 285#L17-1 [2019-01-01 21:39:47,539 INFO L796 eck$LassoCheckResult]: Loop: 285#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 272#L20-1 assume !(0 == main_~up~0); 273#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 284#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 288#L14 assume 0 == main_~i~0;main_~up~0 := 1; 286#L14-2 assume !(main_~i~0 == main_~range~0); 285#L17-1 [2019-01-01 21:39:47,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:47,540 INFO L82 PathProgramCache]: Analyzing trace with hash 963346, now seen corresponding path program 1 times [2019-01-01 21:39:47,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:47,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:47,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:47,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:47,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:47,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:47,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1634880532, now seen corresponding path program 1 times [2019-01-01 21:39:47,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:47,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:47,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:47,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:47,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:47,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:47,562 INFO L82 PathProgramCache]: Analyzing trace with hash 498642533, now seen corresponding path program 1 times [2019-01-01 21:39:47,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:47,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:47,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:47,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:47,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:47,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:39:47,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:39:47,746 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:47,747 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:47,747 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:47,747 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:47,747 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:47,747 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:47,747 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:47,747 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:47,748 INFO L131 ssoRankerPreferences]: Filename of dumped script: Narrowing_false-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:39:47,748 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:47,748 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:47,750 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-01 21:39:47,758 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-01 21:39:47,765 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-01 21:39:47,780 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-01 21:39:48,003 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-01-01 21:39:48,213 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 21 [2019-01-01 21:39:48,215 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:48,215 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-01 21:39:48,222 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:48,223 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:48,248 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:48,248 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-01 21:39:48,254 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:48,254 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:48,275 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:48,276 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-01 21:39:48,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:48,282 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:48,285 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:48,285 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-01 21:39:48,307 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:48,308 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-01 21:39:48,335 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:48,335 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:48,513 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:48,516 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:48,516 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:48,516 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:48,516 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:48,517 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:48,517 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:48,517 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:48,517 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:48,517 INFO L131 ssoRankerPreferences]: Filename of dumped script: Narrowing_false-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:39:48,517 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:48,517 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:48,520 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-01 21:39:48,526 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-01 21:39:48,529 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-01 21:39:48,543 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-01 21:39:48,792 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:48,793 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:48,793 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-01 21:39:48,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:48,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:48,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:48,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:48,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:48,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:48,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:48,801 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-01 21:39:48,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:48,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:48,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:48,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:48,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:48,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:48,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:48,810 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-01 21:39:48,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:48,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:48,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:48,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:48,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:48,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:48,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:48,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:48,816 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-01 21:39:48,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:48,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:48,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:48,817 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:39:48,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:48,819 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:39:48,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:48,828 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:48,835 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:39:48,835 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:39:48,836 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:48,836 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:48,836 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:48,836 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-01 21:39:48,837 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:48,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:48,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:48,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:48,922 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-01 21:39:48,923 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-01 21:39:48,923 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 57 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-01-01 21:39:49,040 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 57 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 114 states and 153 transitions. Complement of second has 7 states. [2019-01-01 21:39:49,042 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-01 21:39:49,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:39:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2019-01-01 21:39:49,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-01 21:39:49,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:49,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:39:49,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:49,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 12 letters. [2019-01-01 21:39:49,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:49,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 153 transitions. [2019-01-01 21:39:49,052 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 42 [2019-01-01 21:39:49,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 108 states and 144 transitions. [2019-01-01 21:39:49,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2019-01-01 21:39:49,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2019-01-01 21:39:49,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 144 transitions. [2019-01-01 21:39:49,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:49,060 INFO L705 BuchiCegarLoop]: Abstraction has 108 states and 144 transitions. [2019-01-01 21:39:49,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 144 transitions. [2019-01-01 21:39:49,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 93. [2019-01-01 21:39:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-01 21:39:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2019-01-01 21:39:49,075 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 128 transitions. [2019-01-01 21:39:49,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:39:49,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:39:49,076 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand 4 states. [2019-01-01 21:39:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:49,159 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2019-01-01 21:39:49,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:39:49,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 142 transitions. [2019-01-01 21:39:49,164 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 50 [2019-01-01 21:39:49,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 92 states and 118 transitions. [2019-01-01 21:39:49,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2019-01-01 21:39:49,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2019-01-01 21:39:49,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 118 transitions. [2019-01-01 21:39:49,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:49,166 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 118 transitions. [2019-01-01 21:39:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 118 transitions. [2019-01-01 21:39:49,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 41. [2019-01-01 21:39:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 21:39:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2019-01-01 21:39:49,172 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 55 transitions. [2019-01-01 21:39:49,172 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 55 transitions. [2019-01-01 21:39:49,172 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:39:49,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 55 transitions. [2019-01-01 21:39:49,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-01 21:39:49,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:49,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:49,174 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:39:49,174 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:39:49,174 INFO L794 eck$LassoCheckResult]: Stem: 668#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 669#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 684#L14 assume 0 == main_~i~0;main_~up~0 := 1; 693#L14-2 assume !(main_~i~0 == main_~range~0); 688#L17-1 [2019-01-01 21:39:49,174 INFO L796 eck$LassoCheckResult]: Loop: 688#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 689#L20-1 assume !(0 == main_~up~0); 690#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 699#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 704#L14 assume !(0 == main_~i~0); 701#L14-2 assume !(main_~i~0 == main_~range~0); 688#L17-1 [2019-01-01 21:39:49,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:49,175 INFO L82 PathProgramCache]: Analyzing trace with hash 963346, now seen corresponding path program 2 times [2019-01-01 21:39:49,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:49,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:49,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:49,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:49,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:49,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:49,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1634880594, now seen corresponding path program 1 times [2019-01-01 21:39:49,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:49,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:49,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:49,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:49,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:49,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:49,194 INFO L82 PathProgramCache]: Analyzing trace with hash 498642595, now seen corresponding path program 1 times [2019-01-01 21:39:49,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:49,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:49,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:49,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:49,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:49,277 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:49,278 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:49,278 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:49,278 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:49,278 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:49,279 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:49,279 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:49,279 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:49,279 INFO L131 ssoRankerPreferences]: Filename of dumped script: Narrowing_false-termination_true-no-overflow.c_Iteration6_Loop [2019-01-01 21:39:49,279 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:49,279 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:49,281 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-01 21:39:49,306 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-01 21:39:49,314 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-01 21:39:49,322 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-01 21:39:49,507 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:49,508 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-01 21:39:49,515 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:49,516 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01 21:39:49,542 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:49,542 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:49,803 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:49,806 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:49,806 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:49,806 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:49,806 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:49,806 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:49,807 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:49,807 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:49,807 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:49,807 INFO L131 ssoRankerPreferences]: Filename of dumped script: Narrowing_false-termination_true-no-overflow.c_Iteration6_Loop [2019-01-01 21:39:49,807 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:49,807 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:49,809 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-01 21:39:49,872 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-01 21:39:49,878 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-01 21:39:49,880 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-01 21:39:50,130 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:50,130 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:50,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-01 21:39:50,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:50,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:50,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:50,132 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:39:50,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:50,134 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:39:50,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:50,143 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:50,149 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:39:50,150 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:39:50,150 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:50,150 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:50,151 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:50,151 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~range~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~range~0 Supporting invariants [] [2019-01-01 21:39:50,151 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:50,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:50,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:50,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:50,262 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-01 21:39:50,262 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-01 21:39:50,262 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 55 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-01-01 21:39:50,314 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 55 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 90 states and 115 transitions. Complement of second has 7 states. [2019-01-01 21:39:50,318 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-01 21:39:50,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:39:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-01-01 21:39:50,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-01 21:39:50,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:50,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:39:50,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:50,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 12 letters. [2019-01-01 21:39:50,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:50,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 115 transitions. [2019-01-01 21:39:50,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-01 21:39:50,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 77 states and 98 transitions. [2019-01-01 21:39:50,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-01-01 21:39:50,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-01-01 21:39:50,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 98 transitions. [2019-01-01 21:39:50,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:50,325 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 98 transitions. [2019-01-01 21:39:50,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 98 transitions. [2019-01-01 21:39:50,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2019-01-01 21:39:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-01 21:39:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2019-01-01 21:39:50,330 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 92 transitions. [2019-01-01 21:39:50,330 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 92 transitions. [2019-01-01 21:39:50,330 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:39:50,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 92 transitions. [2019-01-01 21:39:50,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-01 21:39:50,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:50,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:50,332 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:39:50,332 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:39:50,333 INFO L794 eck$LassoCheckResult]: Stem: 854#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 855#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 907#L14 assume !(0 == main_~i~0); 908#L14-2 assume !(main_~i~0 == main_~range~0); 852#L17-1 assume !(1 == main_~up~0); 853#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 900#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 901#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 913#L14 assume 0 == main_~i~0;main_~up~0 := 1; 912#L14-2 assume !(main_~i~0 == main_~range~0); 876#L17-1 [2019-01-01 21:39:50,333 INFO L796 eck$LassoCheckResult]: Loop: 876#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 877#L20-1 assume !(0 == main_~up~0); 856#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 857#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 887#L14 assume !(0 == main_~i~0); 885#L14-2 assume !(main_~i~0 == main_~range~0); 876#L17-1 [2019-01-01 21:39:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:50,333 INFO L82 PathProgramCache]: Analyzing trace with hash -255352415, now seen corresponding path program 1 times [2019-01-01 21:39:50,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:50,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:50,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:50,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:50,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:50,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:39:50,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:39:50,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:50,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:50,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:39:50,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-01 21:39:50,441 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:39:50,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:50,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1634880594, now seen corresponding path program 2 times [2019-01-01 21:39:50,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:50,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:50,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:50,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:50,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:50,543 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:50,543 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:50,543 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:50,543 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:50,544 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:50,544 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:50,544 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:50,544 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:50,544 INFO L131 ssoRankerPreferences]: Filename of dumped script: Narrowing_false-termination_true-no-overflow.c_Iteration7_Loop [2019-01-01 21:39:50,544 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:50,545 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:50,546 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-01 21:39:50,551 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-01 21:39:50,555 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-01 21:39:50,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-01 21:39:50,728 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:50,728 INFO L412 LassoAnalysis]: Checking for nontermination... 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-01 21:39:50,733 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:50,733 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:50,737 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:50,737 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 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-01 21:39:50,759 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:50,759 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:50,779 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:50,779 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 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-01 21:39:50,785 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:50,785 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01 21:39:50,810 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:50,810 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:51,036 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:51,040 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:51,040 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:51,040 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:51,040 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:51,040 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:51,040 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:51,041 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:51,041 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:51,041 INFO L131 ssoRankerPreferences]: Filename of dumped script: Narrowing_false-termination_true-no-overflow.c_Iteration7_Loop [2019-01-01 21:39:51,041 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:51,041 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:51,044 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-01 21:39:51,080 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-01 21:39:51,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-01 21:39:51,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-01 21:39:51,289 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:51,289 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:51,291 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-01 21:39:51,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:51,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:51,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:51,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:51,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:51,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:51,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:51,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:51,298 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-01 21:39:51,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:51,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:51,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:51,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:51,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:51,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:51,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:51,309 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-01 21:39:51,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:51,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:51,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:51,311 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:39:51,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:51,314 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:39:51,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:51,323 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:51,328 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:39:51,329 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:39:51,329 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:51,329 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:51,329 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:51,330 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~range~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~range~0 Supporting invariants [] [2019-01-01 21:39:51,330 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:51,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:51,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:51,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:51,429 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-01 21:39:51,430 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-01 21:39:51,430 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26 Second operand 4 states. [2019-01-01 21:39:51,486 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26. Second operand 4 states. Result 95 states and 121 transitions. Complement of second has 7 states. [2019-01-01 21:39:51,487 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-01 21:39:51,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:39:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-01-01 21:39:51,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:39:51,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:51,489 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:51,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:51,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:51,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:51,550 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-01 21:39:51,550 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-01 21:39:51,550 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26 Second operand 4 states. [2019-01-01 21:39:51,637 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26. Second operand 4 states. Result 124 states and 157 transitions. Complement of second has 9 states. [2019-01-01 21:39:51,642 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-01 21:39:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:39:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2019-01-01 21:39:51,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:39:51,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:51,643 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:51,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:51,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:51,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:51,689 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-01 21:39:51,691 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-01 21:39:51,691 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26 Second operand 4 states. [2019-01-01 21:39:51,777 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26. Second operand 4 states. Result 112 states and 146 transitions. Complement of second has 8 states. [2019-01-01 21:39:51,780 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-01 21:39:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:39:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-01-01 21:39:51,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:39:51,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:51,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 16 letters. Loop has 6 letters. [2019-01-01 21:39:51,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:51,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 10 letters. Loop has 12 letters. [2019-01-01 21:39:51,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:51,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 146 transitions. [2019-01-01 21:39:51,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-01-01 21:39:51,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 84 states and 108 transitions. [2019-01-01 21:39:51,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-01 21:39:51,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-01-01 21:39:51,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 108 transitions. [2019-01-01 21:39:51,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:51,791 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 108 transitions. [2019-01-01 21:39:51,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 108 transitions. [2019-01-01 21:39:51,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 49. [2019-01-01 21:39:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-01 21:39:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2019-01-01 21:39:51,797 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2019-01-01 21:39:51,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:39:51,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:39:51,799 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand 4 states. [2019-01-01 21:39:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:51,868 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2019-01-01 21:39:51,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:39:51,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 154 transitions. [2019-01-01 21:39:51,871 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2019-01-01 21:39:51,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 117 states and 152 transitions. [2019-01-01 21:39:51,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2019-01-01 21:39:51,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2019-01-01 21:39:51,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 152 transitions. [2019-01-01 21:39:51,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:51,873 INFO L705 BuchiCegarLoop]: Abstraction has 117 states and 152 transitions. [2019-01-01 21:39:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 152 transitions. [2019-01-01 21:39:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 97. [2019-01-01 21:39:51,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-01 21:39:51,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2019-01-01 21:39:51,880 INFO L728 BuchiCegarLoop]: Abstraction has 97 states and 128 transitions. [2019-01-01 21:39:51,880 INFO L608 BuchiCegarLoop]: Abstraction has 97 states and 128 transitions. [2019-01-01 21:39:51,880 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:39:51,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 128 transitions. [2019-01-01 21:39:51,881 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2019-01-01 21:39:51,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:51,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:51,883 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:39:51,883 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-01 21:39:51,884 INFO L794 eck$LassoCheckResult]: Stem: 1646#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 1647#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1657#L14 assume 0 == main_~i~0;main_~up~0 := 1; 1658#L14-2 assume !(main_~i~0 == main_~range~0); 1699#L17-1 [2019-01-01 21:39:51,886 INFO L796 eck$LassoCheckResult]: Loop: 1699#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1696#L20-1 assume !(0 == main_~up~0); 1697#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 1692#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1690#L14 assume !(0 == main_~i~0); 1688#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 1679#L17-1 assume !(1 == main_~up~0); 1687#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 1686#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 1682#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1683#L14 assume !(0 == main_~i~0); 1678#L14-2 assume !(main_~i~0 == main_~range~0); 1677#L17-1 assume !(1 == main_~up~0); 1676#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 1674#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 1675#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1680#L14 assume 0 == main_~i~0;main_~up~0 := 1; 1681#L14-2 assume !(main_~i~0 == main_~range~0); 1699#L17-1 [2019-01-01 21:39:51,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:51,886 INFO L82 PathProgramCache]: Analyzing trace with hash 963346, now seen corresponding path program 3 times [2019-01-01 21:39:51,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:51,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:51,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:51,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:51,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:51,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:51,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1416950548, now seen corresponding path program 1 times [2019-01-01 21:39:51,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:51,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:51,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:51,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:51,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:52,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:39:52,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:39:52,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:52,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:52,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:39:52,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-01-01 21:39:52,635 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:39:52,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 21:39:52,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-01-01 21:39:52,635 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. cyclomatic complexity: 35 Second operand 13 states. [2019-01-01 21:39:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:53,507 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2019-01-01 21:39:53,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 21:39:53,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 155 transitions. [2019-01-01 21:39:53,509 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 48 [2019-01-01 21:39:53,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 121 states and 140 transitions. [2019-01-01 21:39:53,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2019-01-01 21:39:53,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2019-01-01 21:39:53,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 140 transitions. [2019-01-01 21:39:53,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:53,513 INFO L705 BuchiCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-01-01 21:39:53,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 140 transitions. [2019-01-01 21:39:53,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2019-01-01 21:39:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 21:39:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2019-01-01 21:39:53,531 INFO L728 BuchiCegarLoop]: Abstraction has 107 states and 126 transitions. [2019-01-01 21:39:53,531 INFO L608 BuchiCegarLoop]: Abstraction has 107 states and 126 transitions. [2019-01-01 21:39:53,531 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 21:39:53,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 126 transitions. [2019-01-01 21:39:53,535 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 48 [2019-01-01 21:39:53,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:53,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:53,536 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:39:53,536 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:39:53,536 INFO L794 eck$LassoCheckResult]: Stem: 1959#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 1960#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1988#L14 assume 0 == main_~i~0;main_~up~0 := 1; 1985#L14-2 assume !(main_~i~0 == main_~range~0); 1983#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1980#L20-1 assume !(0 == main_~up~0); 1981#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 1989#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1986#L14 assume !(0 == main_~i~0); 1987#L14-2 [2019-01-01 21:39:53,536 INFO L796 eck$LassoCheckResult]: Loop: 1987#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2038#L17-1 assume !(1 == main_~up~0); 2036#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2035#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2034#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2022#L14 assume 0 == main_~i~0;main_~up~0 := 1; 1969#L14-2 assume !(main_~i~0 == main_~range~0); 1970#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2053#L20-1 assume !(0 == main_~up~0); 2051#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2021#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2020#L14 assume !(0 == main_~i~0); 1987#L14-2 [2019-01-01 21:39:53,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:53,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1817200562, now seen corresponding path program 2 times [2019-01-01 21:39:53,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:53,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:53,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:53,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:53,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:53,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:53,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1139092067, now seen corresponding path program 2 times [2019-01-01 21:39:53,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:53,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:53,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:53,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:53,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:53,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:53,588 INFO L82 PathProgramCache]: Analyzing trace with hash -140873580, now seen corresponding path program 1 times [2019-01-01 21:39:53,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:53,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:53,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:53,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:53,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 21:39:53,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:39:53,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:39:53,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:53,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:53,771 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 21:39:53,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:39:53,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-01-01 21:39:53,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:39:53,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:39:53,847 INFO L87 Difference]: Start difference. First operand 107 states and 126 transitions. cyclomatic complexity: 26 Second operand 7 states. [2019-01-01 21:39:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:54,152 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2019-01-01 21:39:54,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:39:54,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 132 transitions. [2019-01-01 21:39:54,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2019-01-01 21:39:54,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 104 states and 120 transitions. [2019-01-01 21:39:54,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2019-01-01 21:39:54,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-01-01 21:39:54,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 120 transitions. [2019-01-01 21:39:54,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:54,158 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 120 transitions. [2019-01-01 21:39:54,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 120 transitions. [2019-01-01 21:39:54,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2019-01-01 21:39:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-01 21:39:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2019-01-01 21:39:54,171 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 110 transitions. [2019-01-01 21:39:54,171 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 110 transitions. [2019-01-01 21:39:54,171 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 21:39:54,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 110 transitions. [2019-01-01 21:39:54,174 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2019-01-01 21:39:54,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:54,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:54,175 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1] [2019-01-01 21:39:54,176 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:39:54,176 INFO L794 eck$LassoCheckResult]: Stem: 2252#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 2253#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2274#L14 assume !(0 == main_~i~0); 2296#L14-2 assume !(main_~i~0 == main_~range~0); 2295#L17-1 assume !(1 == main_~up~0); 2294#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2292#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 2261#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2330#L14 assume !(0 == main_~i~0); 2329#L14-2 assume !(main_~i~0 == main_~range~0); 2326#L17-1 assume !(1 == main_~up~0); 2277#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2278#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 2319#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2315#L14 assume 0 == main_~i~0;main_~up~0 := 1; 2316#L14-2 [2019-01-01 21:39:54,176 INFO L796 eck$LassoCheckResult]: Loop: 2316#L14-2 assume !(main_~i~0 == main_~range~0); 2341#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2339#L20-1 assume !(0 == main_~up~0); 2338#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2337#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2336#L14 assume !(0 == main_~i~0); 2334#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2333#L17-1 assume !(1 == main_~up~0); 2323#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2322#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2320#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2318#L14 assume 0 == main_~i~0;main_~up~0 := 1; 2316#L14-2 [2019-01-01 21:39:54,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:54,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1377251387, now seen corresponding path program 2 times [2019-01-01 21:39:54,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:54,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:54,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:54,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:54,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:54,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:39:54,270 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:39:54,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:39:54,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:39:54,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:39:54,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:54,318 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:54,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:39:54,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-01-01 21:39:54,341 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:39:54,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:54,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 3 times [2019-01-01 21:39:54,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:54,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:54,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:54,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:54,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:54,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:39:54,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:39:54,427 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. cyclomatic complexity: 22 Second operand 6 states. [2019-01-01 21:39:54,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:54,558 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2019-01-01 21:39:54,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 21:39:54,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 181 transitions. [2019-01-01 21:39:54,562 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 52 [2019-01-01 21:39:54,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 154 states and 178 transitions. [2019-01-01 21:39:54,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2019-01-01 21:39:54,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2019-01-01 21:39:54,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 178 transitions. [2019-01-01 21:39:54,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:54,565 INFO L705 BuchiCegarLoop]: Abstraction has 154 states and 178 transitions. [2019-01-01 21:39:54,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 178 transitions. [2019-01-01 21:39:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 118. [2019-01-01 21:39:54,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-01 21:39:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2019-01-01 21:39:54,569 INFO L728 BuchiCegarLoop]: Abstraction has 118 states and 138 transitions. [2019-01-01 21:39:54,569 INFO L608 BuchiCegarLoop]: Abstraction has 118 states and 138 transitions. [2019-01-01 21:39:54,570 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 21:39:54,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 138 transitions. [2019-01-01 21:39:54,573 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 48 [2019-01-01 21:39:54,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:54,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:54,574 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1] [2019-01-01 21:39:54,574 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1] [2019-01-01 21:39:54,574 INFO L794 eck$LassoCheckResult]: Stem: 2561#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 2562#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2621#L14 assume 0 == main_~i~0;main_~up~0 := 1; 2620#L14-2 assume !(main_~i~0 == main_~range~0); 2619#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2618#L20-1 assume !(0 == main_~up~0); 2616#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2617#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2595#L14 assume !(0 == main_~i~0); 2594#L14-2 assume !(main_~i~0 == main_~range~0); 2593#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2592#L20-1 assume !(0 == main_~up~0); 2590#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2591#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2598#L14 assume !(0 == main_~i~0); 2676#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2675#L17-1 [2019-01-01 21:39:54,575 INFO L796 eck$LassoCheckResult]: Loop: 2675#L17-1 assume !(1 == main_~up~0); 2573#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2574#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2579#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2577#L14 assume !(0 == main_~i~0); 2571#L14-2 assume !(main_~i~0 == main_~range~0); 2563#L17-1 assume !(1 == main_~up~0); 2564#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2666#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2667#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2677#L14 assume !(0 == main_~i~0); 2678#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2675#L17-1 [2019-01-01 21:39:54,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:54,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1260517746, now seen corresponding path program 1 times [2019-01-01 21:39:54,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:54,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:54,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:54,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:54,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:54,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:54,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:39:54,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:39:54,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:54,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:54,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:39:54,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-01-01 21:39:54,777 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:39:54,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:54,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1690025817, now seen corresponding path program 1 times [2019-01-01 21:39:54,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:54,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:54,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:54,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:54,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:54,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:39:54,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:39:54,915 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:39:54,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:39:54,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:39:54,916 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. cyclomatic complexity: 28 Second operand 4 states. [2019-01-01 21:39:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:55,015 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2019-01-01 21:39:55,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:39:55,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 127 transitions. [2019-01-01 21:39:55,019 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2019-01-01 21:39:55,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 113 states and 127 transitions. [2019-01-01 21:39:55,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2019-01-01 21:39:55,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2019-01-01 21:39:55,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 127 transitions. [2019-01-01 21:39:55,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:55,024 INFO L705 BuchiCegarLoop]: Abstraction has 113 states and 127 transitions. [2019-01-01 21:39:55,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 127 transitions. [2019-01-01 21:39:55,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 93. [2019-01-01 21:39:55,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-01 21:39:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2019-01-01 21:39:55,030 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 107 transitions. [2019-01-01 21:39:55,030 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 107 transitions. [2019-01-01 21:39:55,030 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 21:39:55,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 107 transitions. [2019-01-01 21:39:55,031 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2019-01-01 21:39:55,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:55,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:55,032 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 21:39:55,032 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:39:55,033 INFO L794 eck$LassoCheckResult]: Stem: 2855#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 2856#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2873#L14 assume 0 == main_~i~0;main_~up~0 := 1; 2879#L14-2 assume !(main_~i~0 == main_~range~0); 2876#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2877#L20-1 assume !(0 == main_~up~0); 2890#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2891#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2880#L14 assume !(0 == main_~i~0); 2878#L14-2 assume !(main_~i~0 == main_~range~0); 2874#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2875#L20-1 assume !(0 == main_~up~0); 2892#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2881#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2882#L14 assume !(0 == main_~i~0); 2894#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2851#L17-1 assume !(1 == main_~up~0); 2852#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2857#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2858#L26-1 [2019-01-01 21:39:55,033 INFO L796 eck$LassoCheckResult]: Loop: 2858#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2867#L14 assume !(0 == main_~i~0); 2861#L14-2 assume !(main_~i~0 == main_~range~0); 2862#L17-1 assume !(1 == main_~up~0); 2941#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2939#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2858#L26-1 [2019-01-01 21:39:55,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:55,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1185129105, now seen corresponding path program 2 times [2019-01-01 21:39:55,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:55,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:55,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:55,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:55,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:55,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:39:55,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:39:55,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:39:55,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:39:55,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:39:55,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:55,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:39:55,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-01-01 21:39:55,296 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:39:55,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:55,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1188300564, now seen corresponding path program 2 times [2019-01-01 21:39:55,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:55,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:55,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:55,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:55,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:55,356 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:55,356 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:55,356 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:55,356 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:55,357 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:55,357 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:55,357 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:55,357 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:55,357 INFO L131 ssoRankerPreferences]: Filename of dumped script: Narrowing_false-termination_true-no-overflow.c_Iteration12_Loop [2019-01-01 21:39:55,358 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:55,358 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:55,360 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-01 21:39:55,366 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-01 21:39:55,368 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-01 21:39:55,380 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-01 21:39:55,494 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:55,494 INFO L412 LassoAnalysis]: Checking for nontermination... 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) [2019-01-01 21:39:55,501 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:55,502 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:55,508 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:55,509 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 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-01 21:39:55,530 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:55,530 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:55,550 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:55,550 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:39:55,571 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:55,571 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:55,592 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:55,592 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 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-01 21:39:55,599 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:55,599 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) [2019-01-01 21:39:55,623 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:55,623 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:55,649 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:55,651 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:55,651 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:55,651 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:55,651 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:55,651 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:55,651 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:55,651 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:55,651 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:55,651 INFO L131 ssoRankerPreferences]: Filename of dumped script: Narrowing_false-termination_true-no-overflow.c_Iteration12_Loop [2019-01-01 21:39:55,652 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:55,652 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:55,653 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-01 21:39:55,664 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-01 21:39:55,668 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-01 21:39:55,671 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-01 21:39:55,764 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:55,764 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:55,765 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-01 21:39:55,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:55,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:55,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:55,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:55,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:55,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:55,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:55,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:55,768 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-01 21:39:55,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:55,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:55,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:55,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:55,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:55,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:55,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:55,772 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-01 21:39:55,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:55,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:55,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:55,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:55,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:55,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:55,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:55,777 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-01 21:39:55,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:55,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:55,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:55,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:55,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:55,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:55,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:55,781 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:55,782 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:39:55,782 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:39:55,783 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:55,783 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:55,783 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:55,783 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-01 21:39:55,783 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:56,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:56,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:56,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:56,393 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-01 21:39:56,394 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-01 21:39:56,394 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 107 transitions. cyclomatic complexity: 22 Second operand 4 states. [2019-01-01 21:39:56,696 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 107 transitions. cyclomatic complexity: 22. Second operand 4 states. Result 187 states and 220 transitions. Complement of second has 7 states. [2019-01-01 21:39:56,697 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-01 21:39:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:39:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-01-01 21:39:56,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 6 letters. [2019-01-01 21:39:56,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:56,698 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:56,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:56,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:56,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:56,777 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-01 21:39:56,778 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-01 21:39:56,778 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 107 transitions. cyclomatic complexity: 22 Second operand 4 states. [2019-01-01 21:39:56,827 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 107 transitions. cyclomatic complexity: 22. Second operand 4 states. Result 187 states and 220 transitions. Complement of second has 7 states. [2019-01-01 21:39:56,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:39:56,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:39:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-01-01 21:39:56,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 6 letters. [2019-01-01 21:39:56,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:56,828 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:56,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:56,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:56,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:56,916 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-01 21:39:56,917 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-01 21:39:56,917 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 107 transitions. cyclomatic complexity: 22 Second operand 4 states. [2019-01-01 21:39:56,989 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 107 transitions. cyclomatic complexity: 22. Second operand 4 states. Result 191 states and 227 transitions. Complement of second has 8 states. [2019-01-01 21:39:56,989 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-01 21:39:56,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:39:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-01-01 21:39:56,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 19 letters. Loop has 6 letters. [2019-01-01 21:39:56,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:56,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 25 letters. Loop has 6 letters. [2019-01-01 21:39:56,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:56,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 19 letters. Loop has 12 letters. [2019-01-01 21:39:56,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:56,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 227 transitions. [2019-01-01 21:39:56,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2019-01-01 21:39:56,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 130 states and 150 transitions. [2019-01-01 21:39:56,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-01 21:39:56,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-01 21:39:56,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 150 transitions. [2019-01-01 21:39:56,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:56,997 INFO L705 BuchiCegarLoop]: Abstraction has 130 states and 150 transitions. [2019-01-01 21:39:56,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 150 transitions. [2019-01-01 21:39:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 70. [2019-01-01 21:39:57,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-01 21:39:57,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2019-01-01 21:39:57,002 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 81 transitions. [2019-01-01 21:39:57,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 21:39:57,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-01 21:39:57,002 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 9 states. [2019-01-01 21:39:57,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:57,079 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2019-01-01 21:39:57,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:39:57,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 92 transitions. [2019-01-01 21:39:57,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:39:57,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 79 states and 90 transitions. [2019-01-01 21:39:57,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-01 21:39:57,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-01 21:39:57,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 90 transitions. [2019-01-01 21:39:57,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:57,083 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 90 transitions. [2019-01-01 21:39:57,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 90 transitions. [2019-01-01 21:39:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-01-01 21:39:57,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-01 21:39:57,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2019-01-01 21:39:57,085 INFO L728 BuchiCegarLoop]: Abstraction has 76 states and 87 transitions. [2019-01-01 21:39:57,086 INFO L608 BuchiCegarLoop]: Abstraction has 76 states and 87 transitions. [2019-01-01 21:39:57,086 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-01 21:39:57,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 87 transitions. [2019-01-01 21:39:57,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:39:57,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:57,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:57,087 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 1] [2019-01-01 21:39:57,088 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:39:57,088 INFO L794 eck$LassoCheckResult]: Stem: 3992#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 3993#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4063#L14 assume !(0 == main_~i~0); 4062#L14-2 assume !(main_~i~0 == main_~range~0); 4022#L17-1 assume !(1 == main_~up~0); 4020#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4016#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4017#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4046#L14 assume !(0 == main_~i~0); 4045#L14-2 assume !(main_~i~0 == main_~range~0); 4044#L17-1 assume !(1 == main_~up~0); 4043#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4041#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4031#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4040#L14 assume !(0 == main_~i~0); 4039#L14-2 assume !(main_~i~0 == main_~range~0); 4037#L17-1 assume !(1 == main_~up~0); 4035#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4030#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4029#L26-1 [2019-01-01 21:39:57,088 INFO L796 eck$LassoCheckResult]: Loop: 4029#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4027#L14 assume 0 == main_~i~0;main_~up~0 := 1; 4015#L14-2 assume !(main_~i~0 == main_~range~0); 4010#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4011#L20-1 assume !(0 == main_~up~0); 3994#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 3995#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4038#L14 assume !(0 == main_~i~0); 4036#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 4034#L17-1 assume !(1 == main_~up~0); 4033#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4032#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4029#L26-1 [2019-01-01 21:39:57,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:57,088 INFO L82 PathProgramCache]: Analyzing trace with hash -370701997, now seen corresponding path program 1 times [2019-01-01 21:39:57,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:57,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:57,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:57,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:57,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:57,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:57,100 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 4 times [2019-01-01 21:39:57,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:57,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:57,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:57,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:57,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:57,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:57,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1599701067, now seen corresponding path program 1 times [2019-01-01 21:39:57,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:57,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:57,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:57,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:57,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:39:57,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:39:57,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:39:57,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:57,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:39:57,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:39:57,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-01-01 21:39:57,437 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 21:39:57,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 21:39:57,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:39:57,451 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. cyclomatic complexity: 16 Second operand 8 states. [2019-01-01 21:39:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:57,863 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2019-01-01 21:39:57,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 21:39:57,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 168 transitions. [2019-01-01 21:39:57,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:39:57,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 144 states and 163 transitions. [2019-01-01 21:39:57,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-01 21:39:57,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-01 21:39:57,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 163 transitions. [2019-01-01 21:39:57,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:57,868 INFO L705 BuchiCegarLoop]: Abstraction has 144 states and 163 transitions. [2019-01-01 21:39:57,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 163 transitions. [2019-01-01 21:39:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 88. [2019-01-01 21:39:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-01 21:39:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2019-01-01 21:39:57,871 INFO L728 BuchiCegarLoop]: Abstraction has 88 states and 101 transitions. [2019-01-01 21:39:57,871 INFO L608 BuchiCegarLoop]: Abstraction has 88 states and 101 transitions. [2019-01-01 21:39:57,871 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-01 21:39:57,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 101 transitions. [2019-01-01 21:39:57,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:39:57,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:57,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:57,873 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 3, 2, 1] [2019-01-01 21:39:57,873 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:39:57,873 INFO L794 eck$LassoCheckResult]: Stem: 4331#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 4332#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4381#L14 assume !(0 == main_~i~0); 4382#L14-2 assume !(main_~i~0 == main_~range~0); 4365#L17-1 assume !(1 == main_~up~0); 4362#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4358#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4359#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4417#L14 assume !(0 == main_~i~0); 4415#L14-2 assume !(main_~i~0 == main_~range~0); 4413#L17-1 assume !(1 == main_~up~0); 4411#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4409#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4408#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4407#L14 assume !(0 == main_~i~0); 4406#L14-2 assume !(main_~i~0 == main_~range~0); 4405#L17-1 assume !(1 == main_~up~0); 4404#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4403#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4398#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4402#L14 assume !(0 == main_~i~0); 4401#L14-2 assume !(main_~i~0 == main_~range~0); 4400#L17-1 assume !(1 == main_~up~0); 4399#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4397#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4385#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4396#L14 assume !(0 == main_~i~0); 4395#L14-2 assume !(main_~i~0 == main_~range~0); 4394#L17-1 assume !(1 == main_~up~0); 4387#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4384#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4383#L26-1 [2019-01-01 21:39:57,873 INFO L796 eck$LassoCheckResult]: Loop: 4383#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4380#L14 assume 0 == main_~i~0;main_~up~0 := 1; 4356#L14-2 assume !(main_~i~0 == main_~range~0); 4357#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4344#L20-1 assume !(0 == main_~up~0); 4345#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4392#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4391#L14 assume !(0 == main_~i~0); 4390#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 4389#L17-1 assume !(1 == main_~up~0); 4388#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4386#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4383#L26-1 [2019-01-01 21:39:57,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:57,874 INFO L82 PathProgramCache]: Analyzing trace with hash 835038265, now seen corresponding path program 1 times [2019-01-01 21:39:57,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:57,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:57,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:57,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:57,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 21:39:57,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:39:57,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 21:39:57,966 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:39:57,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:57,966 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 5 times [2019-01-01 21:39:57,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:57,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:57,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:57,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:57,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:58,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:39:58,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:39:58,067 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. cyclomatic complexity: 18 Second operand 6 states. [2019-01-01 21:39:58,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:58,118 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2019-01-01 21:39:58,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:39:58,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 150 transitions. [2019-01-01 21:39:58,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:39:58,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 109 states and 119 transitions. [2019-01-01 21:39:58,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:39:58,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:39:58,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 119 transitions. [2019-01-01 21:39:58,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:58,124 INFO L705 BuchiCegarLoop]: Abstraction has 109 states and 119 transitions. [2019-01-01 21:39:58,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 119 transitions. [2019-01-01 21:39:58,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-01-01 21:39:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 21:39:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-01-01 21:39:58,127 INFO L728 BuchiCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-01-01 21:39:58,127 INFO L608 BuchiCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-01-01 21:39:58,127 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-01 21:39:58,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 118 transitions. [2019-01-01 21:39:58,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:39:58,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:58,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:58,129 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 1] [2019-01-01 21:39:58,129 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:39:58,129 INFO L794 eck$LassoCheckResult]: Stem: 4563#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 4564#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4580#L14 assume !(0 == main_~i~0); 4574#L14-2 assume !(main_~i~0 == main_~range~0); 4575#L17-1 assume !(1 == main_~up~0); 4669#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4655#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4653#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4652#L14 assume !(0 == main_~i~0); 4650#L14-2 assume !(main_~i~0 == main_~range~0); 4648#L17-1 assume !(1 == main_~up~0); 4646#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4644#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4643#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4642#L14 assume !(0 == main_~i~0); 4641#L14-2 assume !(main_~i~0 == main_~range~0); 4640#L17-1 assume !(1 == main_~up~0); 4639#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4638#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4637#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4636#L14 assume !(0 == main_~i~0); 4635#L14-2 assume !(main_~i~0 == main_~range~0); 4634#L17-1 assume !(1 == main_~up~0); 4632#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4631#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4614#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4627#L14 assume !(0 == main_~i~0); 4624#L14-2 assume !(main_~i~0 == main_~range~0); 4621#L17-1 assume !(1 == main_~up~0); 4618#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4613#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4610#L26-1 [2019-01-01 21:39:58,130 INFO L796 eck$LassoCheckResult]: Loop: 4610#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4611#L14 assume 0 == main_~i~0;main_~up~0 := 1; 4612#L14-2 assume !(main_~i~0 == main_~range~0); 4583#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4576#L20-1 assume !(0 == main_~up~0); 4577#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4630#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4628#L14 assume !(0 == main_~i~0); 4625#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 4622#L17-1 assume !(1 == main_~up~0); 4619#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4615#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4610#L26-1 [2019-01-01 21:39:58,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:58,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1184179275, now seen corresponding path program 2 times [2019-01-01 21:39:58,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:58,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:58,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:58,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:58,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:58,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:58,142 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 6 times [2019-01-01 21:39:58,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:58,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:58,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:58,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:58,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:58,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:58,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1981329641, now seen corresponding path program 2 times [2019-01-01 21:39:58,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:58,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:58,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:58,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:58,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 52 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:39:58,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:39:58,297 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:39:58,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:39:58,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:39:58,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:39:58,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 52 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:39:58,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:39:58,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 21:39:58,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 21:39:58,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:39:58,415 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. cyclomatic complexity: 14 Second operand 8 states. [2019-01-01 21:39:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:58,553 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2019-01-01 21:39:58,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 21:39:58,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 131 transitions. [2019-01-01 21:39:58,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:39:58,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 119 states and 129 transitions. [2019-01-01 21:39:58,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:39:58,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:39:58,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 129 transitions. [2019-01-01 21:39:58,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:58,560 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 129 transitions. [2019-01-01 21:39:58,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 129 transitions. [2019-01-01 21:39:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2019-01-01 21:39:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 21:39:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-01-01 21:39:58,565 INFO L728 BuchiCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-01-01 21:39:58,566 INFO L608 BuchiCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-01-01 21:39:58,566 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-01 21:39:58,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 124 transitions. [2019-01-01 21:39:58,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:39:58,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:58,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:58,572 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 6, 6, 1] [2019-01-01 21:39:58,572 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:39:58,572 INFO L794 eck$LassoCheckResult]: Stem: 4941#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 4942#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4981#L14 assume !(0 == main_~i~0); 5050#L14-2 assume !(main_~i~0 == main_~range~0); 5049#L17-1 assume !(1 == main_~up~0); 5047#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5046#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5045#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5044#L14 assume !(0 == main_~i~0); 5042#L14-2 assume !(main_~i~0 == main_~range~0); 5040#L17-1 assume !(1 == main_~up~0); 5038#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5036#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5035#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5034#L14 assume !(0 == main_~i~0); 5033#L14-2 assume !(main_~i~0 == main_~range~0); 5032#L17-1 assume !(1 == main_~up~0); 5031#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5030#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5029#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5028#L14 assume !(0 == main_~i~0); 5027#L14-2 assume !(main_~i~0 == main_~range~0); 5026#L17-1 assume !(1 == main_~up~0); 5025#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5024#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5023#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5022#L14 assume !(0 == main_~i~0); 5021#L14-2 assume !(main_~i~0 == main_~range~0); 5020#L17-1 assume !(1 == main_~up~0); 5019#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5018#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4989#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5016#L14 assume !(0 == main_~i~0); 5014#L14-2 assume !(main_~i~0 == main_~range~0); 5012#L17-1 assume !(1 == main_~up~0); 4993#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4988#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4985#L26-1 [2019-01-01 21:39:58,572 INFO L796 eck$LassoCheckResult]: Loop: 4985#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4986#L14 assume 0 == main_~i~0;main_~up~0 := 1; 4987#L14-2 assume !(main_~i~0 == main_~range~0); 4957#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4950#L20-1 assume !(0 == main_~up~0); 4951#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 5002#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5000#L14 assume !(0 == main_~i~0); 4998#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 4996#L17-1 assume !(1 == main_~up~0); 4994#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4990#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4985#L26-1 [2019-01-01 21:39:58,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:58,573 INFO L82 PathProgramCache]: Analyzing trace with hash -279950394, now seen corresponding path program 3 times [2019-01-01 21:39:58,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:58,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:58,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:58,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:58,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:58,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:58,589 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 7 times [2019-01-01 21:39:58,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:58,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:58,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:58,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:58,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:58,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:58,597 INFO L82 PathProgramCache]: Analyzing trace with hash 970468776, now seen corresponding path program 3 times [2019-01-01 21:39:58,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:58,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:58,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:58,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:58,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 62 proven. 102 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:39:58,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:39:58,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:39:58,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:39:58,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-01 21:39:58,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:39:58,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 62 proven. 102 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:39:58,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:39:58,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 21:39:59,021 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 18 [2019-01-01 21:39:59,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 21:39:59,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-01 21:39:59,033 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. cyclomatic complexity: 14 Second operand 9 states. [2019-01-01 21:39:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:59,169 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2019-01-01 21:39:59,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 21:39:59,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 137 transitions. [2019-01-01 21:39:59,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:39:59,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 125 states and 135 transitions. [2019-01-01 21:39:59,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:39:59,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:39:59,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 135 transitions. [2019-01-01 21:39:59,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:59,173 INFO L705 BuchiCegarLoop]: Abstraction has 125 states and 135 transitions. [2019-01-01 21:39:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 135 transitions. [2019-01-01 21:39:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2019-01-01 21:39:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-01 21:39:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2019-01-01 21:39:59,175 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 130 transitions. [2019-01-01 21:39:59,176 INFO L608 BuchiCegarLoop]: Abstraction has 120 states and 130 transitions. [2019-01-01 21:39:59,176 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2019-01-01 21:39:59,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 130 transitions. [2019-01-01 21:39:59,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:39:59,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:59,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:59,178 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 7, 7, 7, 7, 1] [2019-01-01 21:39:59,178 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:39:59,178 INFO L794 eck$LassoCheckResult]: Stem: 5342#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 5343#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5386#L14 assume !(0 == main_~i~0); 5461#L14-2 assume !(main_~i~0 == main_~range~0); 5460#L17-1 assume !(1 == main_~up~0); 5458#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5457#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5456#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5455#L14 assume !(0 == main_~i~0); 5453#L14-2 assume !(main_~i~0 == main_~range~0); 5451#L17-1 assume !(1 == main_~up~0); 5449#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5447#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5446#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5445#L14 assume !(0 == main_~i~0); 5444#L14-2 assume !(main_~i~0 == main_~range~0); 5443#L17-1 assume !(1 == main_~up~0); 5442#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5441#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5440#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5439#L14 assume !(0 == main_~i~0); 5438#L14-2 assume !(main_~i~0 == main_~range~0); 5437#L17-1 assume !(1 == main_~up~0); 5436#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5435#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5434#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5433#L14 assume !(0 == main_~i~0); 5432#L14-2 assume !(main_~i~0 == main_~range~0); 5431#L17-1 assume !(1 == main_~up~0); 5430#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5429#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5428#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5427#L14 assume !(0 == main_~i~0); 5426#L14-2 assume !(main_~i~0 == main_~range~0); 5425#L17-1 assume !(1 == main_~up~0); 5424#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5423#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5394#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5421#L14 assume !(0 == main_~i~0); 5419#L14-2 assume !(main_~i~0 == main_~range~0); 5417#L17-1 assume !(1 == main_~up~0); 5398#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5393#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5390#L26-1 [2019-01-01 21:39:59,178 INFO L796 eck$LassoCheckResult]: Loop: 5390#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5391#L14 assume 0 == main_~i~0;main_~up~0 := 1; 5392#L14-2 assume !(main_~i~0 == main_~range~0); 5362#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5355#L20-1 assume !(0 == main_~up~0); 5356#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 5407#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5405#L14 assume !(0 == main_~i~0); 5403#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 5401#L17-1 assume !(1 == main_~up~0); 5399#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5395#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 5390#L26-1 [2019-01-01 21:39:59,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:59,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1565807849, now seen corresponding path program 4 times [2019-01-01 21:39:59,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:59,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:59,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:59,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:59,193 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 8 times [2019-01-01 21:39:59,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:59,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:59,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:59,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:59,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:59,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:59,198 INFO L82 PathProgramCache]: Analyzing trace with hash -745399431, now seen corresponding path program 4 times [2019-01-01 21:39:59,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:59,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:59,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:59,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:59,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 72 proven. 140 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:39:59,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:39:59,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 21:39:59,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 21:39:59,335 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 21:39:59,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:39:59,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 72 proven. 140 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:39:59,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:39:59,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 21:39:59,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 21:39:59,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-01 21:39:59,424 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. cyclomatic complexity: 14 Second operand 10 states. [2019-01-01 21:39:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:59,603 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2019-01-01 21:39:59,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 21:39:59,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 143 transitions. [2019-01-01 21:39:59,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:39:59,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 131 states and 141 transitions. [2019-01-01 21:39:59,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:39:59,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:39:59,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 141 transitions. [2019-01-01 21:39:59,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:59,606 INFO L705 BuchiCegarLoop]: Abstraction has 131 states and 141 transitions. [2019-01-01 21:39:59,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 141 transitions. [2019-01-01 21:39:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2019-01-01 21:39:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-01 21:39:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2019-01-01 21:39:59,610 INFO L728 BuchiCegarLoop]: Abstraction has 126 states and 136 transitions. [2019-01-01 21:39:59,610 INFO L608 BuchiCegarLoop]: Abstraction has 126 states and 136 transitions. [2019-01-01 21:39:59,610 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2019-01-01 21:39:59,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 136 transitions. [2019-01-01 21:39:59,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:39:59,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:59,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:59,612 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 8, 8, 1] [2019-01-01 21:39:59,612 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:39:59,613 INFO L794 eck$LassoCheckResult]: Stem: 5778#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 5779#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5822#L14 assume !(0 == main_~i~0); 5903#L14-2 assume !(main_~i~0 == main_~range~0); 5902#L17-1 assume !(1 == main_~up~0); 5900#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5899#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5898#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5897#L14 assume !(0 == main_~i~0); 5895#L14-2 assume !(main_~i~0 == main_~range~0); 5893#L17-1 assume !(1 == main_~up~0); 5891#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5889#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5888#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5887#L14 assume !(0 == main_~i~0); 5886#L14-2 assume !(main_~i~0 == main_~range~0); 5885#L17-1 assume !(1 == main_~up~0); 5884#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5883#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5882#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5881#L14 assume !(0 == main_~i~0); 5880#L14-2 assume !(main_~i~0 == main_~range~0); 5879#L17-1 assume !(1 == main_~up~0); 5878#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5877#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5876#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5875#L14 assume !(0 == main_~i~0); 5874#L14-2 assume !(main_~i~0 == main_~range~0); 5873#L17-1 assume !(1 == main_~up~0); 5872#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5871#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5870#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5869#L14 assume !(0 == main_~i~0); 5868#L14-2 assume !(main_~i~0 == main_~range~0); 5867#L17-1 assume !(1 == main_~up~0); 5866#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5865#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5864#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5863#L14 assume !(0 == main_~i~0); 5862#L14-2 assume !(main_~i~0 == main_~range~0); 5861#L17-1 assume !(1 == main_~up~0); 5860#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5859#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5830#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5857#L14 assume !(0 == main_~i~0); 5855#L14-2 assume !(main_~i~0 == main_~range~0); 5853#L17-1 assume !(1 == main_~up~0); 5834#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5829#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5826#L26-1 [2019-01-01 21:39:59,613 INFO L796 eck$LassoCheckResult]: Loop: 5826#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5827#L14 assume 0 == main_~i~0;main_~up~0 := 1; 5828#L14-2 assume !(main_~i~0 == main_~range~0); 5798#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5791#L20-1 assume !(0 == main_~up~0); 5792#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 5843#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5841#L14 assume !(0 == main_~i~0); 5839#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 5837#L17-1 assume !(1 == main_~up~0); 5835#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5831#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 5826#L26-1 [2019-01-01 21:39:59,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:59,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1385990568, now seen corresponding path program 5 times [2019-01-01 21:39:59,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:59,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:59,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:59,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:59,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:59,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:59,630 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 9 times [2019-01-01 21:39:59,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:59,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:59,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:59,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:59,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:59,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:59,636 INFO L82 PathProgramCache]: Analyzing trace with hash -748902262, now seen corresponding path program 5 times [2019-01-01 21:39:59,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:59,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:59,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:59,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:59,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 82 proven. 184 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:39:59,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:39:59,914 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-01 21:39:59,928 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 21:39:59,952 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-01-01 21:39:59,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:39:59,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:40:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 82 proven. 184 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:00,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:40:00,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2019-01-01 21:40:00,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 21:40:00,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-01-01 21:40:00,126 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. cyclomatic complexity: 14 Second operand 17 states. [2019-01-01 21:40:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:40:00,505 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2019-01-01 21:40:00,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 21:40:00,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 149 transitions. [2019-01-01 21:40:00,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:00,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 137 states and 147 transitions. [2019-01-01 21:40:00,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:40:00,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:40:00,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 147 transitions. [2019-01-01 21:40:00,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:40:00,511 INFO L705 BuchiCegarLoop]: Abstraction has 137 states and 147 transitions. [2019-01-01 21:40:00,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 147 transitions. [2019-01-01 21:40:00,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2019-01-01 21:40:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-01 21:40:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2019-01-01 21:40:00,514 INFO L728 BuchiCegarLoop]: Abstraction has 132 states and 142 transitions. [2019-01-01 21:40:00,514 INFO L608 BuchiCegarLoop]: Abstraction has 132 states and 142 transitions. [2019-01-01 21:40:00,514 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2019-01-01 21:40:00,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 142 transitions. [2019-01-01 21:40:00,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:00,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:40:00,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:40:00,517 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 9, 9, 9, 9, 1] [2019-01-01 21:40:00,517 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:40:00,517 INFO L794 eck$LassoCheckResult]: Stem: 6281#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 6282#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6321#L14 assume !(0 == main_~i~0); 6408#L14-2 assume !(main_~i~0 == main_~range~0); 6407#L17-1 assume !(1 == main_~up~0); 6405#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6404#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6403#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6402#L14 assume !(0 == main_~i~0); 6400#L14-2 assume !(main_~i~0 == main_~range~0); 6398#L17-1 assume !(1 == main_~up~0); 6396#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6394#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6393#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6392#L14 assume !(0 == main_~i~0); 6391#L14-2 assume !(main_~i~0 == main_~range~0); 6390#L17-1 assume !(1 == main_~up~0); 6389#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6388#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6387#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6386#L14 assume !(0 == main_~i~0); 6385#L14-2 assume !(main_~i~0 == main_~range~0); 6384#L17-1 assume !(1 == main_~up~0); 6383#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6382#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6381#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6380#L14 assume !(0 == main_~i~0); 6379#L14-2 assume !(main_~i~0 == main_~range~0); 6378#L17-1 assume !(1 == main_~up~0); 6377#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6376#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6375#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6374#L14 assume !(0 == main_~i~0); 6373#L14-2 assume !(main_~i~0 == main_~range~0); 6372#L17-1 assume !(1 == main_~up~0); 6371#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6370#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6369#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6368#L14 assume !(0 == main_~i~0); 6367#L14-2 assume !(main_~i~0 == main_~range~0); 6366#L17-1 assume !(1 == main_~up~0); 6365#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6364#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6363#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6362#L14 assume !(0 == main_~i~0); 6361#L14-2 assume !(main_~i~0 == main_~range~0); 6360#L17-1 assume !(1 == main_~up~0); 6359#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6358#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6329#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6356#L14 assume !(0 == main_~i~0); 6354#L14-2 assume !(main_~i~0 == main_~range~0); 6352#L17-1 assume !(1 == main_~up~0); 6333#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6328#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6325#L26-1 [2019-01-01 21:40:00,517 INFO L796 eck$LassoCheckResult]: Loop: 6325#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6326#L14 assume 0 == main_~i~0;main_~up~0 := 1; 6327#L14-2 assume !(main_~i~0 == main_~range~0); 6297#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6290#L20-1 assume !(0 == main_~up~0); 6291#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 6342#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6340#L14 assume !(0 == main_~i~0); 6338#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 6336#L17-1 assume !(1 == main_~up~0); 6334#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6330#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 6325#L26-1 [2019-01-01 21:40:00,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:00,518 INFO L82 PathProgramCache]: Analyzing trace with hash -329877639, now seen corresponding path program 6 times [2019-01-01 21:40:00,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:00,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:00,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:00,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:00,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:00,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:00,537 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 10 times [2019-01-01 21:40:00,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:00,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:00,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:00,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:00,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:00,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:00,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1517067045, now seen corresponding path program 6 times [2019-01-01 21:40:00,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:00,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:00,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:00,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:00,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:40:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 92 proven. 234 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:00,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:40:00,711 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-01 21:40:00,734 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 21:40:00,880 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-01-01 21:40:00,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:40:00,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:40:00,895 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 92 proven. 234 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:00,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:40:00,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-01 21:40:00,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 21:40:00,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-01-01 21:40:00,976 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. cyclomatic complexity: 14 Second operand 12 states. [2019-01-01 21:40:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:40:01,729 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2019-01-01 21:40:01,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 21:40:01,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 155 transitions. [2019-01-01 21:40:01,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:01,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 143 states and 153 transitions. [2019-01-01 21:40:01,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:40:01,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:40:01,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 143 states and 153 transitions. [2019-01-01 21:40:01,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:40:01,734 INFO L705 BuchiCegarLoop]: Abstraction has 143 states and 153 transitions. [2019-01-01 21:40:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states and 153 transitions. [2019-01-01 21:40:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 138. [2019-01-01 21:40:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-01 21:40:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2019-01-01 21:40:01,745 INFO L728 BuchiCegarLoop]: Abstraction has 138 states and 148 transitions. [2019-01-01 21:40:01,745 INFO L608 BuchiCegarLoop]: Abstraction has 138 states and 148 transitions. [2019-01-01 21:40:01,745 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2019-01-01 21:40:01,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 148 transitions. [2019-01-01 21:40:01,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:01,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:40:01,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:40:01,747 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 1] [2019-01-01 21:40:01,747 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:40:01,747 INFO L794 eck$LassoCheckResult]: Stem: 6779#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 6780#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6818#L14 assume !(0 == main_~i~0); 6853#L14-2 assume !(main_~i~0 == main_~range~0); 6851#L17-1 assume !(1 == main_~up~0); 6848#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6849#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6907#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6906#L14 assume !(0 == main_~i~0); 6904#L14-2 assume !(main_~i~0 == main_~range~0); 6902#L17-1 assume !(1 == main_~up~0); 6900#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6898#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6897#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6896#L14 assume !(0 == main_~i~0); 6895#L14-2 assume !(main_~i~0 == main_~range~0); 6894#L17-1 assume !(1 == main_~up~0); 6893#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6892#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6891#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6890#L14 assume !(0 == main_~i~0); 6889#L14-2 assume !(main_~i~0 == main_~range~0); 6888#L17-1 assume !(1 == main_~up~0); 6887#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6886#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6885#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6884#L14 assume !(0 == main_~i~0); 6883#L14-2 assume !(main_~i~0 == main_~range~0); 6882#L17-1 assume !(1 == main_~up~0); 6881#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6880#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6879#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6878#L14 assume !(0 == main_~i~0); 6877#L14-2 assume !(main_~i~0 == main_~range~0); 6876#L17-1 assume !(1 == main_~up~0); 6875#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6874#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6873#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6872#L14 assume !(0 == main_~i~0); 6871#L14-2 assume !(main_~i~0 == main_~range~0); 6870#L17-1 assume !(1 == main_~up~0); 6869#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6868#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6867#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6866#L14 assume !(0 == main_~i~0); 6865#L14-2 assume !(main_~i~0 == main_~range~0); 6864#L17-1 assume !(1 == main_~up~0); 6863#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6862#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6861#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6860#L14 assume !(0 == main_~i~0); 6859#L14-2 assume !(main_~i~0 == main_~range~0); 6858#L17-1 assume !(1 == main_~up~0); 6857#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6856#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6826#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6854#L14 assume !(0 == main_~i~0); 6852#L14-2 assume !(main_~i~0 == main_~range~0); 6850#L17-1 assume !(1 == main_~up~0); 6830#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6825#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6822#L26-1 [2019-01-01 21:40:01,747 INFO L796 eck$LassoCheckResult]: Loop: 6822#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6823#L14 assume 0 == main_~i~0;main_~up~0 := 1; 6824#L14-2 assume !(main_~i~0 == main_~range~0); 6794#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6788#L20-1 assume !(0 == main_~up~0); 6789#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 6839#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6837#L14 assume !(0 == main_~i~0); 6835#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 6833#L17-1 assume !(1 == main_~up~0); 6831#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6827#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 6822#L26-1 [2019-01-01 21:40:01,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:01,758 INFO L82 PathProgramCache]: Analyzing trace with hash -333380470, now seen corresponding path program 7 times [2019-01-01 21:40:01,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:01,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:01,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:01,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:01,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:01,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:01,799 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 11 times [2019-01-01 21:40:01,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:01,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:01,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:01,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:40:01,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:01,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:01,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1202053228, now seen corresponding path program 7 times [2019-01-01 21:40:01,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:01,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:01,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:01,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:01,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:40:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 102 proven. 290 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:02,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:40:02,905 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-01 21:40:02,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:40:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:40:02,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:40:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 102 proven. 290 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:02,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:40:02,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-01 21:40:03,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 21:40:03,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-01-01 21:40:03,079 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. cyclomatic complexity: 14 Second operand 13 states. [2019-01-01 21:40:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:40:03,269 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2019-01-01 21:40:03,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 21:40:03,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 161 transitions. [2019-01-01 21:40:03,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:03,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 149 states and 159 transitions. [2019-01-01 21:40:03,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:40:03,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:40:03,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 159 transitions. [2019-01-01 21:40:03,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:40:03,275 INFO L705 BuchiCegarLoop]: Abstraction has 149 states and 159 transitions. [2019-01-01 21:40:03,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 159 transitions. [2019-01-01 21:40:03,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2019-01-01 21:40:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-01-01 21:40:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2019-01-01 21:40:03,280 INFO L728 BuchiCegarLoop]: Abstraction has 144 states and 154 transitions. [2019-01-01 21:40:03,280 INFO L608 BuchiCegarLoop]: Abstraction has 144 states and 154 transitions. [2019-01-01 21:40:03,280 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2019-01-01 21:40:03,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 144 states and 154 transitions. [2019-01-01 21:40:03,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:03,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:40:03,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:40:03,288 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 11, 11, 11, 11, 1] [2019-01-01 21:40:03,288 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:40:03,289 INFO L794 eck$LassoCheckResult]: Stem: 7308#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 7309#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7348#L14 assume !(0 == main_~i~0); 7447#L14-2 assume !(main_~i~0 == main_~range~0); 7446#L17-1 assume !(1 == main_~up~0); 7444#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7443#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7442#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7441#L14 assume !(0 == main_~i~0); 7439#L14-2 assume !(main_~i~0 == main_~range~0); 7437#L17-1 assume !(1 == main_~up~0); 7435#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7433#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7432#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7431#L14 assume !(0 == main_~i~0); 7430#L14-2 assume !(main_~i~0 == main_~range~0); 7429#L17-1 assume !(1 == main_~up~0); 7428#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7427#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7426#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7425#L14 assume !(0 == main_~i~0); 7424#L14-2 assume !(main_~i~0 == main_~range~0); 7423#L17-1 assume !(1 == main_~up~0); 7422#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7421#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7420#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7419#L14 assume !(0 == main_~i~0); 7418#L14-2 assume !(main_~i~0 == main_~range~0); 7417#L17-1 assume !(1 == main_~up~0); 7416#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7415#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7414#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7413#L14 assume !(0 == main_~i~0); 7412#L14-2 assume !(main_~i~0 == main_~range~0); 7411#L17-1 assume !(1 == main_~up~0); 7410#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7409#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7408#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7407#L14 assume !(0 == main_~i~0); 7406#L14-2 assume !(main_~i~0 == main_~range~0); 7405#L17-1 assume !(1 == main_~up~0); 7404#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7403#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7402#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7401#L14 assume !(0 == main_~i~0); 7400#L14-2 assume !(main_~i~0 == main_~range~0); 7399#L17-1 assume !(1 == main_~up~0); 7398#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7397#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7396#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7395#L14 assume !(0 == main_~i~0); 7394#L14-2 assume !(main_~i~0 == main_~range~0); 7393#L17-1 assume !(1 == main_~up~0); 7392#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7391#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7390#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7389#L14 assume !(0 == main_~i~0); 7388#L14-2 assume !(main_~i~0 == main_~range~0); 7387#L17-1 assume !(1 == main_~up~0); 7386#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7385#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7356#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7383#L14 assume !(0 == main_~i~0); 7381#L14-2 assume !(main_~i~0 == main_~range~0); 7379#L17-1 assume !(1 == main_~up~0); 7360#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7355#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7352#L26-1 [2019-01-01 21:40:03,289 INFO L796 eck$LassoCheckResult]: Loop: 7352#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7353#L14 assume 0 == main_~i~0;main_~up~0 := 1; 7354#L14-2 assume !(main_~i~0 == main_~range~0); 7324#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7317#L20-1 assume !(0 == main_~up~0); 7318#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 7369#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7367#L14 assume !(0 == main_~i~0); 7365#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 7363#L17-1 assume !(1 == main_~up~0); 7361#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7357#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 7352#L26-1 [2019-01-01 21:40:03,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:03,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1101545253, now seen corresponding path program 8 times [2019-01-01 21:40:03,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:03,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:03,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:03,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:40:03,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:03,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:03,320 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 12 times [2019-01-01 21:40:03,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:03,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:03,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:03,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:03,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:03,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:03,337 INFO L82 PathProgramCache]: Analyzing trace with hash 689417021, now seen corresponding path program 8 times [2019-01-01 21:40:03,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:03,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:03,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:03,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:03,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:40:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 112 proven. 352 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:03,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:40:03,775 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-01 21:40:03,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:40:03,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:40:03,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:40:03,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:40:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 112 proven. 352 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:03,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:40:03,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-01 21:40:03,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 21:40:03,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-01-01 21:40:03,940 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. cyclomatic complexity: 14 Second operand 14 states. [2019-01-01 21:40:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:40:04,144 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2019-01-01 21:40:04,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 21:40:04,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 167 transitions. [2019-01-01 21:40:04,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:04,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 155 states and 165 transitions. [2019-01-01 21:40:04,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:40:04,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:40:04,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 165 transitions. [2019-01-01 21:40:04,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:40:04,150 INFO L705 BuchiCegarLoop]: Abstraction has 155 states and 165 transitions. [2019-01-01 21:40:04,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 165 transitions. [2019-01-01 21:40:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2019-01-01 21:40:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-01 21:40:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2019-01-01 21:40:04,158 INFO L728 BuchiCegarLoop]: Abstraction has 150 states and 160 transitions. [2019-01-01 21:40:04,158 INFO L608 BuchiCegarLoop]: Abstraction has 150 states and 160 transitions. [2019-01-01 21:40:04,158 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2019-01-01 21:40:04,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 160 transitions. [2019-01-01 21:40:04,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:04,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:40:04,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:40:04,160 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [12, 12, 12, 12, 12, 12, 1] [2019-01-01 21:40:04,160 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:40:04,161 INFO L794 eck$LassoCheckResult]: Stem: 7864#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 7865#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7908#L14 assume !(0 == main_~i~0); 8013#L14-2 assume !(main_~i~0 == main_~range~0); 8012#L17-1 assume !(1 == main_~up~0); 8010#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8009#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8008#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8007#L14 assume !(0 == main_~i~0); 8005#L14-2 assume !(main_~i~0 == main_~range~0); 8003#L17-1 assume !(1 == main_~up~0); 8001#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7999#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7998#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7997#L14 assume !(0 == main_~i~0); 7996#L14-2 assume !(main_~i~0 == main_~range~0); 7995#L17-1 assume !(1 == main_~up~0); 7994#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7993#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7992#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7991#L14 assume !(0 == main_~i~0); 7990#L14-2 assume !(main_~i~0 == main_~range~0); 7989#L17-1 assume !(1 == main_~up~0); 7988#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7987#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7986#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7985#L14 assume !(0 == main_~i~0); 7984#L14-2 assume !(main_~i~0 == main_~range~0); 7983#L17-1 assume !(1 == main_~up~0); 7982#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7981#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7980#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7979#L14 assume !(0 == main_~i~0); 7978#L14-2 assume !(main_~i~0 == main_~range~0); 7977#L17-1 assume !(1 == main_~up~0); 7976#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7975#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7974#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7973#L14 assume !(0 == main_~i~0); 7972#L14-2 assume !(main_~i~0 == main_~range~0); 7971#L17-1 assume !(1 == main_~up~0); 7970#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7969#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7968#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7967#L14 assume !(0 == main_~i~0); 7966#L14-2 assume !(main_~i~0 == main_~range~0); 7965#L17-1 assume !(1 == main_~up~0); 7964#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7963#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7962#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7961#L14 assume !(0 == main_~i~0); 7960#L14-2 assume !(main_~i~0 == main_~range~0); 7959#L17-1 assume !(1 == main_~up~0); 7958#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7957#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7956#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7955#L14 assume !(0 == main_~i~0); 7954#L14-2 assume !(main_~i~0 == main_~range~0); 7953#L17-1 assume !(1 == main_~up~0); 7952#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7951#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7950#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7949#L14 assume !(0 == main_~i~0); 7948#L14-2 assume !(main_~i~0 == main_~range~0); 7947#L17-1 assume !(1 == main_~up~0); 7946#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7945#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7916#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7943#L14 assume !(0 == main_~i~0); 7941#L14-2 assume !(main_~i~0 == main_~range~0); 7939#L17-1 assume !(1 == main_~up~0); 7920#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7915#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7912#L26-1 [2019-01-01 21:40:04,166 INFO L796 eck$LassoCheckResult]: Loop: 7912#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7913#L14 assume 0 == main_~i~0;main_~up~0 := 1; 7914#L14-2 assume !(main_~i~0 == main_~range~0); 7884#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7877#L20-1 assume !(0 == main_~up~0); 7878#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 7929#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7927#L14 assume !(0 == main_~i~0); 7925#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 7923#L17-1 assume !(1 == main_~up~0); 7921#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7917#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 7912#L26-1 [2019-01-01 21:40:04,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:04,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1617575020, now seen corresponding path program 9 times [2019-01-01 21:40:04,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:04,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:04,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:04,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:04,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:04,199 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 13 times [2019-01-01 21:40:04,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:04,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:04,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:04,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:04,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:04,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:04,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1283478862, now seen corresponding path program 9 times [2019-01-01 21:40:04,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:04,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:04,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:04,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:40:04,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:40:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 122 proven. 420 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:04,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:40:04,580 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-01 21:40:04,592 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:40:04,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-01 21:40:04,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:40:04,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:40:04,646 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 122 proven. 420 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:04,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:40:04,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-01 21:40:04,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 21:40:04,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-01-01 21:40:04,726 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. cyclomatic complexity: 14 Second operand 15 states. [2019-01-01 21:40:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:40:04,915 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2019-01-01 21:40:04,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 21:40:04,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 173 transitions. [2019-01-01 21:40:04,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:04,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 161 states and 171 transitions. [2019-01-01 21:40:04,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:40:04,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:40:04,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 171 transitions. [2019-01-01 21:40:04,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:40:04,920 INFO L705 BuchiCegarLoop]: Abstraction has 161 states and 171 transitions. [2019-01-01 21:40:04,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 171 transitions. [2019-01-01 21:40:04,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2019-01-01 21:40:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-01 21:40:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2019-01-01 21:40:04,924 INFO L728 BuchiCegarLoop]: Abstraction has 156 states and 166 transitions. [2019-01-01 21:40:04,924 INFO L608 BuchiCegarLoop]: Abstraction has 156 states and 166 transitions. [2019-01-01 21:40:04,924 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2019-01-01 21:40:04,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 166 transitions. [2019-01-01 21:40:04,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:04,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:40:04,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:40:04,928 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 13, 13, 13, 13, 13, 1] [2019-01-01 21:40:04,928 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:40:04,928 INFO L794 eck$LassoCheckResult]: Stem: 8459#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 8460#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8498#L14 assume !(0 == main_~i~0); 8533#L14-2 assume !(main_~i~0 == main_~range~0); 8531#L17-1 assume !(1 == main_~up~0); 8528#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8529#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8605#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8604#L14 assume !(0 == main_~i~0); 8602#L14-2 assume !(main_~i~0 == main_~range~0); 8600#L17-1 assume !(1 == main_~up~0); 8598#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8596#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8595#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8594#L14 assume !(0 == main_~i~0); 8593#L14-2 assume !(main_~i~0 == main_~range~0); 8592#L17-1 assume !(1 == main_~up~0); 8591#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8590#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8589#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8588#L14 assume !(0 == main_~i~0); 8587#L14-2 assume !(main_~i~0 == main_~range~0); 8586#L17-1 assume !(1 == main_~up~0); 8585#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8584#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8583#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8582#L14 assume !(0 == main_~i~0); 8581#L14-2 assume !(main_~i~0 == main_~range~0); 8580#L17-1 assume !(1 == main_~up~0); 8579#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8578#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8577#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8576#L14 assume !(0 == main_~i~0); 8575#L14-2 assume !(main_~i~0 == main_~range~0); 8574#L17-1 assume !(1 == main_~up~0); 8573#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8572#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8571#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8570#L14 assume !(0 == main_~i~0); 8569#L14-2 assume !(main_~i~0 == main_~range~0); 8568#L17-1 assume !(1 == main_~up~0); 8567#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8566#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8565#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8564#L14 assume !(0 == main_~i~0); 8563#L14-2 assume !(main_~i~0 == main_~range~0); 8562#L17-1 assume !(1 == main_~up~0); 8561#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8560#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8559#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8558#L14 assume !(0 == main_~i~0); 8557#L14-2 assume !(main_~i~0 == main_~range~0); 8556#L17-1 assume !(1 == main_~up~0); 8555#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8554#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8553#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8552#L14 assume !(0 == main_~i~0); 8551#L14-2 assume !(main_~i~0 == main_~range~0); 8550#L17-1 assume !(1 == main_~up~0); 8549#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8548#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8547#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8546#L14 assume !(0 == main_~i~0); 8545#L14-2 assume !(main_~i~0 == main_~range~0); 8544#L17-1 assume !(1 == main_~up~0); 8543#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8542#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8541#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8540#L14 assume !(0 == main_~i~0); 8539#L14-2 assume !(main_~i~0 == main_~range~0); 8538#L17-1 assume !(1 == main_~up~0); 8537#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8536#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8506#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8534#L14 assume !(0 == main_~i~0); 8532#L14-2 assume !(main_~i~0 == main_~range~0); 8530#L17-1 assume !(1 == main_~up~0); 8510#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8505#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8502#L26-1 [2019-01-01 21:40:04,928 INFO L796 eck$LassoCheckResult]: Loop: 8502#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8503#L14 assume 0 == main_~i~0;main_~up~0 := 1; 8504#L14-2 assume !(main_~i~0 == main_~range~0); 8474#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8468#L20-1 assume !(0 == main_~up~0); 8469#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 8519#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8517#L14 assume !(0 == main_~i~0); 8515#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 8513#L17-1 assume !(1 == main_~up~0); 8511#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8507#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 8502#L26-1 [2019-01-01 21:40:04,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:04,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1104938813, now seen corresponding path program 10 times [2019-01-01 21:40:04,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:04,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:04,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:04,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:04,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:04,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:04,958 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 14 times [2019-01-01 21:40:04,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:04,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:04,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:04,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:04,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:04,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:04,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1467257185, now seen corresponding path program 10 times [2019-01-01 21:40:04,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:04,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:04,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:04,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:04,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:40:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 132 proven. 494 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:05,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:40:05,208 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-01 21:40:05,220 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 21:40:05,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 21:40:05,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:40:05,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:40:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 132 proven. 494 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:05,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:40:05,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-01 21:40:05,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 21:40:05,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-01-01 21:40:05,375 INFO L87 Difference]: Start difference. First operand 156 states and 166 transitions. cyclomatic complexity: 14 Second operand 16 states. [2019-01-01 21:40:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:40:05,581 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2019-01-01 21:40:05,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 21:40:05,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 179 transitions. [2019-01-01 21:40:05,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:05,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 167 states and 177 transitions. [2019-01-01 21:40:05,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:40:05,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:40:05,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 177 transitions. [2019-01-01 21:40:05,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:40:05,587 INFO L705 BuchiCegarLoop]: Abstraction has 167 states and 177 transitions. [2019-01-01 21:40:05,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 177 transitions. [2019-01-01 21:40:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 162. [2019-01-01 21:40:05,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-01 21:40:05,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2019-01-01 21:40:05,595 INFO L728 BuchiCegarLoop]: Abstraction has 162 states and 172 transitions. [2019-01-01 21:40:05,595 INFO L608 BuchiCegarLoop]: Abstraction has 162 states and 172 transitions. [2019-01-01 21:40:05,595 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2019-01-01 21:40:05,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 172 transitions. [2019-01-01 21:40:05,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:05,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:40:05,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:40:05,597 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [14, 14, 14, 14, 14, 14, 1] [2019-01-01 21:40:05,597 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:40:05,597 INFO L794 eck$LassoCheckResult]: Stem: 9081#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 9082#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9121#L14 assume !(0 == main_~i~0); 9238#L14-2 assume !(main_~i~0 == main_~range~0); 9237#L17-1 assume !(1 == main_~up~0); 9235#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9234#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9233#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9232#L14 assume !(0 == main_~i~0); 9230#L14-2 assume !(main_~i~0 == main_~range~0); 9228#L17-1 assume !(1 == main_~up~0); 9226#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9224#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9223#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9222#L14 assume !(0 == main_~i~0); 9221#L14-2 assume !(main_~i~0 == main_~range~0); 9220#L17-1 assume !(1 == main_~up~0); 9219#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9218#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9217#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9216#L14 assume !(0 == main_~i~0); 9215#L14-2 assume !(main_~i~0 == main_~range~0); 9214#L17-1 assume !(1 == main_~up~0); 9213#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9212#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9211#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9210#L14 assume !(0 == main_~i~0); 9209#L14-2 assume !(main_~i~0 == main_~range~0); 9208#L17-1 assume !(1 == main_~up~0); 9207#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9206#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9205#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9204#L14 assume !(0 == main_~i~0); 9203#L14-2 assume !(main_~i~0 == main_~range~0); 9202#L17-1 assume !(1 == main_~up~0); 9201#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9200#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9199#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9198#L14 assume !(0 == main_~i~0); 9197#L14-2 assume !(main_~i~0 == main_~range~0); 9196#L17-1 assume !(1 == main_~up~0); 9195#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9194#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9193#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9192#L14 assume !(0 == main_~i~0); 9191#L14-2 assume !(main_~i~0 == main_~range~0); 9190#L17-1 assume !(1 == main_~up~0); 9189#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9188#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9187#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9186#L14 assume !(0 == main_~i~0); 9185#L14-2 assume !(main_~i~0 == main_~range~0); 9184#L17-1 assume !(1 == main_~up~0); 9183#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9182#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9181#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9180#L14 assume !(0 == main_~i~0); 9179#L14-2 assume !(main_~i~0 == main_~range~0); 9178#L17-1 assume !(1 == main_~up~0); 9177#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9176#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9175#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9174#L14 assume !(0 == main_~i~0); 9173#L14-2 assume !(main_~i~0 == main_~range~0); 9172#L17-1 assume !(1 == main_~up~0); 9171#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9170#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9169#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9168#L14 assume !(0 == main_~i~0); 9167#L14-2 assume !(main_~i~0 == main_~range~0); 9166#L17-1 assume !(1 == main_~up~0); 9165#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9164#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9163#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9162#L14 assume !(0 == main_~i~0); 9161#L14-2 assume !(main_~i~0 == main_~range~0); 9160#L17-1 assume !(1 == main_~up~0); 9159#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9158#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9129#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9156#L14 assume !(0 == main_~i~0); 9154#L14-2 assume !(main_~i~0 == main_~range~0); 9152#L17-1 assume !(1 == main_~up~0); 9133#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9128#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9125#L26-1 [2019-01-01 21:40:05,597 INFO L796 eck$LassoCheckResult]: Loop: 9125#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9126#L14 assume 0 == main_~i~0;main_~up~0 := 1; 9127#L14-2 assume !(main_~i~0 == main_~range~0); 9097#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9090#L20-1 assume !(0 == main_~up~0); 9091#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 9142#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9140#L14 assume !(0 == main_~i~0); 9138#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 9136#L17-1 assume !(1 == main_~up~0); 9134#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9130#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 9125#L26-1 [2019-01-01 21:40:05,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:05,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1699000654, now seen corresponding path program 11 times [2019-01-01 21:40:05,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:05,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:05,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:05,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:05,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:05,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:05,640 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 15 times [2019-01-01 21:40:05,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:05,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:05,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:05,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:05,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:05,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:05,651 INFO L82 PathProgramCache]: Analyzing trace with hash -923236560, now seen corresponding path program 11 times [2019-01-01 21:40:05,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:05,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:05,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:05,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:05,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:40:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 142 proven. 574 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:06,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:40:06,007 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-01 21:40:06,018 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 21:40:06,051 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-01-01 21:40:06,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:40:06,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:40:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 142 proven. 574 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:06,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:40:06,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 21 [2019-01-01 21:40:06,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 21:40:06,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2019-01-01 21:40:06,264 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. cyclomatic complexity: 14 Second operand 22 states. [2019-01-01 21:40:06,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:40:06,702 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2019-01-01 21:40:06,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-01 21:40:06,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 185 transitions. [2019-01-01 21:40:06,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:06,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 173 states and 183 transitions. [2019-01-01 21:40:06,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:40:06,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:40:06,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 183 transitions. [2019-01-01 21:40:06,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:40:06,707 INFO L705 BuchiCegarLoop]: Abstraction has 173 states and 183 transitions. [2019-01-01 21:40:06,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 183 transitions. [2019-01-01 21:40:06,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 168. [2019-01-01 21:40:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-01 21:40:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2019-01-01 21:40:06,710 INFO L728 BuchiCegarLoop]: Abstraction has 168 states and 178 transitions. [2019-01-01 21:40:06,710 INFO L608 BuchiCegarLoop]: Abstraction has 168 states and 178 transitions. [2019-01-01 21:40:06,710 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2019-01-01 21:40:06,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 178 transitions. [2019-01-01 21:40:06,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:06,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:40:06,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:40:06,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [15, 15, 15, 15, 15, 15, 1] [2019-01-01 21:40:06,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:40:06,713 INFO L794 eck$LassoCheckResult]: Stem: 9763#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 9764#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9803#L14 assume !(0 == main_~i~0); 9926#L14-2 assume !(main_~i~0 == main_~range~0); 9925#L17-1 assume !(1 == main_~up~0); 9923#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9922#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9921#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9920#L14 assume !(0 == main_~i~0); 9918#L14-2 assume !(main_~i~0 == main_~range~0); 9916#L17-1 assume !(1 == main_~up~0); 9914#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9912#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9911#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9910#L14 assume !(0 == main_~i~0); 9909#L14-2 assume !(main_~i~0 == main_~range~0); 9908#L17-1 assume !(1 == main_~up~0); 9907#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9906#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9905#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9904#L14 assume !(0 == main_~i~0); 9903#L14-2 assume !(main_~i~0 == main_~range~0); 9902#L17-1 assume !(1 == main_~up~0); 9901#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9900#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9899#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9898#L14 assume !(0 == main_~i~0); 9897#L14-2 assume !(main_~i~0 == main_~range~0); 9896#L17-1 assume !(1 == main_~up~0); 9895#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9894#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9893#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9892#L14 assume !(0 == main_~i~0); 9891#L14-2 assume !(main_~i~0 == main_~range~0); 9890#L17-1 assume !(1 == main_~up~0); 9889#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9888#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9887#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9886#L14 assume !(0 == main_~i~0); 9885#L14-2 assume !(main_~i~0 == main_~range~0); 9884#L17-1 assume !(1 == main_~up~0); 9883#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9882#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9881#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9880#L14 assume !(0 == main_~i~0); 9879#L14-2 assume !(main_~i~0 == main_~range~0); 9878#L17-1 assume !(1 == main_~up~0); 9877#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9876#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9875#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9874#L14 assume !(0 == main_~i~0); 9873#L14-2 assume !(main_~i~0 == main_~range~0); 9872#L17-1 assume !(1 == main_~up~0); 9871#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9870#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9869#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9868#L14 assume !(0 == main_~i~0); 9867#L14-2 assume !(main_~i~0 == main_~range~0); 9866#L17-1 assume !(1 == main_~up~0); 9865#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9864#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9863#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9862#L14 assume !(0 == main_~i~0); 9861#L14-2 assume !(main_~i~0 == main_~range~0); 9860#L17-1 assume !(1 == main_~up~0); 9859#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9858#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9857#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9856#L14 assume !(0 == main_~i~0); 9855#L14-2 assume !(main_~i~0 == main_~range~0); 9854#L17-1 assume !(1 == main_~up~0); 9853#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9852#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9851#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9850#L14 assume !(0 == main_~i~0); 9849#L14-2 assume !(main_~i~0 == main_~range~0); 9848#L17-1 assume !(1 == main_~up~0); 9847#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9846#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9845#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9844#L14 assume !(0 == main_~i~0); 9843#L14-2 assume !(main_~i~0 == main_~range~0); 9842#L17-1 assume !(1 == main_~up~0); 9841#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9840#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9811#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9838#L14 assume !(0 == main_~i~0); 9836#L14-2 assume !(main_~i~0 == main_~range~0); 9834#L17-1 assume !(1 == main_~up~0); 9815#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9810#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9807#L26-1 [2019-01-01 21:40:06,713 INFO L796 eck$LassoCheckResult]: Loop: 9807#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9808#L14 assume 0 == main_~i~0;main_~up~0 := 1; 9809#L14-2 assume !(main_~i~0 == main_~range~0); 9779#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9772#L20-1 assume !(0 == main_~up~0); 9773#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 9824#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9822#L14 assume !(0 == main_~i~0); 9820#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 9818#L17-1 assume !(1 == main_~up~0); 9816#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9812#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 9807#L26-1 [2019-01-01 21:40:06,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:06,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1051735393, now seen corresponding path program 12 times [2019-01-01 21:40:06,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:06,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:06,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:06,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:06,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:06,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:06,735 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 16 times [2019-01-01 21:40:06,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:06,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:06,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:06,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:06,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:06,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:06,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1348784383, now seen corresponding path program 12 times [2019-01-01 21:40:06,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:06,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:06,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:06,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:06,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:40:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 152 proven. 660 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:07,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:40:07,143 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-01 21:40:07,166 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 21:40:07,325 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-01-01 21:40:07,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:40:07,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:40:07,411 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 152 proven. 660 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:07,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:40:07,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 22 [2019-01-01 21:40:07,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-01 21:40:07,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-01-01 21:40:07,505 INFO L87 Difference]: Start difference. First operand 168 states and 178 transitions. cyclomatic complexity: 14 Second operand 23 states. [2019-01-01 21:40:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:40:07,981 INFO L93 Difference]: Finished difference Result 181 states and 191 transitions. [2019-01-01 21:40:07,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-01 21:40:07,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 191 transitions. [2019-01-01 21:40:07,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:07,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 179 states and 189 transitions. [2019-01-01 21:40:07,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:40:07,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:40:07,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 189 transitions. [2019-01-01 21:40:07,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:40:07,986 INFO L705 BuchiCegarLoop]: Abstraction has 179 states and 189 transitions. [2019-01-01 21:40:07,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 189 transitions. [2019-01-01 21:40:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 174. [2019-01-01 21:40:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-01-01 21:40:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 184 transitions. [2019-01-01 21:40:07,990 INFO L728 BuchiCegarLoop]: Abstraction has 174 states and 184 transitions. [2019-01-01 21:40:07,990 INFO L608 BuchiCegarLoop]: Abstraction has 174 states and 184 transitions. [2019-01-01 21:40:07,990 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2019-01-01 21:40:07,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 184 transitions. [2019-01-01 21:40:07,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:07,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:40:07,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:40:08,000 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [16, 16, 16, 16, 16, 16, 1] [2019-01-01 21:40:08,000 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:40:08,000 INFO L794 eck$LassoCheckResult]: Stem: 10472#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 10473#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10516#L14 assume !(0 == main_~i~0); 10645#L14-2 assume !(main_~i~0 == main_~range~0); 10644#L17-1 assume !(1 == main_~up~0); 10642#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10641#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10640#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10639#L14 assume !(0 == main_~i~0); 10637#L14-2 assume !(main_~i~0 == main_~range~0); 10635#L17-1 assume !(1 == main_~up~0); 10633#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10631#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10630#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10629#L14 assume !(0 == main_~i~0); 10628#L14-2 assume !(main_~i~0 == main_~range~0); 10627#L17-1 assume !(1 == main_~up~0); 10626#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10625#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10624#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10623#L14 assume !(0 == main_~i~0); 10622#L14-2 assume !(main_~i~0 == main_~range~0); 10621#L17-1 assume !(1 == main_~up~0); 10620#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10619#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10618#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10617#L14 assume !(0 == main_~i~0); 10616#L14-2 assume !(main_~i~0 == main_~range~0); 10615#L17-1 assume !(1 == main_~up~0); 10614#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10613#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10612#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10611#L14 assume !(0 == main_~i~0); 10610#L14-2 assume !(main_~i~0 == main_~range~0); 10609#L17-1 assume !(1 == main_~up~0); 10608#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10607#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10606#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10605#L14 assume !(0 == main_~i~0); 10604#L14-2 assume !(main_~i~0 == main_~range~0); 10603#L17-1 assume !(1 == main_~up~0); 10602#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10601#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10600#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10599#L14 assume !(0 == main_~i~0); 10598#L14-2 assume !(main_~i~0 == main_~range~0); 10597#L17-1 assume !(1 == main_~up~0); 10596#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10595#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10594#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10593#L14 assume !(0 == main_~i~0); 10592#L14-2 assume !(main_~i~0 == main_~range~0); 10591#L17-1 assume !(1 == main_~up~0); 10590#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10589#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10588#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10587#L14 assume !(0 == main_~i~0); 10586#L14-2 assume !(main_~i~0 == main_~range~0); 10585#L17-1 assume !(1 == main_~up~0); 10584#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10583#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10582#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10581#L14 assume !(0 == main_~i~0); 10580#L14-2 assume !(main_~i~0 == main_~range~0); 10579#L17-1 assume !(1 == main_~up~0); 10578#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10577#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10576#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10575#L14 assume !(0 == main_~i~0); 10574#L14-2 assume !(main_~i~0 == main_~range~0); 10573#L17-1 assume !(1 == main_~up~0); 10572#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10571#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10570#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10569#L14 assume !(0 == main_~i~0); 10568#L14-2 assume !(main_~i~0 == main_~range~0); 10567#L17-1 assume !(1 == main_~up~0); 10566#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10565#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10564#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10563#L14 assume !(0 == main_~i~0); 10562#L14-2 assume !(main_~i~0 == main_~range~0); 10561#L17-1 assume !(1 == main_~up~0); 10560#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10559#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10558#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10557#L14 assume !(0 == main_~i~0); 10556#L14-2 assume !(main_~i~0 == main_~range~0); 10555#L17-1 assume !(1 == main_~up~0); 10554#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10553#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10524#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10551#L14 assume !(0 == main_~i~0); 10549#L14-2 assume !(main_~i~0 == main_~range~0); 10547#L17-1 assume !(1 == main_~up~0); 10528#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10523#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10520#L26-1 [2019-01-01 21:40:08,001 INFO L796 eck$LassoCheckResult]: Loop: 10520#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10521#L14 assume 0 == main_~i~0;main_~up~0 := 1; 10522#L14-2 assume !(main_~i~0 == main_~range~0); 10492#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10485#L20-1 assume !(0 == main_~up~0); 10486#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 10537#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10535#L14 assume !(0 == main_~i~0); 10533#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 10531#L17-1 assume !(1 == main_~up~0); 10529#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10525#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 10520#L26-1 [2019-01-01 21:40:08,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:08,001 INFO L82 PathProgramCache]: Analyzing trace with hash -507714768, now seen corresponding path program 13 times [2019-01-01 21:40:08,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:08,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:08,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:08,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:08,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:08,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:08,038 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 17 times [2019-01-01 21:40:08,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:08,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:08,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:08,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:40:08,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:08,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:08,051 INFO L82 PathProgramCache]: Analyzing trace with hash -178588142, now seen corresponding path program 13 times [2019-01-01 21:40:08,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:08,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:08,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:08,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:08,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:40:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 162 proven. 752 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:08,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:40:08,814 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-01 21:40:08,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:40:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:40:08,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:40:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 162 proven. 752 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:08,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:40:08,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-01-01 21:40:08,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-01 21:40:08,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-01-01 21:40:08,977 INFO L87 Difference]: Start difference. First operand 174 states and 184 transitions. cyclomatic complexity: 14 Second operand 19 states. [2019-01-01 21:40:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:40:09,228 INFO L93 Difference]: Finished difference Result 187 states and 197 transitions. [2019-01-01 21:40:09,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-01 21:40:09,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 197 transitions. [2019-01-01 21:40:09,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:09,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 185 states and 195 transitions. [2019-01-01 21:40:09,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:40:09,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:40:09,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 185 states and 195 transitions. [2019-01-01 21:40:09,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:40:09,235 INFO L705 BuchiCegarLoop]: Abstraction has 185 states and 195 transitions. [2019-01-01 21:40:09,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states and 195 transitions. [2019-01-01 21:40:09,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 180. [2019-01-01 21:40:09,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-01 21:40:09,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 190 transitions. [2019-01-01 21:40:09,238 INFO L728 BuchiCegarLoop]: Abstraction has 180 states and 190 transitions. [2019-01-01 21:40:09,238 INFO L608 BuchiCegarLoop]: Abstraction has 180 states and 190 transitions. [2019-01-01 21:40:09,238 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2019-01-01 21:40:09,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 180 states and 190 transitions. [2019-01-01 21:40:09,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:09,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:40:09,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:40:09,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [17, 17, 17, 17, 17, 17, 1] [2019-01-01 21:40:09,240 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:40:09,241 INFO L794 eck$LassoCheckResult]: Stem: 11191#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 11192#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11231#L14 assume !(0 == main_~i~0); 11366#L14-2 assume !(main_~i~0 == main_~range~0); 11365#L17-1 assume !(1 == main_~up~0); 11363#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11362#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11361#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11360#L14 assume !(0 == main_~i~0); 11358#L14-2 assume !(main_~i~0 == main_~range~0); 11356#L17-1 assume !(1 == main_~up~0); 11354#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11352#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11351#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11350#L14 assume !(0 == main_~i~0); 11349#L14-2 assume !(main_~i~0 == main_~range~0); 11348#L17-1 assume !(1 == main_~up~0); 11347#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11346#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11345#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11344#L14 assume !(0 == main_~i~0); 11343#L14-2 assume !(main_~i~0 == main_~range~0); 11342#L17-1 assume !(1 == main_~up~0); 11341#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11340#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11339#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11338#L14 assume !(0 == main_~i~0); 11337#L14-2 assume !(main_~i~0 == main_~range~0); 11336#L17-1 assume !(1 == main_~up~0); 11335#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11334#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11333#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11332#L14 assume !(0 == main_~i~0); 11331#L14-2 assume !(main_~i~0 == main_~range~0); 11330#L17-1 assume !(1 == main_~up~0); 11329#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11328#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11327#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11326#L14 assume !(0 == main_~i~0); 11325#L14-2 assume !(main_~i~0 == main_~range~0); 11324#L17-1 assume !(1 == main_~up~0); 11323#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11322#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11321#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11320#L14 assume !(0 == main_~i~0); 11319#L14-2 assume !(main_~i~0 == main_~range~0); 11318#L17-1 assume !(1 == main_~up~0); 11317#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11316#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11315#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11314#L14 assume !(0 == main_~i~0); 11313#L14-2 assume !(main_~i~0 == main_~range~0); 11312#L17-1 assume !(1 == main_~up~0); 11311#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11310#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11309#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11308#L14 assume !(0 == main_~i~0); 11307#L14-2 assume !(main_~i~0 == main_~range~0); 11306#L17-1 assume !(1 == main_~up~0); 11305#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11304#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11303#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11302#L14 assume !(0 == main_~i~0); 11301#L14-2 assume !(main_~i~0 == main_~range~0); 11300#L17-1 assume !(1 == main_~up~0); 11299#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11298#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11297#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11296#L14 assume !(0 == main_~i~0); 11295#L14-2 assume !(main_~i~0 == main_~range~0); 11294#L17-1 assume !(1 == main_~up~0); 11293#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11292#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11291#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11290#L14 assume !(0 == main_~i~0); 11289#L14-2 assume !(main_~i~0 == main_~range~0); 11288#L17-1 assume !(1 == main_~up~0); 11287#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11286#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11285#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11284#L14 assume !(0 == main_~i~0); 11283#L14-2 assume !(main_~i~0 == main_~range~0); 11282#L17-1 assume !(1 == main_~up~0); 11281#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11280#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11279#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11278#L14 assume !(0 == main_~i~0); 11277#L14-2 assume !(main_~i~0 == main_~range~0); 11276#L17-1 assume !(1 == main_~up~0); 11275#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11274#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11273#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11272#L14 assume !(0 == main_~i~0); 11271#L14-2 assume !(main_~i~0 == main_~range~0); 11270#L17-1 assume !(1 == main_~up~0); 11269#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11268#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11239#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11266#L14 assume !(0 == main_~i~0); 11264#L14-2 assume !(main_~i~0 == main_~range~0); 11262#L17-1 assume !(1 == main_~up~0); 11243#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11238#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11235#L26-1 [2019-01-01 21:40:09,241 INFO L796 eck$LassoCheckResult]: Loop: 11235#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11236#L14 assume 0 == main_~i~0;main_~up~0 := 1; 11237#L14-2 assume !(main_~i~0 == main_~range~0); 11207#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11200#L20-1 assume !(0 == main_~up~0); 11201#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 11252#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11250#L14 assume !(0 == main_~i~0); 11248#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 11246#L17-1 assume !(1 == main_~up~0); 11244#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11240#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 11235#L26-1 [2019-01-01 21:40:09,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:09,241 INFO L82 PathProgramCache]: Analyzing trace with hash -933262591, now seen corresponding path program 14 times [2019-01-01 21:40:09,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:09,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:09,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:09,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:40:09,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:09,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:09,263 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 18 times [2019-01-01 21:40:09,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:09,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:09,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:09,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:09,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:09,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:09,268 INFO L82 PathProgramCache]: Analyzing trace with hash 724790371, now seen corresponding path program 14 times [2019-01-01 21:40:09,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:09,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:09,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:09,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:09,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:40:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 172 proven. 850 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:09,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:40:09,582 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-01 21:40:09,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:40:09,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:40:09,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:40:09,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:40:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 172 proven. 850 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:09,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:40:09,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-01-01 21:40:09,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 21:40:09,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2019-01-01 21:40:09,746 INFO L87 Difference]: Start difference. First operand 180 states and 190 transitions. cyclomatic complexity: 14 Second operand 20 states. [2019-01-01 21:40:10,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:40:10,032 INFO L93 Difference]: Finished difference Result 193 states and 203 transitions. [2019-01-01 21:40:10,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-01 21:40:10,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 203 transitions. [2019-01-01 21:40:10,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:10,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 191 states and 201 transitions. [2019-01-01 21:40:10,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:40:10,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:40:10,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 191 states and 201 transitions. [2019-01-01 21:40:10,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:40:10,039 INFO L705 BuchiCegarLoop]: Abstraction has 191 states and 201 transitions. [2019-01-01 21:40:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states and 201 transitions. [2019-01-01 21:40:10,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 186. [2019-01-01 21:40:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-01 21:40:10,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 196 transitions. [2019-01-01 21:40:10,049 INFO L728 BuchiCegarLoop]: Abstraction has 186 states and 196 transitions. [2019-01-01 21:40:10,049 INFO L608 BuchiCegarLoop]: Abstraction has 186 states and 196 transitions. [2019-01-01 21:40:10,049 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2019-01-01 21:40:10,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 196 transitions. [2019-01-01 21:40:10,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:10,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:40:10,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:40:10,053 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [18, 18, 18, 18, 18, 18, 1] [2019-01-01 21:40:10,057 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:40:10,057 INFO L794 eck$LassoCheckResult]: Stem: 11937#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 11938#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11977#L14 assume !(0 == main_~i~0); 12118#L14-2 assume !(main_~i~0 == main_~range~0); 12117#L17-1 assume !(1 == main_~up~0); 12115#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12114#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12113#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12112#L14 assume !(0 == main_~i~0); 12110#L14-2 assume !(main_~i~0 == main_~range~0); 12108#L17-1 assume !(1 == main_~up~0); 12106#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12104#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12103#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12102#L14 assume !(0 == main_~i~0); 12101#L14-2 assume !(main_~i~0 == main_~range~0); 12100#L17-1 assume !(1 == main_~up~0); 12099#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12098#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12097#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12096#L14 assume !(0 == main_~i~0); 12095#L14-2 assume !(main_~i~0 == main_~range~0); 12094#L17-1 assume !(1 == main_~up~0); 12093#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12092#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12091#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12090#L14 assume !(0 == main_~i~0); 12089#L14-2 assume !(main_~i~0 == main_~range~0); 12088#L17-1 assume !(1 == main_~up~0); 12087#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12086#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12085#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12084#L14 assume !(0 == main_~i~0); 12083#L14-2 assume !(main_~i~0 == main_~range~0); 12082#L17-1 assume !(1 == main_~up~0); 12081#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12080#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12079#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12078#L14 assume !(0 == main_~i~0); 12077#L14-2 assume !(main_~i~0 == main_~range~0); 12076#L17-1 assume !(1 == main_~up~0); 12075#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12074#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12073#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12072#L14 assume !(0 == main_~i~0); 12071#L14-2 assume !(main_~i~0 == main_~range~0); 12070#L17-1 assume !(1 == main_~up~0); 12069#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12068#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12067#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12066#L14 assume !(0 == main_~i~0); 12065#L14-2 assume !(main_~i~0 == main_~range~0); 12064#L17-1 assume !(1 == main_~up~0); 12063#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12062#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12061#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12060#L14 assume !(0 == main_~i~0); 12059#L14-2 assume !(main_~i~0 == main_~range~0); 12058#L17-1 assume !(1 == main_~up~0); 12057#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12056#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12055#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12054#L14 assume !(0 == main_~i~0); 12053#L14-2 assume !(main_~i~0 == main_~range~0); 12052#L17-1 assume !(1 == main_~up~0); 12051#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12050#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12049#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12048#L14 assume !(0 == main_~i~0); 12047#L14-2 assume !(main_~i~0 == main_~range~0); 12046#L17-1 assume !(1 == main_~up~0); 12045#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12044#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12043#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12042#L14 assume !(0 == main_~i~0); 12041#L14-2 assume !(main_~i~0 == main_~range~0); 12040#L17-1 assume !(1 == main_~up~0); 12039#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12038#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12037#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12036#L14 assume !(0 == main_~i~0); 12035#L14-2 assume !(main_~i~0 == main_~range~0); 12034#L17-1 assume !(1 == main_~up~0); 12033#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12032#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12031#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12030#L14 assume !(0 == main_~i~0); 12029#L14-2 assume !(main_~i~0 == main_~range~0); 12028#L17-1 assume !(1 == main_~up~0); 12027#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12026#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12025#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12024#L14 assume !(0 == main_~i~0); 12023#L14-2 assume !(main_~i~0 == main_~range~0); 12022#L17-1 assume !(1 == main_~up~0); 12021#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12020#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12019#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12018#L14 assume !(0 == main_~i~0); 12017#L14-2 assume !(main_~i~0 == main_~range~0); 12016#L17-1 assume !(1 == main_~up~0); 12015#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12014#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11985#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12012#L14 assume !(0 == main_~i~0); 12010#L14-2 assume !(main_~i~0 == main_~range~0); 12008#L17-1 assume !(1 == main_~up~0); 11989#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11984#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11981#L26-1 [2019-01-01 21:40:10,057 INFO L796 eck$LassoCheckResult]: Loop: 11981#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11982#L14 assume 0 == main_~i~0;main_~up~0 := 1; 11983#L14-2 assume !(main_~i~0 == main_~range~0); 11953#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11946#L20-1 assume !(0 == main_~up~0); 11947#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 11998#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11996#L14 assume !(0 == main_~i~0); 11994#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 11992#L17-1 assume !(1 == main_~up~0); 11990#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11986#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 11981#L26-1 [2019-01-01 21:40:10,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:10,058 INFO L82 PathProgramCache]: Analyzing trace with hash 236933650, now seen corresponding path program 15 times [2019-01-01 21:40:10,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:10,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:10,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:10,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:10,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:10,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:10,107 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 19 times [2019-01-01 21:40:10,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:10,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:10,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:10,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:10,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:10,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:10,122 INFO L82 PathProgramCache]: Analyzing trace with hash 2067014132, now seen corresponding path program 15 times [2019-01-01 21:40:10,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:10,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:10,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:10,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:40:10,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:40:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 182 proven. 954 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:10,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:40:10,727 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-01 21:40:10,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:40:10,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-01 21:40:10,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:40:10,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:40:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 182 proven. 954 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:40:10,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:40:10,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-01-01 21:40:10,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 21:40:10,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-01-01 21:40:10,912 INFO L87 Difference]: Start difference. First operand 186 states and 196 transitions. cyclomatic complexity: 14 Second operand 21 states. [2019-01-01 21:40:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:40:11,218 INFO L93 Difference]: Finished difference Result 199 states and 209 transitions. [2019-01-01 21:40:11,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-01 21:40:11,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 199 states and 209 transitions. [2019-01-01 21:40:11,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:11,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 199 states to 197 states and 207 transitions. [2019-01-01 21:40:11,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:40:11,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:40:11,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 207 transitions. [2019-01-01 21:40:11,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:40:11,223 INFO L705 BuchiCegarLoop]: Abstraction has 197 states and 207 transitions. [2019-01-01 21:40:11,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 207 transitions. [2019-01-01 21:40:11,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2019-01-01 21:40:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-01 21:40:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 202 transitions. [2019-01-01 21:40:11,226 INFO L728 BuchiCegarLoop]: Abstraction has 192 states and 202 transitions. [2019-01-01 21:40:11,227 INFO L608 BuchiCegarLoop]: Abstraction has 192 states and 202 transitions. [2019-01-01 21:40:11,227 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2019-01-01 21:40:11,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 192 states and 202 transitions. [2019-01-01 21:40:11,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:40:11,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:40:11,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:40:11,229 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [19, 19, 19, 19, 19, 19, 1] [2019-01-01 21:40:11,229 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:40:11,229 INFO L794 eck$LassoCheckResult]: Stem: 12710#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 12711#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12754#L14 assume !(0 == main_~i~0); 12901#L14-2 assume !(main_~i~0 == main_~range~0); 12900#L17-1 assume !(1 == main_~up~0); 12898#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12897#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12896#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12895#L14 assume !(0 == main_~i~0); 12893#L14-2 assume !(main_~i~0 == main_~range~0); 12891#L17-1 assume !(1 == main_~up~0); 12889#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12887#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12886#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12885#L14 assume !(0 == main_~i~0); 12884#L14-2 assume !(main_~i~0 == main_~range~0); 12883#L17-1 assume !(1 == main_~up~0); 12882#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12881#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12880#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12879#L14 assume !(0 == main_~i~0); 12878#L14-2 assume !(main_~i~0 == main_~range~0); 12877#L17-1 assume !(1 == main_~up~0); 12876#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12875#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12874#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12873#L14 assume !(0 == main_~i~0); 12872#L14-2 assume !(main_~i~0 == main_~range~0); 12871#L17-1 assume !(1 == main_~up~0); 12870#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12869#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12868#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12867#L14 assume !(0 == main_~i~0); 12866#L14-2 assume !(main_~i~0 == main_~range~0); 12865#L17-1 assume !(1 == main_~up~0); 12864#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12863#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12862#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12861#L14 assume !(0 == main_~i~0); 12860#L14-2 assume !(main_~i~0 == main_~range~0); 12859#L17-1 assume !(1 == main_~up~0); 12858#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12857#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12856#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12855#L14 assume !(0 == main_~i~0); 12854#L14-2 assume !(main_~i~0 == main_~range~0); 12853#L17-1 assume !(1 == main_~up~0); 12852#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12851#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12850#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12849#L14 assume !(0 == main_~i~0); 12848#L14-2 assume !(main_~i~0 == main_~range~0); 12847#L17-1 assume !(1 == main_~up~0); 12846#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12845#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12844#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12843#L14 assume !(0 == main_~i~0); 12842#L14-2 assume !(main_~i~0 == main_~range~0); 12841#L17-1 assume !(1 == main_~up~0); 12840#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12839#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12838#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12837#L14 assume !(0 == main_~i~0); 12836#L14-2 assume !(main_~i~0 == main_~range~0); 12835#L17-1 assume !(1 == main_~up~0); 12834#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12833#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12832#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12831#L14 assume !(0 == main_~i~0); 12830#L14-2 assume !(main_~i~0 == main_~range~0); 12829#L17-1 assume !(1 == main_~up~0); 12828#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12827#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12826#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12825#L14 assume !(0 == main_~i~0); 12824#L14-2 assume !(main_~i~0 == main_~range~0); 12823#L17-1 assume !(1 == main_~up~0); 12822#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12821#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12820#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12819#L14 assume !(0 == main_~i~0); 12818#L14-2 assume !(main_~i~0 == main_~range~0); 12817#L17-1 assume !(1 == main_~up~0); 12816#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12815#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12814#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12813#L14 assume !(0 == main_~i~0); 12812#L14-2 assume !(main_~i~0 == main_~range~0); 12811#L17-1 assume !(1 == main_~up~0); 12810#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12809#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12808#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12807#L14 assume !(0 == main_~i~0); 12806#L14-2 assume !(main_~i~0 == main_~range~0); 12805#L17-1 assume !(1 == main_~up~0); 12804#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12803#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12802#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12801#L14 assume !(0 == main_~i~0); 12800#L14-2 assume !(main_~i~0 == main_~range~0); 12799#L17-1 assume !(1 == main_~up~0); 12798#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12797#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12796#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12795#L14 assume !(0 == main_~i~0); 12794#L14-2 assume !(main_~i~0 == main_~range~0); 12793#L17-1 assume !(1 == main_~up~0); 12792#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12791#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12762#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12789#L14 assume !(0 == main_~i~0); 12787#L14-2 assume !(main_~i~0 == main_~range~0); 12785#L17-1 assume !(1 == main_~up~0); 12766#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12761#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12758#L26-1 [2019-01-01 21:40:11,229 INFO L796 eck$LassoCheckResult]: Loop: 12758#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12759#L14 assume 0 == main_~i~0;main_~up~0 := 1; 12760#L14-2 assume !(main_~i~0 == main_~range~0); 12730#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 12723#L20-1 assume !(0 == main_~up~0); 12724#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 12775#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12773#L14 assume !(0 == main_~i~0); 12771#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 12769#L17-1 assume !(1 == main_~up~0); 12767#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12763#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 12758#L26-1 [2019-01-01 21:40:11,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:11,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1140312163, now seen corresponding path program 16 times [2019-01-01 21:40:11,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:11,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:11,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:11,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:11,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:11,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:11,254 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 20 times [2019-01-01 21:40:11,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:11,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:11,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:11,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:11,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:11,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:11,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1988057403, now seen corresponding path program 16 times [2019-01-01 21:40:11,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:11,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:11,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:11,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:11,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:11,821 WARN L181 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 18 [2019-01-01 21:40:11,941 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 21:40:13,111 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 281 DAG size of output: 128 [2019-01-01 21:40:13,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:40:13 BoogieIcfgContainer [2019-01-01 21:40:13,179 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:40:13,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:40:13,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:40:13,180 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:40:13,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:39:44" (3/4) ... [2019-01-01 21:40:13,185 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 21:40:13,267 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 21:40:13,268 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:40:13,268 INFO L168 Benchmark]: Toolchain (without parser) took 29473.58 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 357.0 MB). Free memory was 951.4 MB in the beginning and 890.0 MB in the end (delta: 61.4 MB). Peak memory consumption was 418.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:40:13,269 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:40:13,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.85 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:40:13,270 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.51 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:40:13,270 INFO L168 Benchmark]: Boogie Preprocessor took 19.88 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:40:13,270 INFO L168 Benchmark]: RCFGBuilder took 362.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:40:13,271 INFO L168 Benchmark]: BuchiAutomizer took 28661.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 224.4 MB). Free memory was 1.1 GB in the beginning and 890.0 MB in the end (delta: 217.2 MB). Peak memory consumption was 441.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:40:13,271 INFO L168 Benchmark]: Witness Printer took 87.83 ms. Allocated memory is still 1.4 GB. Free memory is still 890.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:40:13,274 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 298.85 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.51 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.88 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 362.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 28661.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 224.4 MB). Free memory was 1.1 GB in the beginning and 890.0 MB in the end (delta: 217.2 MB). Peak memory consumption was 441.6 MB. Max. memory is 11.5 GB. * Witness Printer took 87.83 ms. Allocated memory is still 1.4 GB. Free memory is still 890.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 31 terminating modules (26 trivial, 3 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + range and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + range and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. 26 modules have a trivial ranking function, the largest among these consists of 23 locations. The remainder module has 192 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 28.5s and 29 iterations. TraceHistogramMax:19. Analysis of lassos took 19.0s. Construction of modules took 5.0s. Büchi inclusion checks took 3.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 28. Automata minimization 0.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 410 StatesRemovedByMinimization, 29 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 192 states and ocurred in iteration 28. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 301 SDtfs, 1163 SDslu, 624 SDs, 0 SdLazy, 3299 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT2 conc16 concLT1 SILN2 SILU0 SILI1 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital29 mio100 ax140 hnf100 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf97 smp63 dnf137 smp95 tf106 neg91 sie118 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 13]: 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, range=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67f685f=0, \result=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 13]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 Loop: [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...