./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/UpAndDown.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/termination-restricted-15/UpAndDown.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 014f994c3374ea132faaa71956bb80ddfc4c8f9b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:58:56,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:58:56,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:58:56,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:58:56,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:58:56,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:58:56,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:58:56,967 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:58:56,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:58:56,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:58:56,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:58:56,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:58:56,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:58:56,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:58:56,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:58:56,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:58:56,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:58:56,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:58:56,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:58:56,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:58:56,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:58:56,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:58:56,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:58:56,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:58:57,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:58:57,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:58:57,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:58:57,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:58:57,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:58:57,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:58:57,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:58:57,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:58:57,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:58:57,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:58:57,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:58:57,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:58:57,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:58:57,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:58:57,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:58:57,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:58:57,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:58:57,021 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 02:58:57,045 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:58:57,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:58:57,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:58:57,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:58:57,047 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:58:57,048 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 02:58:57,048 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 02:58:57,048 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 02:58:57,048 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 02:58:57,048 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 02:58:57,049 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 02:58:57,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:58:57,049 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:58:57,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:58:57,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:58:57,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 02:58:57,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 02:58:57,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 02:58:57,050 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:58:57,051 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 02:58:57,051 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:58:57,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 02:58:57,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:58:57,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:58:57,052 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 02:58:57,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:58:57,052 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:58:57,052 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 02:58:57,053 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 02:58:57,054 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 014f994c3374ea132faaa71956bb80ddfc4c8f9b [2019-11-28 02:58:57,385 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:58:57,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:58:57,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:58:57,416 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:58:57,417 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:58:57,418 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/UpAndDown.c [2019-11-28 02:58:57,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ccb2d23/7a582b44ab7e4310a56afb5f513ff32b/FLAGfa7140b5a [2019-11-28 02:58:57,955 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:58:57,956 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDown.c [2019-11-28 02:58:57,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ccb2d23/7a582b44ab7e4310a56afb5f513ff32b/FLAGfa7140b5a [2019-11-28 02:58:58,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ccb2d23/7a582b44ab7e4310a56afb5f513ff32b [2019-11-28 02:58:58,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:58:58,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:58:58,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:58:58,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:58:58,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:58:58,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:58:58" (1/1) ... [2019-11-28 02:58:58,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c624c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:58, skipping insertion in model container [2019-11-28 02:58:58,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:58:58" (1/1) ... [2019-11-28 02:58:58,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:58:58,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:58:58,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:58:58,624 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:58:58,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:58:58,649 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:58:58,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:58 WrapperNode [2019-11-28 02:58:58,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:58:58,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:58:58,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:58:58,651 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:58:58,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:58" (1/1) ... [2019-11-28 02:58:58,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:58" (1/1) ... [2019-11-28 02:58:58,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:58:58,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:58:58,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:58:58,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:58:58,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:58" (1/1) ... [2019-11-28 02:58:58,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:58" (1/1) ... [2019-11-28 02:58:58,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:58" (1/1) ... [2019-11-28 02:58:58,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:58" (1/1) ... [2019-11-28 02:58:58,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:58" (1/1) ... [2019-11-28 02:58:58,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:58" (1/1) ... [2019-11-28 02:58:58,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:58" (1/1) ... [2019-11-28 02:58:58,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:58:58,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:58:58,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:58:58,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:58:58,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:58" (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-11-28 02:58:58,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:58:58,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:58:58,967 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:58:58,968 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 02:58:58,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:58:58 BoogieIcfgContainer [2019-11-28 02:58:58,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:58:58,970 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 02:58:58,970 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 02:58:58,973 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 02:58:58,974 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:58:58,974 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 02:58:58" (1/3) ... [2019-11-28 02:58:58,975 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@414f87c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:58:58, skipping insertion in model container [2019-11-28 02:58:58,976 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:58:58,976 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:58" (2/3) ... [2019-11-28 02:58:58,976 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@414f87c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:58:58, skipping insertion in model container [2019-11-28 02:58:58,976 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:58:58,976 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:58:58" (3/3) ... [2019-11-28 02:58:58,978 INFO L371 chiAutomizerObserver]: Analyzing ICFG UpAndDown.c [2019-11-28 02:58:59,025 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 02:58:59,025 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 02:58:59,025 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 02:58:59,026 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:58:59,026 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:58:59,026 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 02:58:59,026 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:58:59,026 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 02:58:59,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-11-28 02:58:59,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:58:59,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:59,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:59,066 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:58:59,066 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:58:59,067 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 02:58:59,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-11-28 02:58:59,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:58:59,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:59,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:59,069 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:58:59,069 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:58:59,077 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 5#L18-1true [2019-11-28 02:58:59,078 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6#L12true assume 10 == main_~i~0;main_~up~0 := 0; 3#L12-2true assume 0 == main_~i~0;main_~up~0 := 1; 9#L15-1true assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5#L18-1true [2019-11-28 02:58:59,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:59,085 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 02:58:59,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:59,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243258249] [2019-11-28 02:58:59,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:59,178 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:59,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:59,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1234538, now seen corresponding path program 1 times [2019-11-28 02:58:59,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:59,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684240348] [2019-11-28 02:58:59,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:59,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684240348] [2019-11-28 02:58:59,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:58:59,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:58:59,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732441678] [2019-11-28 02:58:59,267 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:59,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:59,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:58:59,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:58:59,289 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-11-28 02:58:59,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:59,362 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-11-28 02:58:59,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:58:59,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-11-28 02:58:59,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 02:58:59,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 9 states and 14 transitions. [2019-11-28 02:58:59,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 02:58:59,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 02:58:59,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. [2019-11-28 02:58:59,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:58:59,394 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-11-28 02:58:59,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. [2019-11-28 02:58:59,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-28 02:58:59,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 02:58:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-11-28 02:58:59,475 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-11-28 02:58:59,475 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-11-28 02:58:59,476 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 02:58:59,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2019-11-28 02:58:59,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 02:58:59,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:59,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:59,478 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:58:59,478 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:58:59,478 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 38#L18-1 [2019-11-28 02:58:59,479 INFO L796 eck$LassoCheckResult]: Loop: 38#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 43#L12 assume 10 == main_~i~0;main_~up~0 := 0; 35#L12-2 assume !(0 == main_~i~0); 36#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 38#L18-1 [2019-11-28 02:58:59,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:59,480 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-28 02:58:59,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:59,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134186322] [2019-11-28 02:58:59,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:59,499 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:59,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:59,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1234602, now seen corresponding path program 1 times [2019-11-28 02:58:59,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:59,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897684377] [2019-11-28 02:58:59,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:59,529 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:59,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:59,529 INFO L82 PathProgramCache]: Analyzing trace with hash 29863753, now seen corresponding path program 1 times [2019-11-28 02:58:59,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:59,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261032086] [2019-11-28 02:58:59,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:59,563 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:59,650 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:59,650 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:59,651 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:59,651 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:59,651 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:59,651 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:59,651 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:59,651 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:59,652 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration2_Loop [2019-11-28 02:58:59,652 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:59,652 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:59,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:59,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:59,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:59,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:59,794 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:59,795 INFO L404 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-11-28 02:58:59,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:59,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:59,812 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:59,812 INFO L440 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-11-28 02:58:59,820 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:59,820 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:59,827 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:59,827 INFO L440 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-11-28 02:58:59,835 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:59,835 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:59,839 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:59,840 INFO L440 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-11-28 02:58:59,858 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:59,858 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:59,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:59,878 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:59,889 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:59,892 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:59,892 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:59,892 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:59,892 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:59,893 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:59,893 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:59,893 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:59,893 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:59,893 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration2_Loop [2019-11-28 02:58:59,893 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:59,894 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:59,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:59,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:59,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:59,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,009 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:00,017 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 02:59:00,023 INFO L120 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-11-28 02:59:00,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:00,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:00,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:00,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:00,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:00,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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) [2019-11-28 02:59:00,065 INFO L120 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-11-28 02:59:00,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:00,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:00,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:00,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:00,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:00,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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-11-28 02:59:00,091 INFO L120 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-11-28 02:59:00,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:00,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:00,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:00,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:00,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:00,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:00,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:00,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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) [2019-11-28 02:59:00,113 INFO L120 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-11-28 02:59:00,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:00,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:00,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:00,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:00,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:00,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:00,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,125 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:00,131 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:00,131 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 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-11-28 02:59:00,148 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:00,149 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:00,149 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:00,150 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-28 02:59:00,154 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:00,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:00,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:00,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:00,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:00,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:00,223 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 02:59:00,224 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 14 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 02:59:00,299 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 14 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 32 transitions. Complement of second has 5 states. [2019-11-28 02:59:00,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:00,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:59:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-28 02:59:00,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-28 02:59:00,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:00,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 02:59:00,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:00,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 8 letters. [2019-11-28 02:59:00,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:00,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 32 transitions. [2019-11-28 02:59:00,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 02:59:00,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 32 transitions. [2019-11-28 02:59:00,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 02:59:00,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 02:59:00,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 32 transitions. [2019-11-28 02:59:00,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:00,314 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2019-11-28 02:59:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 32 transitions. [2019-11-28 02:59:00,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-28 02:59:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 02:59:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2019-11-28 02:59:00,322 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2019-11-28 02:59:00,323 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2019-11-28 02:59:00,323 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 02:59:00,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2019-11-28 02:59:00,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 02:59:00,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:00,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:00,330 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 02:59:00,330 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:00,331 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 106#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 110#L12 assume 10 == main_~i~0;main_~up~0 := 0; 112#L12-2 assume !(0 == main_~i~0); 120#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 107#L18-1 [2019-11-28 02:59:00,332 INFO L796 eck$LassoCheckResult]: Loop: 107#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 108#L12 assume 10 == main_~i~0;main_~up~0 := 0; 117#L12-2 assume !(0 == main_~i~0); 118#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 107#L18-1 [2019-11-28 02:59:00,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:00,332 INFO L82 PathProgramCache]: Analyzing trace with hash 29863751, now seen corresponding path program 1 times [2019-11-28 02:59:00,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:00,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575371549] [2019-11-28 02:59:00,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:00,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575371549] [2019-11-28 02:59:00,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:59:00,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:59:00,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145481413] [2019-11-28 02:59:00,390 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:00,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:00,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1234600, now seen corresponding path program 1 times [2019-11-28 02:59:00,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:00,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989098479] [2019-11-28 02:59:00,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:00,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989098479] [2019-11-28 02:59:00,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:59:00,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:59:00,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658511651] [2019-11-28 02:59:00,430 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:00,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:00,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:59:00,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:59:00,431 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 02:59:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:00,445 INFO L93 Difference]: Finished difference Result 29 states and 43 transitions. [2019-11-28 02:59:00,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:59:00,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 43 transitions. [2019-11-28 02:59:00,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 02:59:00,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 39 transitions. [2019-11-28 02:59:00,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 02:59:00,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 02:59:00,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 39 transitions. [2019-11-28 02:59:00,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:00,453 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 39 transitions. [2019-11-28 02:59:00,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 39 transitions. [2019-11-28 02:59:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-28 02:59:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 02:59:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2019-11-28 02:59:00,461 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 38 transitions. [2019-11-28 02:59:00,461 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 38 transitions. [2019-11-28 02:59:00,461 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 02:59:00,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 38 transitions. [2019-11-28 02:59:00,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 02:59:00,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:00,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:00,464 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 02:59:00,464 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:00,464 INFO L794 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 162#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 166#L12 assume !(10 == main_~i~0); 168#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 172#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 173#L18-1 [2019-11-28 02:59:00,464 INFO L796 eck$LassoCheckResult]: Loop: 173#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 178#L12 assume !(10 == main_~i~0); 176#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 174#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 173#L18-1 [2019-11-28 02:59:00,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:00,465 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 1 times [2019-11-28 02:59:00,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:00,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631119454] [2019-11-28 02:59:00,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:00,483 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:00,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:00,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1236460, now seen corresponding path program 1 times [2019-11-28 02:59:00,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:00,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661252067] [2019-11-28 02:59:00,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:00,496 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:00,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:00,496 INFO L82 PathProgramCache]: Analyzing trace with hash -760725642, now seen corresponding path program 2 times [2019-11-28 02:59:00,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:00,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694283369] [2019-11-28 02:59:00,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:00,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694283369] [2019-11-28 02:59:00,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:59:00,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:59:00,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74975266] [2019-11-28 02:59:00,562 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:00,562 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:00,563 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:00,563 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:00,563 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:00,563 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,563 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:00,564 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:00,564 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration4_Loop [2019-11-28 02:59:00,564 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:00,564 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:00,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,647 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:00,647 INFO L404 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) [2019-11-28 02:59:00,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:00,673 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,685 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:00,686 INFO L440 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:00,704 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:00,704 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,712 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:00,712 INFO L440 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:00,725 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:00,725 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,731 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:00,732 INFO L440 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:00,745 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:00,745 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:00,765 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:00,765 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,773 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:00,776 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:00,776 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:00,776 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:00,776 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:00,777 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:00,777 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,777 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:00,777 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:00,777 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration4_Loop [2019-11-28 02:59:00,777 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:00,778 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:00,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-11-28 02:59:00,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,867 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:00,867 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 02:59:00,881 INFO L120 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-11-28 02:59:00,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:00,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:00,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:00,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:00,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:00,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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) [2019-11-28 02:59:00,907 INFO L120 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-11-28 02:59:00,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:00,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:00,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:00,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:00,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:00,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:00,933 INFO L120 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-11-28 02:59:00,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:00,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:00,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:00,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:00,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:00,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:00,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,941 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:00,943 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:00,943 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:00,950 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:00,950 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:00,950 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:00,950 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2019-11-28 02:59:00,954 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:01,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:01,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:01,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:01,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:01,040 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 02:59:01,040 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 38 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-28 02:59:01,083 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 38 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 42 states and 62 transitions. Complement of second has 7 states. [2019-11-28 02:59:01,084 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-11-28 02:59:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:59:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-28 02:59:01,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 02:59:01,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:01,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-28 02:59:01,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:01,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-28 02:59:01,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:01,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 62 transitions. [2019-11-28 02:59:01,089 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-28 02:59:01,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 40 states and 60 transitions. [2019-11-28 02:59:01,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-28 02:59:01,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:59:01,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 60 transitions. [2019-11-28 02:59:01,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:01,091 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 60 transitions. [2019-11-28 02:59:01,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 60 transitions. [2019-11-28 02:59:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-11-28 02:59:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 02:59:01,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 56 transitions. [2019-11-28 02:59:01,095 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 56 transitions. [2019-11-28 02:59:01,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:01,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:59:01,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:59:01,096 INFO L87 Difference]: Start difference. First operand 37 states and 56 transitions. Second operand 4 states. [2019-11-28 02:59:01,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:01,126 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2019-11-28 02:59:01,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:59:01,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 61 transitions. [2019-11-28 02:59:01,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-28 02:59:01,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 38 states and 56 transitions. [2019-11-28 02:59:01,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-28 02:59:01,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-28 02:59:01,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 56 transitions. [2019-11-28 02:59:01,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:01,130 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-11-28 02:59:01,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 56 transitions. [2019-11-28 02:59:01,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-11-28 02:59:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 02:59:01,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2019-11-28 02:59:01,133 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2019-11-28 02:59:01,134 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2019-11-28 02:59:01,134 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 02:59:01,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2019-11-28 02:59:01,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 02:59:01,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:01,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:01,135 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 02:59:01,136 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:01,136 INFO L794 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 361#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 365#L12 assume !(10 == main_~i~0); 367#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 374#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 362#L18-1 [2019-11-28 02:59:01,136 INFO L796 eck$LassoCheckResult]: Loop: 362#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 363#L12 assume !(10 == main_~i~0); 356#L12-2 assume !(0 == main_~i~0); 357#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 362#L18-1 [2019-11-28 02:59:01,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,136 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 3 times [2019-11-28 02:59:01,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504175705] [2019-11-28 02:59:01,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,145 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:01,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1236522, now seen corresponding path program 1 times [2019-11-28 02:59:01,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093524551] [2019-11-28 02:59:01,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,154 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:01,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,154 INFO L82 PathProgramCache]: Analyzing trace with hash -760725580, now seen corresponding path program 1 times [2019-11-28 02:59:01,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009439165] [2019-11-28 02:59:01,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,171 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:01,200 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:01,200 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:01,200 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:01,200 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:01,200 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:01,201 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,201 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:01,201 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:01,201 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration5_Loop [2019-11-28 02:59:01,201 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:01,201 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:01,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,304 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:01,304 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:01,325 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:01,326 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,330 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:01,330 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:01,345 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:01,345 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,349 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:01,349 INFO L440 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:01,364 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:01,365 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,369 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:01,369 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:01,376 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:01,376 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:01,386 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:01,386 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,393 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:01,395 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:01,395 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:01,396 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:01,396 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:01,396 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:01,396 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,397 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:01,397 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:01,398 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration5_Loop [2019-11-28 02:59:01,398 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:01,398 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:01,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,502 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:01,502 INFO L489 LassoAnalysis]: Using template 'affine'. 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-11-28 02:59:01,513 INFO L120 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-11-28 02:59:01,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:01,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:01,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:01,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:01,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:01,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:01,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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) [2019-11-28 02:59:01,530 INFO L120 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-11-28 02:59:01,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:01,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:01,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:01,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:01,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:01,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,543 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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-11-28 02:59:01,574 INFO L120 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 Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:01,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:01,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:01,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:01,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:01,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:01,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:01,587 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:01,590 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:01,591 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:01,596 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:01,596 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:01,597 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:01,597 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2019-11-28 02:59:01,608 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:01,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:01,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:01,663 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:59:01,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:01,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:01,692 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-11-28 02:59:01,692 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 42 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-11-28 02:59:01,729 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 42 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 40 states and 57 transitions. Complement of second has 7 states. [2019-11-28 02:59:01,730 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-11-28 02:59:01,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:59:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-28 02:59:01,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 02:59:01,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:01,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-28 02:59:01,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:01,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-28 02:59:01,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:01,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 57 transitions. [2019-11-28 02:59:01,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 02:59:01,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 55 transitions. [2019-11-28 02:59:01,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-28 02:59:01,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:59:01,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 55 transitions. [2019-11-28 02:59:01,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:01,740 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-11-28 02:59:01,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 55 transitions. [2019-11-28 02:59:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-11-28 02:59:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 02:59:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-11-28 02:59:01,748 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-11-28 02:59:01,748 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-11-28 02:59:01,748 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 02:59:01,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 53 transitions. [2019-11-28 02:59:01,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 02:59:01,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:01,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:01,751 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-11-28 02:59:01,752 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:01,752 INFO L794 eck$LassoCheckResult]: Stem: 480#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 481#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 485#L12 assume !(10 == main_~i~0); 501#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 500#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 499#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 487#L12 assume 10 == main_~i~0;main_~up~0 := 0; 476#L12-2 [2019-11-28 02:59:01,752 INFO L796 eck$LassoCheckResult]: Loop: 476#L12-2 assume !(0 == main_~i~0); 477#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 511#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 509#L12 assume 10 == main_~i~0;main_~up~0 := 0; 476#L12-2 [2019-11-28 02:59:01,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1363918578, now seen corresponding path program 1 times [2019-11-28 02:59:01,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023961821] [2019-11-28 02:59:01,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:01,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023961821] [2019-11-28 02:59:01,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:59:01,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:59:01,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392175752] [2019-11-28 02:59:01,808 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:01,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 2 times [2019-11-28 02:59:01,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11610876] [2019-11-28 02:59:01,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,830 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:01,873 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:01,873 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:01,873 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:01,873 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:01,873 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:01,873 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,873 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:01,873 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:01,874 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration6_Loop [2019-11-28 02:59:01,874 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:01,874 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:01,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,946 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:01,946 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:01,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:01,953 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,959 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:01,959 INFO L440 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:01,970 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:01,971 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,975 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:01,975 INFO L440 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:01,982 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:01,982 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,000 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:02,000 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:02,104 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:02,106 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:02,106 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:02,106 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:02,107 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:02,107 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:02,107 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,107 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:02,107 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:02,107 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration6_Loop [2019-11-28 02:59:02,107 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:02,107 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:02,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,214 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:02,214 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,223 INFO L120 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-11-28 02:59:02,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:02,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:02,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:02,226 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 02:59:02,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:02,229 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 02:59:02,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:02,232 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,237 INFO L120 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-11-28 02:59:02,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:02,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:02,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:02,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:02,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:02,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:02,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:02,246 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:02,249 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:02,249 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,252 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:02,253 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:02,253 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:02,253 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-28 02:59:02,255 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:02,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:02,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:02,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:02,318 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-11-28 02:59:02,318 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 53 transitions. cyclomatic complexity: 20 Second operand 5 states. [2019-11-28 02:59:02,364 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 53 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 93 states and 141 transitions. Complement of second has 7 states. [2019-11-28 02:59:02,365 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-11-28 02:59:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:59:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-28 02:59:02,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-28 02:59:02,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:02,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-28 02:59:02,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:02,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2019-11-28 02:59:02,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:02,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 141 transitions. [2019-11-28 02:59:02,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-28 02:59:02,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 78 states and 116 transitions. [2019-11-28 02:59:02,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2019-11-28 02:59:02,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2019-11-28 02:59:02,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 116 transitions. [2019-11-28 02:59:02,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:02,373 INFO L688 BuchiCegarLoop]: Abstraction has 78 states and 116 transitions. [2019-11-28 02:59:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 116 transitions. [2019-11-28 02:59:02,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-11-28 02:59:02,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 02:59:02,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2019-11-28 02:59:02,380 INFO L711 BuchiCegarLoop]: Abstraction has 77 states and 115 transitions. [2019-11-28 02:59:02,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:02,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:59:02,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:59:02,381 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand 4 states. [2019-11-28 02:59:02,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:02,415 INFO L93 Difference]: Finished difference Result 105 states and 146 transitions. [2019-11-28 02:59:02,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:59:02,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 146 transitions. [2019-11-28 02:59:02,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2019-11-28 02:59:02,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 105 states and 146 transitions. [2019-11-28 02:59:02,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2019-11-28 02:59:02,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2019-11-28 02:59:02,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 146 transitions. [2019-11-28 02:59:02,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:02,421 INFO L688 BuchiCegarLoop]: Abstraction has 105 states and 146 transitions. [2019-11-28 02:59:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 146 transitions. [2019-11-28 02:59:02,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2019-11-28 02:59:02,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 02:59:02,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2019-11-28 02:59:02,429 INFO L711 BuchiCegarLoop]: Abstraction has 99 states and 140 transitions. [2019-11-28 02:59:02,429 INFO L591 BuchiCegarLoop]: Abstraction has 99 states and 140 transitions. [2019-11-28 02:59:02,429 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 02:59:02,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 140 transitions. [2019-11-28 02:59:02,431 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2019-11-28 02:59:02,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:02,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:02,432 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-28 02:59:02,432 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:02,432 INFO L794 eck$LassoCheckResult]: Stem: 849#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 850#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 875#L12 assume !(10 == main_~i~0); 872#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 873#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 869#L12 assume !(10 == main_~i~0); 923#L12-2 assume !(0 == main_~i~0); 922#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 910#L18-1 [2019-11-28 02:59:02,432 INFO L796 eck$LassoCheckResult]: Loop: 910#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 921#L12 assume !(10 == main_~i~0); 919#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 917#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 910#L18-1 [2019-11-28 02:59:02,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,433 INFO L82 PathProgramCache]: Analyzing trace with hash -760725578, now seen corresponding path program 1 times [2019-11-28 02:59:02,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:02,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972786883] [2019-11-28 02:59:02,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:59:02,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972786883] [2019-11-28 02:59:02,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:59:02,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:59:02,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033002162] [2019-11-28 02:59:02,450 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:02,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1236462, now seen corresponding path program 1 times [2019-11-28 02:59:02,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:02,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643820141] [2019-11-28 02:59:02,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:02,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643820141] [2019-11-28 02:59:02,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:59:02,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:59:02,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730570271] [2019-11-28 02:59:02,462 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:02,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:02,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:59:02,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:59:02,463 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. cyclomatic complexity: 51 Second operand 3 states. [2019-11-28 02:59:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:02,492 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2019-11-28 02:59:02,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:59:02,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 76 transitions. [2019-11-28 02:59:02,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 02:59:02,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 51 states and 63 transitions. [2019-11-28 02:59:02,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-28 02:59:02,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-28 02:59:02,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2019-11-28 02:59:02,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:02,496 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2019-11-28 02:59:02,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2019-11-28 02:59:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2019-11-28 02:59:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 02:59:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2019-11-28 02:59:02,502 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-11-28 02:59:02,502 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-11-28 02:59:02,502 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 02:59:02,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2019-11-28 02:59:02,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 02:59:02,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:02,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:02,507 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2019-11-28 02:59:02,507 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:02,507 INFO L794 eck$LassoCheckResult]: Stem: 1019#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1020#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1050#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1055#L12-2 assume !(0 == main_~i~0); 1030#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1031#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1048#L12 assume !(10 == main_~i~0); 1044#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1045#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1038#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1039#L12 assume !(10 == main_~i~0); 1034#L12-2 assume !(0 == main_~i~0); 1035#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1040#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1041#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1057#L12-2 [2019-11-28 02:59:02,508 INFO L796 eck$LassoCheckResult]: Loop: 1057#L12-2 assume !(0 == main_~i~0); 1028#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1029#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1058#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1057#L12-2 [2019-11-28 02:59:02,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1385122848, now seen corresponding path program 1 times [2019-11-28 02:59:02,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:02,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878394994] [2019-11-28 02:59:02,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 02:59:02,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878394994] [2019-11-28 02:59:02,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854492925] [2019-11-28 02:59:02,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:59:02,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 02:59:02,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:02,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 02:59:02,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404076364] [2019-11-28 02:59:02,564 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:02,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 3 times [2019-11-28 02:59:02,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:02,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477672056] [2019-11-28 02:59:02,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,571 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:02,603 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:02,603 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:02,603 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:02,603 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:02,604 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:02,604 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,604 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:02,604 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:02,604 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration8_Loop [2019-11-28 02:59:02,604 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:02,604 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:02,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,690 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:02,692 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,697 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:02,697 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:02,706 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,809 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:02,810 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:02,811 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:02,811 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:02,811 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:02,811 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:02,811 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,811 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:02,811 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:02,811 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration8_Loop [2019-11-28 02:59:02,811 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:02,811 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:02,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,891 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:02,891 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,895 INFO L120 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-11-28 02:59:02,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:02,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:02,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:02,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:02,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:02,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:02,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:02,901 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:02,906 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:02,906 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,911 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:02,911 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:02,911 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:02,911 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,914 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:02,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:02,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:02,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:02,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:02,971 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-11-28 02:59:02,972 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-11-28 02:59:03,006 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 59 states and 75 transitions. Complement of second has 7 states. [2019-11-28 02:59:03,007 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-11-28 02:59:03,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:59:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-28 02:59:03,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-28 02:59:03,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,008 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:03,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:03,065 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-11-28 02:59:03,065 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-11-28 02:59:03,115 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 81 states and 96 transitions. Complement of second has 9 states. [2019-11-28 02:59:03,115 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-11-28 02:59:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:59:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-11-28 02:59:03,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-28 02:59:03,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,116 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:03,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:03,162 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-11-28 02:59:03,162 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-11-28 02:59:03,188 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 68 states and 87 transitions. Complement of second has 8 states. [2019-11-28 02:59:03,193 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-11-28 02:59:03,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:59:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-28 02:59:03,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-28 02:59:03,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 19 letters. Loop has 4 letters. [2019-11-28 02:59:03,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 8 letters. [2019-11-28 02:59:03,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 87 transitions. [2019-11-28 02:59:03,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 02:59:03,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 63 transitions. [2019-11-28 02:59:03,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 02:59:03,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-28 02:59:03,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2019-11-28 02:59:03,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:03,199 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2019-11-28 02:59:03,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2019-11-28 02:59:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2019-11-28 02:59:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 02:59:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-28 02:59:03,201 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-28 02:59:03,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:03,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:59:03,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:59:03,202 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 4 states. [2019-11-28 02:59:03,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:03,226 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-11-28 02:59:03,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:59:03,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2019-11-28 02:59:03,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-11-28 02:59:03,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 49 transitions. [2019-11-28 02:59:03,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 02:59:03,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 02:59:03,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2019-11-28 02:59:03,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:03,229 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2019-11-28 02:59:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2019-11-28 02:59:03,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2019-11-28 02:59:03,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 02:59:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-11-28 02:59:03,232 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-28 02:59:03,232 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-28 02:59:03,232 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 02:59:03,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2019-11-28 02:59:03,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-28 02:59:03,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:03,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:03,234 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2019-11-28 02:59:03,234 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1] [2019-11-28 02:59:03,234 INFO L794 eck$LassoCheckResult]: Stem: 1606#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1607#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1612#L12 assume !(10 == main_~i~0); 1613#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1615#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1608#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1609#L12 assume !(10 == main_~i~0); 1633#L12-2 assume !(0 == main_~i~0); 1632#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1631#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1621#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1602#L12-2 [2019-11-28 02:59:03,234 INFO L796 eck$LassoCheckResult]: Loop: 1602#L12-2 assume !(0 == main_~i~0); 1603#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1636#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1635#L12 assume !(10 == main_~i~0); 1624#L12-2 assume !(0 == main_~i~0); 1629#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1627#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1622#L12 assume !(10 == main_~i~0); 1625#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1628#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1626#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1619#L12 assume !(10 == main_~i~0); 1617#L12-2 assume !(0 == main_~i~0); 1618#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1630#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1620#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1602#L12-2 [2019-11-28 02:59:03,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,235 INFO L82 PathProgramCache]: Analyzing trace with hash -912841737, now seen corresponding path program 1 times [2019-11-28 02:59:03,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386742462] [2019-11-28 02:59:03,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,269 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:03,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386742462] [2019-11-28 02:59:03,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472602111] [2019-11-28 02:59:03,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:03,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:03,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 02:59:03,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329601782] [2019-11-28 02:59:03,303 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:03,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1697726743, now seen corresponding path program 1 times [2019-11-28 02:59:03,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395164558] [2019-11-28 02:59:03,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:03,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395164558] [2019-11-28 02:59:03,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988875259] [2019-11-28 02:59:03,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 02:59:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,362 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:03,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:03,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 02:59:03,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368222630] [2019-11-28 02:59:03,364 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:03,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:03,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:59:03,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:59:03,365 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. cyclomatic complexity: 11 Second operand 5 states. Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:03,397 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2019-11-28 02:59:03,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:59:03,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 57 transitions. [2019-11-28 02:59:03,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 02:59:03,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 48 states and 56 transitions. [2019-11-28 02:59:03,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 02:59:03,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 02:59:03,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 56 transitions. [2019-11-28 02:59:03,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:03,400 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2019-11-28 02:59:03,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 56 transitions. [2019-11-28 02:59:03,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2019-11-28 02:59:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 02:59:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-11-28 02:59:03,404 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-11-28 02:59:03,404 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-11-28 02:59:03,404 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 02:59:03,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 51 transitions. [2019-11-28 02:59:03,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-28 02:59:03,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:03,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:03,406 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1] [2019-11-28 02:59:03,406 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 2, 1, 1] [2019-11-28 02:59:03,406 INFO L794 eck$LassoCheckResult]: Stem: 1776#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1777#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1793#L12 assume !(10 == main_~i~0); 1794#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1809#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1806#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1807#L12 assume !(10 == main_~i~0); 1813#L12-2 assume !(0 == main_~i~0); 1812#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1780#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1781#L12 assume !(10 == main_~i~0); 1774#L12-2 assume !(0 == main_~i~0); 1775#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1808#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1772#L12-2 [2019-11-28 02:59:03,406 INFO L796 eck$LassoCheckResult]: Loop: 1772#L12-2 assume !(0 == main_~i~0); 1773#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1803#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1801#L12 assume !(10 == main_~i~0); 1792#L12-2 assume !(0 == main_~i~0); 1798#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1795#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1790#L12 assume !(10 == main_~i~0); 1787#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1788#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1779#L12 assume !(10 == main_~i~0); 1814#L12-2 assume !(0 == main_~i~0); 1784#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1785#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1782#L12 assume !(10 == main_~i~0); 1783#L12-2 assume !(0 == main_~i~0); 1789#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1810#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1811#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1772#L12-2 [2019-11-28 02:59:03,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,407 INFO L82 PathProgramCache]: Analyzing trace with hash 554461792, now seen corresponding path program 2 times [2019-11-28 02:59:03,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789859494] [2019-11-28 02:59:03,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:03,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789859494] [2019-11-28 02:59:03,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051149036] [2019-11-28 02:59:03,435 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:03,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:59:03,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:03,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:03,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:03,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-28 02:59:03,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700741642] [2019-11-28 02:59:03,471 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:03,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,471 INFO L82 PathProgramCache]: Analyzing trace with hash 104414290, now seen corresponding path program 2 times [2019-11-28 02:59:03,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970540399] [2019-11-28 02:59:03,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:03,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970540399] [2019-11-28 02:59:03,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356917807] [2019-11-28 02:59:03,538 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:03,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:59:03,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:03,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,566 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:03,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:03,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-28 02:59:03,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163270578] [2019-11-28 02:59:03,567 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:03,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:03,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:59:03,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:59:03,567 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. cyclomatic complexity: 11 Second operand 6 states. [2019-11-28 02:59:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:03,619 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-11-28 02:59:03,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:59:03,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 65 transitions. [2019-11-28 02:59:03,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2019-11-28 02:59:03,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 64 transitions. [2019-11-28 02:59:03,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-28 02:59:03,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-28 02:59:03,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 64 transitions. [2019-11-28 02:59:03,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:03,623 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-11-28 02:59:03,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 64 transitions. [2019-11-28 02:59:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-11-28 02:59:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 02:59:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-11-28 02:59:03,627 INFO L711 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-11-28 02:59:03,627 INFO L591 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-11-28 02:59:03,627 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 02:59:03,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 59 transitions. [2019-11-28 02:59:03,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 02:59:03,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:03,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:03,629 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 1, 1, 1] [2019-11-28 02:59:03,629 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2019-11-28 02:59:03,629 INFO L794 eck$LassoCheckResult]: Stem: 1988#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1989#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1999#L12 assume !(10 == main_~i~0); 2000#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2018#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2015#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2016#L12 assume !(10 == main_~i~0); 2023#L12-2 assume !(0 == main_~i~0); 2024#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2028#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2026#L12 assume !(10 == main_~i~0); 2027#L12-2 assume !(0 == main_~i~0); 1996#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1992#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1993#L12 assume !(10 == main_~i~0); 1986#L12-2 assume !(0 == main_~i~0); 1987#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2019#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2017#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1984#L12-2 [2019-11-28 02:59:03,629 INFO L796 eck$LassoCheckResult]: Loop: 1984#L12-2 assume !(0 == main_~i~0); 1985#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2013#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2011#L12 assume !(10 == main_~i~0); 2003#L12-2 assume !(0 == main_~i~0); 2008#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2006#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2001#L12 assume !(10 == main_~i~0); 1997#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1995#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1990#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1991#L12 assume !(10 == main_~i~0); 1994#L12-2 assume !(0 == main_~i~0); 1998#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2034#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2033#L12 assume !(10 == main_~i~0); 2032#L12-2 assume !(0 == main_~i~0); 2031#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2030#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2029#L12 assume !(10 == main_~i~0); 2025#L12-2 assume !(0 == main_~i~0); 2022#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2020#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2021#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1984#L12-2 [2019-11-28 02:59:03,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1774824375, now seen corresponding path program 3 times [2019-11-28 02:59:03,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868404080] [2019-11-28 02:59:03,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:03,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868404080] [2019-11-28 02:59:03,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217985668] [2019-11-28 02:59:03,678 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:03,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-28 02:59:03,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:03,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,710 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:03,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:03,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 02:59:03,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624488962] [2019-11-28 02:59:03,712 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:03,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1813717701, now seen corresponding path program 3 times [2019-11-28 02:59:03,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114921242] [2019-11-28 02:59:03,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,765 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:03,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114921242] [2019-11-28 02:59:03,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113290090] [2019-11-28 02:59:03,767 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:03,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-28 02:59:03,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:03,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:03,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:03,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 02:59:03,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536509059] [2019-11-28 02:59:03,808 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:03,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:03,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:59:03,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:59:03,809 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. cyclomatic complexity: 11 Second operand 7 states. [2019-11-28 02:59:03,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:03,858 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-11-28 02:59:03,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:59:03,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 73 transitions. [2019-11-28 02:59:03,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2019-11-28 02:59:03,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 72 transitions. [2019-11-28 02:59:03,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 02:59:03,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-28 02:59:03,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 72 transitions. [2019-11-28 02:59:03,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:03,861 INFO L688 BuchiCegarLoop]: Abstraction has 64 states and 72 transitions. [2019-11-28 02:59:03,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 72 transitions. [2019-11-28 02:59:03,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2019-11-28 02:59:03,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 02:59:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-11-28 02:59:03,864 INFO L711 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-11-28 02:59:03,864 INFO L591 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-11-28 02:59:03,865 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 02:59:03,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 67 transitions. [2019-11-28 02:59:03,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2019-11-28 02:59:03,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:03,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:03,876 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 1, 1, 1] [2019-11-28 02:59:03,878 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 5, 2, 1, 1] [2019-11-28 02:59:03,878 INFO L794 eck$LassoCheckResult]: Stem: 2242#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2243#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2254#L12 assume !(10 == main_~i~0); 2255#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2273#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2270#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2271#L12 assume !(10 == main_~i~0); 2296#L12-2 assume !(0 == main_~i~0); 2295#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2246#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2247#L12 assume !(10 == main_~i~0); 2240#L12-2 assume !(0 == main_~i~0); 2241#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2251#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2294#L12 assume !(10 == main_~i~0); 2293#L12-2 assume !(0 == main_~i~0); 2292#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2291#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2275#L12 assume !(10 == main_~i~0); 2280#L12-2 assume !(0 == main_~i~0); 2278#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2274#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2272#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2238#L12-2 [2019-11-28 02:59:03,878 INFO L796 eck$LassoCheckResult]: Loop: 2238#L12-2 assume !(0 == main_~i~0); 2239#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2268#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2266#L12 assume !(10 == main_~i~0); 2258#L12-2 assume !(0 == main_~i~0); 2263#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2261#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2256#L12 assume !(10 == main_~i~0); 2252#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2253#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2244#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2245#L12 assume !(10 == main_~i~0); 2248#L12-2 assume !(0 == main_~i~0); 2249#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2250#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2290#L12 assume !(10 == main_~i~0); 2289#L12-2 assume !(0 == main_~i~0); 2288#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2286#L12 assume !(10 == main_~i~0); 2285#L12-2 assume !(0 == main_~i~0); 2284#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2282#L12 assume !(10 == main_~i~0); 2281#L12-2 assume !(0 == main_~i~0); 2279#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2276#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2277#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2238#L12-2 [2019-11-28 02:59:03,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,879 INFO L82 PathProgramCache]: Analyzing trace with hash 790045106, now seen corresponding path program 4 times [2019-11-28 02:59:03,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469189005] [2019-11-28 02:59:03,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:03,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469189005] [2019-11-28 02:59:03,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860554332] [2019-11-28 02:59:03,954 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:03,978 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:59:03,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:03,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:03,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:03,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-28 02:59:03,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904719590] [2019-11-28 02:59:03,989 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:03,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,989 INFO L82 PathProgramCache]: Analyzing trace with hash 798220708, now seen corresponding path program 4 times [2019-11-28 02:59:03,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148841416] [2019-11-28 02:59:03,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:04,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148841416] [2019-11-28 02:59:04,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870879904] [2019-11-28 02:59:04,047 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:04,080 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:59:04,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:04,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,089 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:04,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:04,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-28 02:59:04,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877349543] [2019-11-28 02:59:04,091 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:04,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:04,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:59:04,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:59:04,092 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. cyclomatic complexity: 11 Second operand 8 states. [2019-11-28 02:59:04,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:04,149 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2019-11-28 02:59:04,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:59:04,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 81 transitions. [2019-11-28 02:59:04,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-11-28 02:59:04,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 72 states and 80 transitions. [2019-11-28 02:59:04,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-28 02:59:04,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-28 02:59:04,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 80 transitions. [2019-11-28 02:59:04,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:04,152 INFO L688 BuchiCegarLoop]: Abstraction has 72 states and 80 transitions. [2019-11-28 02:59:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 80 transitions. [2019-11-28 02:59:04,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2019-11-28 02:59:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-28 02:59:04,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2019-11-28 02:59:04,158 INFO L711 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2019-11-28 02:59:04,161 INFO L591 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2019-11-28 02:59:04,161 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 02:59:04,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 75 transitions. [2019-11-28 02:59:04,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-28 02:59:04,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:04,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:04,164 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 1, 1, 1] [2019-11-28 02:59:04,166 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 6, 2, 1, 1] [2019-11-28 02:59:04,167 INFO L794 eck$LassoCheckResult]: Stem: 2538#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2539#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2550#L12 assume !(10 == main_~i~0); 2551#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2569#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2566#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2567#L12 assume !(10 == main_~i~0); 2600#L12-2 assume !(0 == main_~i~0); 2599#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2542#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2543#L12 assume !(10 == main_~i~0); 2536#L12-2 assume !(0 == main_~i~0); 2537#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2547#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2598#L12 assume !(10 == main_~i~0); 2597#L12-2 assume !(0 == main_~i~0); 2596#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2595#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2594#L12 assume !(10 == main_~i~0); 2593#L12-2 assume !(0 == main_~i~0); 2592#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2591#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2573#L12 assume !(10 == main_~i~0); 2577#L12-2 assume !(0 == main_~i~0); 2575#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2572#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2568#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2534#L12-2 [2019-11-28 02:59:04,167 INFO L796 eck$LassoCheckResult]: Loop: 2534#L12-2 assume !(0 == main_~i~0); 2535#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2564#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2562#L12 assume !(10 == main_~i~0); 2554#L12-2 assume !(0 == main_~i~0); 2559#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2557#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2552#L12 assume !(10 == main_~i~0); 2548#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2549#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2540#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2541#L12 assume !(10 == main_~i~0); 2544#L12-2 assume !(0 == main_~i~0); 2545#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2546#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2590#L12 assume !(10 == main_~i~0); 2589#L12-2 assume !(0 == main_~i~0); 2588#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2587#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2586#L12 assume !(10 == main_~i~0); 2585#L12-2 assume !(0 == main_~i~0); 2584#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2583#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2582#L12 assume !(10 == main_~i~0); 2581#L12-2 assume !(0 == main_~i~0); 2580#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2579#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2578#L12 assume !(10 == main_~i~0); 2576#L12-2 assume !(0 == main_~i~0); 2574#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2570#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2571#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2534#L12-2 [2019-11-28 02:59:04,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1500441957, now seen corresponding path program 5 times [2019-11-28 02:59:04,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:04,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541474505] [2019-11-28 02:59:04,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:04,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541474505] [2019-11-28 02:59:04,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655926862] [2019-11-28 02:59:04,249 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:04,276 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-28 02:59:04,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:04,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:04,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:04,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-28 02:59:04,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562338267] [2019-11-28 02:59:04,294 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:04,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1712813683, now seen corresponding path program 5 times [2019-11-28 02:59:04,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:04,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041320360] [2019-11-28 02:59:04,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:04,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041320360] [2019-11-28 02:59:04,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702115278] [2019-11-28 02:59:04,353 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Exception during sending of exit command (exit): Stream closed [2019-11-28 02:59:04,407 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-28 02:59:04,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:04,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:04,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:04,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-28 02:59:04,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142481496] [2019-11-28 02:59:04,416 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:04,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:04,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:59:04,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:59:04,417 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. cyclomatic complexity: 11 Second operand 9 states. [2019-11-28 02:59:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:04,477 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2019-11-28 02:59:04,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:59:04,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 89 transitions. [2019-11-28 02:59:04,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2019-11-28 02:59:04,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 80 states and 88 transitions. [2019-11-28 02:59:04,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-11-28 02:59:04,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-11-28 02:59:04,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 88 transitions. [2019-11-28 02:59:04,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:04,481 INFO L688 BuchiCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-11-28 02:59:04,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 88 transitions. [2019-11-28 02:59:04,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2019-11-28 02:59:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 02:59:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-11-28 02:59:04,483 INFO L711 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-11-28 02:59:04,483 INFO L591 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-11-28 02:59:04,483 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-28 02:59:04,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 83 transitions. [2019-11-28 02:59:04,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2019-11-28 02:59:04,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:04,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:04,485 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 6, 1, 1, 1] [2019-11-28 02:59:04,485 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 7, 2, 1, 1] [2019-11-28 02:59:04,485 INFO L794 eck$LassoCheckResult]: Stem: 2876#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2877#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2892#L12 assume !(10 == main_~i~0); 2893#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2908#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2905#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2906#L12 assume !(10 == main_~i~0); 2946#L12-2 assume !(0 == main_~i~0); 2945#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2880#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2881#L12 assume !(10 == main_~i~0); 2874#L12-2 assume !(0 == main_~i~0); 2875#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2885#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2944#L12 assume !(10 == main_~i~0); 2943#L12-2 assume !(0 == main_~i~0); 2942#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2941#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2940#L12 assume !(10 == main_~i~0); 2939#L12-2 assume !(0 == main_~i~0); 2938#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2937#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2936#L12 assume !(10 == main_~i~0); 2935#L12-2 assume !(0 == main_~i~0); 2934#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2933#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2912#L12 assume !(10 == main_~i~0); 2916#L12-2 assume !(0 == main_~i~0); 2914#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2911#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2907#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2872#L12-2 [2019-11-28 02:59:04,486 INFO L796 eck$LassoCheckResult]: Loop: 2872#L12-2 assume !(0 == main_~i~0); 2873#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2902#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2900#L12 assume !(10 == main_~i~0); 2891#L12-2 assume !(0 == main_~i~0); 2897#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2894#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2889#L12 assume !(10 == main_~i~0); 2886#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2883#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2884#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2932#L12 assume !(10 == main_~i~0); 2887#L12-2 assume !(0 == main_~i~0); 2888#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2878#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2879#L12 assume !(10 == main_~i~0); 2882#L12-2 assume !(0 == main_~i~0); 2931#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2930#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2929#L12 assume !(10 == main_~i~0); 2928#L12-2 assume !(0 == main_~i~0); 2927#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2926#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2925#L12 assume !(10 == main_~i~0); 2924#L12-2 assume !(0 == main_~i~0); 2923#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2922#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2921#L12 assume !(10 == main_~i~0); 2920#L12-2 assume !(0 == main_~i~0); 2919#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2918#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2917#L12 assume !(10 == main_~i~0); 2915#L12-2 assume !(0 == main_~i~0); 2913#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2909#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2910#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2872#L12-2 [2019-11-28 02:59:04,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,486 INFO L82 PathProgramCache]: Analyzing trace with hash -60397820, now seen corresponding path program 6 times [2019-11-28 02:59:04,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:04,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800710393] [2019-11-28 02:59:04,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:04,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800710393] [2019-11-28 02:59:04,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146226910] [2019-11-28 02:59:04,549 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:04,582 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-28 02:59:04,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:04,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:04,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:04,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-28 02:59:04,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818330302] [2019-11-28 02:59:04,591 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:04,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,592 INFO L82 PathProgramCache]: Analyzing trace with hash -127593226, now seen corresponding path program 6 times [2019-11-28 02:59:04,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:04,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325697033] [2019-11-28 02:59:04,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,671 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:04,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325697033] [2019-11-28 02:59:04,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192674640] [2019-11-28 02:59:04,671 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:04,704 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-11-28 02:59:04,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:04,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:04,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:04,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-28 02:59:04,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974626415] [2019-11-28 02:59:04,714 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:04,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:04,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:59:04,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:59:04,715 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. cyclomatic complexity: 11 Second operand 10 states. [2019-11-28 02:59:04,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:04,799 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-11-28 02:59:04,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:59:04,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 97 transitions. [2019-11-28 02:59:04,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2019-11-28 02:59:04,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 88 states and 96 transitions. [2019-11-28 02:59:04,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-11-28 02:59:04,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-28 02:59:04,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 96 transitions. [2019-11-28 02:59:04,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:04,802 INFO L688 BuchiCegarLoop]: Abstraction has 88 states and 96 transitions. [2019-11-28 02:59:04,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 96 transitions. [2019-11-28 02:59:04,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2019-11-28 02:59:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 02:59:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2019-11-28 02:59:04,805 INFO L711 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2019-11-28 02:59:04,805 INFO L591 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2019-11-28 02:59:04,805 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-28 02:59:04,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 91 transitions. [2019-11-28 02:59:04,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2019-11-28 02:59:04,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:04,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:04,807 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 7, 1, 1, 1] [2019-11-28 02:59:04,807 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 8, 2, 1, 1] [2019-11-28 02:59:04,808 INFO L794 eck$LassoCheckResult]: Stem: 3256#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 3257#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3272#L12 assume !(10 == main_~i~0); 3273#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3287#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3285#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3263#L12 assume !(10 == main_~i~0); 3254#L12-2 assume !(0 == main_~i~0); 3255#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3260#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3261#L12 assume !(10 == main_~i~0); 3334#L12-2 assume !(0 == main_~i~0); 3333#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3332#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3331#L12 assume !(10 == main_~i~0); 3330#L12-2 assume !(0 == main_~i~0); 3329#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3328#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3327#L12 assume !(10 == main_~i~0); 3326#L12-2 assume !(0 == main_~i~0); 3325#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3324#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3323#L12 assume !(10 == main_~i~0); 3322#L12-2 assume !(0 == main_~i~0); 3321#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3320#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3319#L12 assume !(10 == main_~i~0); 3318#L12-2 assume !(0 == main_~i~0); 3317#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3316#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3291#L12 assume !(10 == main_~i~0); 3295#L12-2 assume !(0 == main_~i~0); 3293#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3290#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3286#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3252#L12-2 [2019-11-28 02:59:04,808 INFO L796 eck$LassoCheckResult]: Loop: 3252#L12-2 assume !(0 == main_~i~0); 3253#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3282#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3280#L12 assume !(10 == main_~i~0); 3271#L12-2 assume !(0 == main_~i~0); 3277#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3274#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3269#L12 assume !(10 == main_~i~0); 3266#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3264#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3265#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3315#L12 assume !(10 == main_~i~0); 3267#L12-2 assume !(0 == main_~i~0); 3268#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3258#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3259#L12 assume !(10 == main_~i~0); 3262#L12-2 assume !(0 == main_~i~0); 3314#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3313#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3312#L12 assume !(10 == main_~i~0); 3311#L12-2 assume !(0 == main_~i~0); 3310#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3309#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3308#L12 assume !(10 == main_~i~0); 3307#L12-2 assume !(0 == main_~i~0); 3306#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3305#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3304#L12 assume !(10 == main_~i~0); 3303#L12-2 assume !(0 == main_~i~0); 3302#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3301#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3300#L12 assume !(10 == main_~i~0); 3299#L12-2 assume !(0 == main_~i~0); 3298#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3297#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3296#L12 assume !(10 == main_~i~0); 3294#L12-2 assume !(0 == main_~i~0); 3292#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3288#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3289#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3252#L12-2 [2019-11-28 02:59:04,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,808 INFO L82 PathProgramCache]: Analyzing trace with hash 87645933, now seen corresponding path program 7 times [2019-11-28 02:59:04,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:04,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398496453] [2019-11-28 02:59:04,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:04,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398496453] [2019-11-28 02:59:04,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44023169] [2019-11-28 02:59:04,876 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:04,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:04,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-28 02:59:04,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472827974] [2019-11-28 02:59:04,917 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:04,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1701561311, now seen corresponding path program 7 times [2019-11-28 02:59:04,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:04,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849392926] [2019-11-28 02:59:04,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 105 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:04,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849392926] [2019-11-28 02:59:04,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021054368] [2019-11-28 02:59:04,987 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:05,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:59:05,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:05,036 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 105 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:05,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:05,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-28 02:59:05,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057650073] [2019-11-28 02:59:05,038 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:05,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:05,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:59:05,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:59:05,039 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. cyclomatic complexity: 11 Second operand 11 states. [2019-11-28 02:59:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:05,115 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2019-11-28 02:59:05,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:59:05,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 105 transitions. [2019-11-28 02:59:05,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-28 02:59:05,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 96 states and 104 transitions. [2019-11-28 02:59:05,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2019-11-28 02:59:05,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2019-11-28 02:59:05,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 104 transitions. [2019-11-28 02:59:05,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:05,119 INFO L688 BuchiCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-28 02:59:05,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 104 transitions. [2019-11-28 02:59:05,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-11-28 02:59:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-28 02:59:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2019-11-28 02:59:05,122 INFO L711 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2019-11-28 02:59:05,122 INFO L591 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2019-11-28 02:59:05,122 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-28 02:59:05,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 99 transitions. [2019-11-28 02:59:05,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2019-11-28 02:59:05,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:05,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:05,124 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 8, 1, 1, 1] [2019-11-28 02:59:05,124 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2019-11-28 02:59:05,125 INFO L794 eck$LassoCheckResult]: Stem: 3678#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 3679#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3693#L12 assume !(10 == main_~i~0); 3694#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3708#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3706#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3685#L12 assume !(10 == main_~i~0); 3676#L12-2 assume !(0 == main_~i~0); 3677#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3682#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3683#L12 assume !(10 == main_~i~0); 3764#L12-2 assume !(0 == main_~i~0); 3763#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3761#L12 assume !(10 == main_~i~0); 3760#L12-2 assume !(0 == main_~i~0); 3759#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3758#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3757#L12 assume !(10 == main_~i~0); 3756#L12-2 assume !(0 == main_~i~0); 3755#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3754#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3753#L12 assume !(10 == main_~i~0); 3752#L12-2 assume !(0 == main_~i~0); 3751#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3750#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3749#L12 assume !(10 == main_~i~0); 3748#L12-2 assume !(0 == main_~i~0); 3747#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3746#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3745#L12 assume !(10 == main_~i~0); 3744#L12-2 assume !(0 == main_~i~0); 3743#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3742#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3710#L12 assume !(10 == main_~i~0); 3715#L12-2 assume !(0 == main_~i~0); 3713#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3707#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3674#L12-2 [2019-11-28 02:59:05,125 INFO L796 eck$LassoCheckResult]: Loop: 3674#L12-2 assume !(0 == main_~i~0); 3675#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3703#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3701#L12 assume !(10 == main_~i~0); 3692#L12-2 assume !(0 == main_~i~0); 3698#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3695#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3690#L12 assume !(10 == main_~i~0); 3688#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3689#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3680#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3681#L12 assume !(10 == main_~i~0); 3684#L12-2 assume !(0 == main_~i~0); 3686#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3687#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3741#L12 assume !(10 == main_~i~0); 3740#L12-2 assume !(0 == main_~i~0); 3739#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3738#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3737#L12 assume !(10 == main_~i~0); 3736#L12-2 assume !(0 == main_~i~0); 3735#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3734#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3733#L12 assume !(10 == main_~i~0); 3732#L12-2 assume !(0 == main_~i~0); 3731#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3730#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3729#L12 assume !(10 == main_~i~0); 3728#L12-2 assume !(0 == main_~i~0); 3727#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3726#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3725#L12 assume !(10 == main_~i~0); 3724#L12-2 assume !(0 == main_~i~0); 3723#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3722#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3721#L12 assume !(10 == main_~i~0); 3720#L12-2 assume !(0 == main_~i~0); 3719#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3718#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3717#L12 assume !(10 == main_~i~0); 3716#L12-2 assume !(0 == main_~i~0); 3714#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3711#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3712#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3674#L12-2 [2019-11-28 02:59:05,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:05,126 INFO L82 PathProgramCache]: Analyzing trace with hash -91473322, now seen corresponding path program 8 times [2019-11-28 02:59:05,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:05,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4247458] [2019-11-28 02:59:05,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:05,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4247458] [2019-11-28 02:59:05,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311828329] [2019-11-28 02:59:05,230 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:05,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:59:05,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:05,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:59:05,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:05,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:05,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-11-28 02:59:05,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147142529] [2019-11-28 02:59:05,271 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:05,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:05,272 INFO L82 PathProgramCache]: Analyzing trace with hash -2143365560, now seen corresponding path program 8 times [2019-11-28 02:59:05,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:05,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707950484] [2019-11-28 02:59:05,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 136 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:05,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707950484] [2019-11-28 02:59:05,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164335587] [2019-11-28 02:59:05,353 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:05,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:59:05,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:05,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:59:05,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:05,390 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 136 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:05,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:05,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-11-28 02:59:05,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054732615] [2019-11-28 02:59:05,391 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:05,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:05,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:59:05,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:59:05,392 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. cyclomatic complexity: 11 Second operand 12 states. [2019-11-28 02:59:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:05,462 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-28 02:59:05,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:59:05,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 113 transitions. [2019-11-28 02:59:05,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2019-11-28 02:59:05,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 104 states and 112 transitions. [2019-11-28 02:59:05,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2019-11-28 02:59:05,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2019-11-28 02:59:05,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 112 transitions. [2019-11-28 02:59:05,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:05,465 INFO L688 BuchiCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-11-28 02:59:05,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 112 transitions. [2019-11-28 02:59:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2019-11-28 02:59:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 02:59:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-11-28 02:59:05,468 INFO L711 BuchiCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-11-28 02:59:05,468 INFO L591 BuchiCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-11-28 02:59:05,468 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-28 02:59:05,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 107 transitions. [2019-11-28 02:59:05,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2019-11-28 02:59:05,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:05,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:05,472 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-28 02:59:05,472 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 10, 2, 1, 1] [2019-11-28 02:59:05,473 INFO L794 eck$LassoCheckResult]: Stem: 4142#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 4143#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4154#L12 assume !(10 == main_~i~0); 4155#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 4172#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4170#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4149#L12 assume !(10 == main_~i~0); 4140#L12-2 assume !(0 == main_~i~0); 4141#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4146#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4147#L12 assume !(10 == main_~i~0); 4236#L12-2 assume !(0 == main_~i~0); 4235#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4234#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4233#L12 assume !(10 == main_~i~0); 4232#L12-2 assume !(0 == main_~i~0); 4231#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4230#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4229#L12 assume !(10 == main_~i~0); 4228#L12-2 assume !(0 == main_~i~0); 4227#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4226#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4225#L12 assume !(10 == main_~i~0); 4224#L12-2 assume !(0 == main_~i~0); 4223#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4222#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4221#L12 assume !(10 == main_~i~0); 4220#L12-2 assume !(0 == main_~i~0); 4219#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4218#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4217#L12 assume !(10 == main_~i~0); 4216#L12-2 assume !(0 == main_~i~0); 4215#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4214#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4213#L12 assume !(10 == main_~i~0); 4212#L12-2 assume !(0 == main_~i~0); 4211#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4210#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4174#L12 assume !(10 == main_~i~0); 4179#L12-2 assume !(0 == main_~i~0); 4177#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4173#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4171#L12 assume 10 == main_~i~0;main_~up~0 := 0; 4138#L12-2 [2019-11-28 02:59:05,473 INFO L796 eck$LassoCheckResult]: Loop: 4138#L12-2 assume !(0 == main_~i~0); 4139#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4168#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4166#L12 assume !(10 == main_~i~0); 4158#L12-2 assume !(0 == main_~i~0); 4163#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4161#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4156#L12 assume !(10 == main_~i~0); 4152#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 4153#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4144#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4145#L12 assume !(10 == main_~i~0); 4148#L12-2 assume !(0 == main_~i~0); 4150#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4151#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4209#L12 assume !(10 == main_~i~0); 4208#L12-2 assume !(0 == main_~i~0); 4207#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4206#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4205#L12 assume !(10 == main_~i~0); 4204#L12-2 assume !(0 == main_~i~0); 4203#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4202#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4201#L12 assume !(10 == main_~i~0); 4200#L12-2 assume !(0 == main_~i~0); 4199#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4198#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4197#L12 assume !(10 == main_~i~0); 4196#L12-2 assume !(0 == main_~i~0); 4195#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4194#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4193#L12 assume !(10 == main_~i~0); 4192#L12-2 assume !(0 == main_~i~0); 4191#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4190#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4189#L12 assume !(10 == main_~i~0); 4188#L12-2 assume !(0 == main_~i~0); 4187#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4186#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4185#L12 assume !(10 == main_~i~0); 4184#L12-2 assume !(0 == main_~i~0); 4183#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4182#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4181#L12 assume !(10 == main_~i~0); 4180#L12-2 assume !(0 == main_~i~0); 4178#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4175#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4176#L12 assume 10 == main_~i~0;main_~up~0 := 0; 4138#L12-2 [2019-11-28 02:59:05,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:05,473 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 9 times [2019-11-28 02:59:05,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:05,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193592244] [2019-11-28 02:59:05,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:05,491 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:05,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:05,492 INFO L82 PathProgramCache]: Analyzing trace with hash -50295759, now seen corresponding path program 9 times [2019-11-28 02:59:05,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:05,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626715363] [2019-11-28 02:59:05,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:05,510 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:05,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:05,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1470164625, now seen corresponding path program 2 times [2019-11-28 02:59:05,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:05,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071721714] [2019-11-28 02:59:05,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 591 proven. 6 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:05,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071721714] [2019-11-28 02:59:05,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614469072] [2019-11-28 02:59:05,569 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:05,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:59:05,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:05,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:05,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 591 proven. 6 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:05,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:05,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-28 02:59:05,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252429339] [2019-11-28 02:59:05,870 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 57 [2019-11-28 02:59:05,895 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:05,896 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:05,896 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:05,896 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:05,896 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:05,896 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:05,897 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:05,897 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:05,897 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration17_Loop [2019-11-28 02:59:05,897 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:05,897 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:05,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:05,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:05,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:05,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:06,014 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:06,014 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:06,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:06,021 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:06,033 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:06,033 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:06,113 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:06,115 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:06,115 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:06,115 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:06,115 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:06,115 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:06,115 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:06,115 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:06,115 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:06,115 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration17_Loop [2019-11-28 02:59:06,115 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:06,116 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:06,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:06,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:06,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:06,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:06,230 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:06,230 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:06,242 INFO L120 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-11-28 02:59:06,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:06,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:06,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:06,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:06,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:06,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:06,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:06,247 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:06,250 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:06,250 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:06,254 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:06,254 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:06,254 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:06,254 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 6 Supporting invariants [] [2019-11-28 02:59:06,257 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:06,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:06,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:06,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:06,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:59:06,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-28 02:59:06,337 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 02:59:06,337 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 107 transitions. cyclomatic complexity: 11 Second operand 6 states. [2019-11-28 02:59:06,474 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 107 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 367 states and 394 transitions. Complement of second has 15 states. [2019-11-28 02:59:06,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 02:59:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2019-11-28 02:59:06,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 43 letters. Loop has 48 letters. [2019-11-28 02:59:06,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:06,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 91 letters. Loop has 48 letters. [2019-11-28 02:59:06,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:06,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 43 letters. Loop has 96 letters. [2019-11-28 02:59:06,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:06,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 367 states and 394 transitions. [2019-11-28 02:59:06,485 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-11-28 02:59:06,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 367 states to 330 states and 354 transitions. [2019-11-28 02:59:06,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2019-11-28 02:59:06,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2019-11-28 02:59:06,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 330 states and 354 transitions. [2019-11-28 02:59:06,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:06,489 INFO L688 BuchiCegarLoop]: Abstraction has 330 states and 354 transitions. [2019-11-28 02:59:06,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states and 354 transitions. [2019-11-28 02:59:06,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 306. [2019-11-28 02:59:06,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-11-28 02:59:06,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 327 transitions. [2019-11-28 02:59:06,496 INFO L711 BuchiCegarLoop]: Abstraction has 306 states and 327 transitions. [2019-11-28 02:59:06,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:06,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:59:06,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:59:06,497 INFO L87 Difference]: Start difference. First operand 306 states and 327 transitions. Second operand 5 states. [2019-11-28 02:59:06,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:06,533 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2019-11-28 02:59:06,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:59:06,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 208 transitions. [2019-11-28 02:59:06,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2019-11-28 02:59:06,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 172 states and 189 transitions. [2019-11-28 02:59:06,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-11-28 02:59:06,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-28 02:59:06,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172 states and 189 transitions. [2019-11-28 02:59:06,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:06,539 INFO L688 BuchiCegarLoop]: Abstraction has 172 states and 189 transitions. [2019-11-28 02:59:06,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 189 transitions. [2019-11-28 02:59:06,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 107. [2019-11-28 02:59:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-28 02:59:06,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2019-11-28 02:59:06,543 INFO L711 BuchiCegarLoop]: Abstraction has 107 states and 117 transitions. [2019-11-28 02:59:06,543 INFO L591 BuchiCegarLoop]: Abstraction has 107 states and 117 transitions. [2019-11-28 02:59:06,543 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-11-28 02:59:06,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 117 transitions. [2019-11-28 02:59:06,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2019-11-28 02:59:06,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:06,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:06,546 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-28 02:59:06,546 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 10, 3, 1, 1] [2019-11-28 02:59:06,546 INFO L794 eck$LassoCheckResult]: Stem: 5692#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 5693#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5704#L12 assume !(10 == main_~i~0); 5702#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 5701#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5694#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5695#L12 assume !(10 == main_~i~0); 5792#L12-2 assume !(0 == main_~i~0); 5791#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5790#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5789#L12 assume !(10 == main_~i~0); 5788#L12-2 assume !(0 == main_~i~0); 5787#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5785#L12 assume !(10 == main_~i~0); 5784#L12-2 assume !(0 == main_~i~0); 5783#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5782#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5781#L12 assume !(10 == main_~i~0); 5780#L12-2 assume !(0 == main_~i~0); 5779#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5777#L12 assume !(10 == main_~i~0); 5776#L12-2 assume !(0 == main_~i~0); 5775#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5774#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5773#L12 assume !(10 == main_~i~0); 5772#L12-2 assume !(0 == main_~i~0); 5771#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5770#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5769#L12 assume !(10 == main_~i~0); 5768#L12-2 assume !(0 == main_~i~0); 5767#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5766#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5765#L12 assume !(10 == main_~i~0); 5764#L12-2 assume !(0 == main_~i~0); 5763#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5722#L12 assume !(10 == main_~i~0); 5760#L12-2 assume !(0 == main_~i~0); 5759#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5721#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5711#L12 assume 10 == main_~i~0;main_~up~0 := 0; 5688#L12-2 [2019-11-28 02:59:06,547 INFO L796 eck$LassoCheckResult]: Loop: 5688#L12-2 assume !(0 == main_~i~0); 5689#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5720#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5719#L12 assume !(10 == main_~i~0); 5718#L12-2 assume !(0 == main_~i~0); 5717#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5716#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5715#L12 assume !(10 == main_~i~0); 5708#L12-2 assume !(0 == main_~i~0); 5710#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5705#L12 assume !(10 == main_~i~0); 5707#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 5758#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5756#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5698#L12 assume !(10 == main_~i~0); 5699#L12-2 assume !(0 == main_~i~0); 5703#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5755#L12 assume !(10 == main_~i~0); 5754#L12-2 assume !(0 == main_~i~0); 5753#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5752#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5751#L12 assume !(10 == main_~i~0); 5750#L12-2 assume !(0 == main_~i~0); 5749#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5748#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5747#L12 assume !(10 == main_~i~0); 5746#L12-2 assume !(0 == main_~i~0); 5745#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5744#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5743#L12 assume !(10 == main_~i~0); 5742#L12-2 assume !(0 == main_~i~0); 5741#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5740#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5739#L12 assume !(10 == main_~i~0); 5738#L12-2 assume !(0 == main_~i~0); 5737#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5736#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5735#L12 assume !(10 == main_~i~0); 5734#L12-2 assume !(0 == main_~i~0); 5733#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5732#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5731#L12 assume !(10 == main_~i~0); 5730#L12-2 assume !(0 == main_~i~0); 5729#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5728#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5727#L12 assume !(10 == main_~i~0); 5726#L12-2 assume !(0 == main_~i~0); 5725#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5723#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5724#L12 assume 10 == main_~i~0;main_~up~0 := 0; 5688#L12-2 [2019-11-28 02:59:06,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:06,547 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 10 times [2019-11-28 02:59:06,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:06,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089682534] [2019-11-28 02:59:06,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:06,562 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:06,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:06,563 INFO L82 PathProgramCache]: Analyzing trace with hash -690818020, now seen corresponding path program 10 times [2019-11-28 02:59:06,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:06,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72170550] [2019-11-28 02:59:06,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:06,579 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:06,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:06,580 INFO L82 PathProgramCache]: Analyzing trace with hash -120542630, now seen corresponding path program 3 times [2019-11-28 02:59:06,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:06,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606685415] [2019-11-28 02:59:06,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:06,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 672 proven. 15 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:06,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606685415] [2019-11-28 02:59:06,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572739990] [2019-11-28 02:59:06,636 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:06,689 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-11-28 02:59:06,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:06,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:59:06,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:06,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 672 proven. 15 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:06,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:06,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 02:59:06,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880867252] [2019-11-28 02:59:06,982 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 52 [2019-11-28 02:59:06,994 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:06,994 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:06,994 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:06,994 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:06,994 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:06,995 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:06,995 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:06,995 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:06,995 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration18_Loop [2019-11-28 02:59:06,995 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:06,995 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:06,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:06,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:07,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:07,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:07,071 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:07,071 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:07,079 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:07,079 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:07,082 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:07,082 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:07,087 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:07,087 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:07,095 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:07,095 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:07,099 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:07,101 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:07,101 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:07,101 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:07,101 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:07,101 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:07,101 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:07,101 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:07,101 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:07,101 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration18_Loop [2019-11-28 02:59:07,102 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:07,102 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:07,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:07,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:07,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:07,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:07,180 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:07,181 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:07,190 INFO L120 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-11-28 02:59:07,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:07,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:07,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:07,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:07,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:07,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:07,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:07,195 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:07,198 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:07,198 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:07,202 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:07,202 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:07,203 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:07,203 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 13 Supporting invariants [] [2019-11-28 02:59:07,205 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:07,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:07,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:07,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:07,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:59:07,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-28 02:59:07,276 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-28 02:59:07,276 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 117 transitions. cyclomatic complexity: 13 Second operand 7 states. [2019-11-28 02:59:07,488 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 117 transitions. cyclomatic complexity: 13. Second operand 7 states. Result 431 states and 470 transitions. Complement of second has 19 states. [2019-11-28 02:59:07,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:59:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2019-11-28 02:59:07,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 52 letters. [2019-11-28 02:59:07,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:07,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 95 letters. Loop has 52 letters. [2019-11-28 02:59:07,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:07,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 104 letters. [2019-11-28 02:59:07,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:07,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 431 states and 470 transitions. [2019-11-28 02:59:07,498 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2019-11-28 02:59:07,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 431 states to 366 states and 398 transitions. [2019-11-28 02:59:07,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2019-11-28 02:59:07,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2019-11-28 02:59:07,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 398 transitions. [2019-11-28 02:59:07,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:07,502 INFO L688 BuchiCegarLoop]: Abstraction has 366 states and 398 transitions. [2019-11-28 02:59:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 398 transitions. [2019-11-28 02:59:07,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 314. [2019-11-28 02:59:07,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-28 02:59:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 337 transitions. [2019-11-28 02:59:07,513 INFO L711 BuchiCegarLoop]: Abstraction has 314 states and 337 transitions. [2019-11-28 02:59:07,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:07,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:59:07,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:59:07,514 INFO L87 Difference]: Start difference. First operand 314 states and 337 transitions. Second operand 6 states. [2019-11-28 02:59:07,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:07,553 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2019-11-28 02:59:07,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:59:07,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 215 states and 236 transitions. [2019-11-28 02:59:07,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-11-28 02:59:07,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 215 states to 188 states and 209 transitions. [2019-11-28 02:59:07,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-11-28 02:59:07,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-28 02:59:07,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 209 transitions. [2019-11-28 02:59:07,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:07,558 INFO L688 BuchiCegarLoop]: Abstraction has 188 states and 209 transitions. [2019-11-28 02:59:07,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 209 transitions. [2019-11-28 02:59:07,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 115. [2019-11-28 02:59:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-28 02:59:07,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2019-11-28 02:59:07,562 INFO L711 BuchiCegarLoop]: Abstraction has 115 states and 127 transitions. [2019-11-28 02:59:07,562 INFO L591 BuchiCegarLoop]: Abstraction has 115 states and 127 transitions. [2019-11-28 02:59:07,562 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-11-28 02:59:07,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 127 transitions. [2019-11-28 02:59:07,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2019-11-28 02:59:07,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:07,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:07,564 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-28 02:59:07,564 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 10, 4, 1, 1] [2019-11-28 02:59:07,565 INFO L794 eck$LassoCheckResult]: Stem: 7379#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 7380#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7395#L12 assume !(10 == main_~i~0); 7389#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 7388#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7381#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7382#L12 assume !(10 == main_~i~0); 7483#L12-2 assume !(0 == main_~i~0); 7482#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7481#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7480#L12 assume !(10 == main_~i~0); 7479#L12-2 assume !(0 == main_~i~0); 7478#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7477#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7476#L12 assume !(10 == main_~i~0); 7475#L12-2 assume !(0 == main_~i~0); 7474#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7473#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7472#L12 assume !(10 == main_~i~0); 7471#L12-2 assume !(0 == main_~i~0); 7470#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7469#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7468#L12 assume !(10 == main_~i~0); 7467#L12-2 assume !(0 == main_~i~0); 7466#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7465#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7464#L12 assume !(10 == main_~i~0); 7463#L12-2 assume !(0 == main_~i~0); 7462#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7461#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7460#L12 assume !(10 == main_~i~0); 7459#L12-2 assume !(0 == main_~i~0); 7458#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7457#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7456#L12 assume !(10 == main_~i~0); 7455#L12-2 assume !(0 == main_~i~0); 7454#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7453#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7413#L12 assume !(10 == main_~i~0); 7451#L12-2 assume !(0 == main_~i~0); 7450#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7412#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7398#L12 assume 10 == main_~i~0;main_~up~0 := 0; 7375#L12-2 [2019-11-28 02:59:07,565 INFO L796 eck$LassoCheckResult]: Loop: 7375#L12-2 assume !(0 == main_~i~0); 7376#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7411#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7410#L12 assume !(10 == main_~i~0); 7409#L12-2 assume !(0 == main_~i~0); 7408#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7407#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7406#L12 assume !(10 == main_~i~0); 7405#L12-2 assume !(0 == main_~i~0); 7404#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7403#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7402#L12 assume !(10 == main_~i~0); 7394#L12-2 assume !(0 == main_~i~0); 7397#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7396#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7391#L12 assume !(10 == main_~i~0); 7393#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 7449#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7447#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7385#L12 assume !(10 == main_~i~0); 7386#L12-2 assume !(0 == main_~i~0); 7390#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7448#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7446#L12 assume !(10 == main_~i~0); 7445#L12-2 assume !(0 == main_~i~0); 7444#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7443#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7442#L12 assume !(10 == main_~i~0); 7441#L12-2 assume !(0 == main_~i~0); 7440#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7439#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7438#L12 assume !(10 == main_~i~0); 7437#L12-2 assume !(0 == main_~i~0); 7436#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7435#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7434#L12 assume !(10 == main_~i~0); 7433#L12-2 assume !(0 == main_~i~0); 7432#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7431#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7430#L12 assume !(10 == main_~i~0); 7429#L12-2 assume !(0 == main_~i~0); 7428#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7427#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7426#L12 assume !(10 == main_~i~0); 7425#L12-2 assume !(0 == main_~i~0); 7424#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7423#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7422#L12 assume !(10 == main_~i~0); 7421#L12-2 assume !(0 == main_~i~0); 7420#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7419#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7418#L12 assume !(10 == main_~i~0); 7417#L12-2 assume !(0 == main_~i~0); 7416#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7414#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7415#L12 assume 10 == main_~i~0;main_~up~0 := 0; 7375#L12-2 [2019-11-28 02:59:07,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:07,566 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 11 times [2019-11-28 02:59:07,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:07,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725554045] [2019-11-28 02:59:07,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:07,577 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:07,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:07,578 INFO L82 PathProgramCache]: Analyzing trace with hash 805924487, now seen corresponding path program 11 times [2019-11-28 02:59:07,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:07,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072637079] [2019-11-28 02:59:07,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:07,592 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:07,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:07,592 INFO L82 PathProgramCache]: Analyzing trace with hash 329635269, now seen corresponding path program 4 times [2019-11-28 02:59:07,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:07,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971512699] [2019-11-28 02:59:07,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 753 proven. 28 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:07,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971512699] [2019-11-28 02:59:07,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51317550] [2019-11-28 02:59:07,651 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:07,695 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:59:07,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:07,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:59:07,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 753 proven. 28 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:07,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:07,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-28 02:59:07,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68106565] [2019-11-28 02:59:08,063 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 61 [2019-11-28 02:59:08,079 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:08,079 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:08,079 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:08,079 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:08,079 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:08,079 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,079 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:08,080 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:08,080 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration19_Loop [2019-11-28 02:59:08,080 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:08,080 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:08,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:08,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:08,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:08,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:08,170 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:08,170 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:08,175 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:08,175 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,179 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:08,180 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:08,187 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:08,187 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,192 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:08,192 INFO L440 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:08,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:08,199 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,204 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:08,204 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_15=0} Honda state: {v_rep~unnamed0~0~false_15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:08,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:08,212 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:08,223 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:08,223 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,234 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:08,236 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:08,236 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:08,236 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:08,236 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:08,237 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:08,237 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,237 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:08,237 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:08,237 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration19_Loop [2019-11-28 02:59:08,237 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:08,237 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:08,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:08,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:08,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:08,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:08,343 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:08,343 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,347 INFO L120 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-11-28 02:59:08,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:08,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:08,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:08,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:08,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:08,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:08,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,364 INFO L120 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-11-28 02:59:08,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:08,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:08,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:08,366 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 02:59:08,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:08,368 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 02:59:08,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:08,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,375 INFO L120 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-11-28 02:59:08,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:08,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:08,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:08,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:08,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:08,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:08,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:08,380 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:08,382 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:08,382 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,387 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:08,387 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:08,387 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:08,387 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 7 Supporting invariants [] [2019-11-28 02:59:08,389 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:08,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:08,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:08,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:08,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:08,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:08,485 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-28 02:59:08,486 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-28 02:59:08,486 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 115 states and 127 transitions. cyclomatic complexity: 15 Second operand 8 states. [2019-11-28 02:59:08,714 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 115 states and 127 transitions. cyclomatic complexity: 15. Second operand 8 states. Result 511 states and 566 transitions. Complement of second has 23 states. [2019-11-28 02:59:08,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:59:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2019-11-28 02:59:08,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 56 letters. [2019-11-28 02:59:08,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:08,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 99 letters. Loop has 56 letters. [2019-11-28 02:59:08,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:08,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 112 letters. [2019-11-28 02:59:08,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:08,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 566 transitions. [2019-11-28 02:59:08,726 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2019-11-28 02:59:08,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 410 states and 452 transitions. [2019-11-28 02:59:08,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2019-11-28 02:59:08,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2019-11-28 02:59:08,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 410 states and 452 transitions. [2019-11-28 02:59:08,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:08,730 INFO L688 BuchiCegarLoop]: Abstraction has 410 states and 452 transitions. [2019-11-28 02:59:08,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states and 452 transitions. [2019-11-28 02:59:08,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 322. [2019-11-28 02:59:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-28 02:59:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 347 transitions. [2019-11-28 02:59:08,736 INFO L711 BuchiCegarLoop]: Abstraction has 322 states and 347 transitions. [2019-11-28 02:59:08,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:08,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:59:08,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:59:08,737 INFO L87 Difference]: Start difference. First operand 322 states and 347 transitions. Second operand 7 states. [2019-11-28 02:59:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:08,797 INFO L93 Difference]: Finished difference Result 239 states and 264 transitions. [2019-11-28 02:59:08,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:59:08,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 239 states and 264 transitions. [2019-11-28 02:59:08,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-11-28 02:59:08,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 239 states to 204 states and 229 transitions. [2019-11-28 02:59:08,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-11-28 02:59:08,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-28 02:59:08,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 204 states and 229 transitions. [2019-11-28 02:59:08,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:08,806 INFO L688 BuchiCegarLoop]: Abstraction has 204 states and 229 transitions. [2019-11-28 02:59:08,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states and 229 transitions. [2019-11-28 02:59:08,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 123. [2019-11-28 02:59:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-28 02:59:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2019-11-28 02:59:08,809 INFO L711 BuchiCegarLoop]: Abstraction has 123 states and 137 transitions. [2019-11-28 02:59:08,809 INFO L591 BuchiCegarLoop]: Abstraction has 123 states and 137 transitions. [2019-11-28 02:59:08,809 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2019-11-28 02:59:08,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 137 transitions. [2019-11-28 02:59:08,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2019-11-28 02:59:08,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:08,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:08,811 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-28 02:59:08,812 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 10, 5, 1, 1] [2019-11-28 02:59:08,812 INFO L794 eck$LassoCheckResult]: Stem: 9219#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 9220#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9235#L12 assume !(10 == main_~i~0); 9229#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 9228#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9221#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9222#L12 assume !(10 == main_~i~0); 9327#L12-2 assume !(0 == main_~i~0); 9326#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9325#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9324#L12 assume !(10 == main_~i~0); 9323#L12-2 assume !(0 == main_~i~0); 9322#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9321#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9320#L12 assume !(10 == main_~i~0); 9319#L12-2 assume !(0 == main_~i~0); 9318#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9317#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9316#L12 assume !(10 == main_~i~0); 9315#L12-2 assume !(0 == main_~i~0); 9314#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9313#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9312#L12 assume !(10 == main_~i~0); 9311#L12-2 assume !(0 == main_~i~0); 9310#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9309#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9308#L12 assume !(10 == main_~i~0); 9307#L12-2 assume !(0 == main_~i~0); 9306#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9305#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9304#L12 assume !(10 == main_~i~0); 9303#L12-2 assume !(0 == main_~i~0); 9302#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9301#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9300#L12 assume !(10 == main_~i~0); 9299#L12-2 assume !(0 == main_~i~0); 9298#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9297#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9257#L12 assume !(10 == main_~i~0); 9295#L12-2 assume !(0 == main_~i~0); 9294#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9256#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9238#L12 assume 10 == main_~i~0;main_~up~0 := 0; 9215#L12-2 [2019-11-28 02:59:08,812 INFO L796 eck$LassoCheckResult]: Loop: 9215#L12-2 assume !(0 == main_~i~0); 9216#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9255#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9254#L12 assume !(10 == main_~i~0); 9253#L12-2 assume !(0 == main_~i~0); 9252#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9251#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9250#L12 assume !(10 == main_~i~0); 9249#L12-2 assume !(0 == main_~i~0); 9248#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9247#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9246#L12 assume !(10 == main_~i~0); 9245#L12-2 assume !(0 == main_~i~0); 9244#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9243#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9242#L12 assume !(10 == main_~i~0); 9234#L12-2 assume !(0 == main_~i~0); 9237#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9236#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9231#L12 assume !(10 == main_~i~0); 9233#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 9293#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9291#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9225#L12 assume !(10 == main_~i~0); 9226#L12-2 assume !(0 == main_~i~0); 9230#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9292#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9290#L12 assume !(10 == main_~i~0); 9289#L12-2 assume !(0 == main_~i~0); 9288#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9286#L12 assume !(10 == main_~i~0); 9285#L12-2 assume !(0 == main_~i~0); 9284#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9282#L12 assume !(10 == main_~i~0); 9281#L12-2 assume !(0 == main_~i~0); 9280#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9279#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9278#L12 assume !(10 == main_~i~0); 9277#L12-2 assume !(0 == main_~i~0); 9276#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9275#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9274#L12 assume !(10 == main_~i~0); 9273#L12-2 assume !(0 == main_~i~0); 9272#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9271#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9270#L12 assume !(10 == main_~i~0); 9269#L12-2 assume !(0 == main_~i~0); 9268#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9267#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9266#L12 assume !(10 == main_~i~0); 9265#L12-2 assume !(0 == main_~i~0); 9264#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9263#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9262#L12 assume !(10 == main_~i~0); 9261#L12-2 assume !(0 == main_~i~0); 9260#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9258#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9259#L12 assume 10 == main_~i~0;main_~up~0 := 0; 9215#L12-2 [2019-11-28 02:59:08,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:08,813 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 12 times [2019-11-28 02:59:08,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:08,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349326934] [2019-11-28 02:59:08,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:08,825 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:08,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:08,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1151943822, now seen corresponding path program 12 times [2019-11-28 02:59:08,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:08,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523153561] [2019-11-28 02:59:08,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:08,841 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:08,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:08,842 INFO L82 PathProgramCache]: Analyzing trace with hash 533812144, now seen corresponding path program 5 times [2019-11-28 02:59:08,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:08,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696620593] [2019-11-28 02:59:08,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 834 proven. 45 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:08,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696620593] [2019-11-28 02:59:08,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647502724] [2019-11-28 02:59:08,932 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:08,973 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-11-28 02:59:08,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:08,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:59:08,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 834 proven. 45 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:08,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:08,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-28 02:59:08,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353662290] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 02:59:09,358 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 62 [2019-11-28 02:59:09,371 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:09,371 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:09,372 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:09,372 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:09,372 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:09,372 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,372 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:09,372 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:09,372 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration20_Loop [2019-11-28 02:59:09,373 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:09,373 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:09,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:09,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:09,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-11-28 02:59:09,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:09,464 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:09,465 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:09,469 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:09,472 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:09,473 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,479 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:09,479 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:09,483 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:09,483 INFO L440 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:09,489 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:09,489 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,496 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:09,497 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_17=0} Honda state: {v_rep~unnamed0~0~false_17=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:09,503 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,512 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:09,513 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:09,522 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:09,524 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:09,524 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:09,524 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:09,524 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:09,524 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:09,524 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,524 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:09,524 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:09,525 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration20_Loop [2019-11-28 02:59:09,525 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:09,525 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:09,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-11-28 02:59:09,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:09,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:09,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:09,620 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:09,621 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,626 INFO L120 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-11-28 02:59:09,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:09,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:09,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:09,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:09,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:09,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:09,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,647 INFO L120 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-11-28 02:59:09,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:09,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:09,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:09,649 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 02:59:09,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:09,651 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 02:59:09,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:09,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:09,669 INFO L120 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-11-28 02:59:09,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:09,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:09,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:09,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:09,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:09,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:09,685 INFO L120 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-11-28 02:59:09,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:09,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:09,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:09,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:09,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:09,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:09,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,691 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:09,694 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:09,694 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,698 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:09,698 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:09,698 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:09,698 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 15 Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 02:59:09,700 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:09,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:09,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:09,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:09,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:59:09,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-28 02:59:09,811 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-28 02:59:09,811 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 123 states and 137 transitions. cyclomatic complexity: 17 Second operand 9 states. [2019-11-28 02:59:10,163 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 123 states and 137 transitions. cyclomatic complexity: 17. Second operand 9 states. Result 607 states and 682 transitions. Complement of second has 27 states. [2019-11-28 02:59:10,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 02:59:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2019-11-28 02:59:10,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 60 letters. [2019-11-28 02:59:10,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:10,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 103 letters. Loop has 60 letters. [2019-11-28 02:59:10,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:10,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 120 letters. [2019-11-28 02:59:10,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:10,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 607 states and 682 transitions. [2019-11-28 02:59:10,174 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2019-11-28 02:59:10,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 607 states to 462 states and 516 transitions. [2019-11-28 02:59:10,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2019-11-28 02:59:10,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2019-11-28 02:59:10,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 462 states and 516 transitions. [2019-11-28 02:59:10,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:10,177 INFO L688 BuchiCegarLoop]: Abstraction has 462 states and 516 transitions. [2019-11-28 02:59:10,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states and 516 transitions. [2019-11-28 02:59:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 330. [2019-11-28 02:59:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-11-28 02:59:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 357 transitions. [2019-11-28 02:59:10,183 INFO L711 BuchiCegarLoop]: Abstraction has 330 states and 357 transitions. [2019-11-28 02:59:10,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:10,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:59:10,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:59:10,184 INFO L87 Difference]: Start difference. First operand 330 states and 357 transitions. Second operand 8 states. [2019-11-28 02:59:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:10,251 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2019-11-28 02:59:10,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:59:10,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 292 transitions. [2019-11-28 02:59:10,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2019-11-28 02:59:10,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 220 states and 249 transitions. [2019-11-28 02:59:10,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-11-28 02:59:10,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-28 02:59:10,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 249 transitions. [2019-11-28 02:59:10,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:10,256 INFO L688 BuchiCegarLoop]: Abstraction has 220 states and 249 transitions. [2019-11-28 02:59:10,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 249 transitions. [2019-11-28 02:59:10,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 131. [2019-11-28 02:59:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-28 02:59:10,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2019-11-28 02:59:10,259 INFO L711 BuchiCegarLoop]: Abstraction has 131 states and 147 transitions. [2019-11-28 02:59:10,259 INFO L591 BuchiCegarLoop]: Abstraction has 131 states and 147 transitions. [2019-11-28 02:59:10,259 INFO L424 BuchiCegarLoop]: ======== Iteration 21============ [2019-11-28 02:59:10,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 147 transitions. [2019-11-28 02:59:10,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2019-11-28 02:59:10,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:10,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:10,261 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-28 02:59:10,261 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2019-11-28 02:59:10,262 INFO L794 eck$LassoCheckResult]: Stem: 11228#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 11229#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11240#L12 assume !(10 == main_~i~0); 11238#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 11237#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11230#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11231#L12 assume !(10 == main_~i~0); 11340#L12-2 assume !(0 == main_~i~0); 11339#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11338#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11337#L12 assume !(10 == main_~i~0); 11336#L12-2 assume !(0 == main_~i~0); 11335#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11334#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11333#L12 assume !(10 == main_~i~0); 11332#L12-2 assume !(0 == main_~i~0); 11331#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11330#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11329#L12 assume !(10 == main_~i~0); 11328#L12-2 assume !(0 == main_~i~0); 11327#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11326#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11325#L12 assume !(10 == main_~i~0); 11324#L12-2 assume !(0 == main_~i~0); 11323#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11322#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11321#L12 assume !(10 == main_~i~0); 11320#L12-2 assume !(0 == main_~i~0); 11319#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11318#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11317#L12 assume !(10 == main_~i~0); 11316#L12-2 assume !(0 == main_~i~0); 11315#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11314#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11313#L12 assume !(10 == main_~i~0); 11312#L12-2 assume !(0 == main_~i~0); 11311#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11310#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11270#L12 assume !(10 == main_~i~0); 11308#L12-2 assume !(0 == main_~i~0); 11307#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11269#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11247#L12 assume 10 == main_~i~0;main_~up~0 := 0; 11224#L12-2 [2019-11-28 02:59:10,262 INFO L796 eck$LassoCheckResult]: Loop: 11224#L12-2 assume !(0 == main_~i~0); 11225#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11268#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11267#L12 assume !(10 == main_~i~0); 11266#L12-2 assume !(0 == main_~i~0); 11265#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11264#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11263#L12 assume !(10 == main_~i~0); 11262#L12-2 assume !(0 == main_~i~0); 11261#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11260#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11259#L12 assume !(10 == main_~i~0); 11258#L12-2 assume !(0 == main_~i~0); 11257#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11256#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11255#L12 assume !(10 == main_~i~0); 11254#L12-2 assume !(0 == main_~i~0); 11253#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11252#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11251#L12 assume !(10 == main_~i~0); 11244#L12-2 assume !(0 == main_~i~0); 11246#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11245#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11241#L12 assume !(10 == main_~i~0); 11243#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 11306#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11304#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11234#L12 assume !(10 == main_~i~0); 11235#L12-2 assume !(0 == main_~i~0); 11239#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11305#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11303#L12 assume !(10 == main_~i~0); 11302#L12-2 assume !(0 == main_~i~0); 11301#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11300#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11299#L12 assume !(10 == main_~i~0); 11298#L12-2 assume !(0 == main_~i~0); 11297#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11296#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11295#L12 assume !(10 == main_~i~0); 11294#L12-2 assume !(0 == main_~i~0); 11293#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11292#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11291#L12 assume !(10 == main_~i~0); 11290#L12-2 assume !(0 == main_~i~0); 11289#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11288#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11287#L12 assume !(10 == main_~i~0); 11286#L12-2 assume !(0 == main_~i~0); 11285#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11284#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11283#L12 assume !(10 == main_~i~0); 11282#L12-2 assume !(0 == main_~i~0); 11281#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11280#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11279#L12 assume !(10 == main_~i~0); 11278#L12-2 assume !(0 == main_~i~0); 11277#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11276#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11275#L12 assume !(10 == main_~i~0); 11274#L12-2 assume !(0 == main_~i~0); 11273#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11271#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11272#L12 assume 10 == main_~i~0;main_~up~0 := 0; 11224#L12-2 [2019-11-28 02:59:10,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:10,262 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 13 times [2019-11-28 02:59:10,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:10,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690286350] [2019-11-28 02:59:10,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:10,274 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:10,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:10,274 INFO L82 PathProgramCache]: Analyzing trace with hash 336435933, now seen corresponding path program 13 times [2019-11-28 02:59:10,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:10,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083630340] [2019-11-28 02:59:10,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:10,287 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:10,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:10,287 INFO L82 PathProgramCache]: Analyzing trace with hash 216392731, now seen corresponding path program 6 times [2019-11-28 02:59:10,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:10,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19121894] [2019-11-28 02:59:10,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 915 proven. 66 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:10,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19121894] [2019-11-28 02:59:10,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133060473] [2019-11-28 02:59:10,351 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:10,406 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-11-28 02:59:10,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:10,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:10,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 915 proven. 66 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:10,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:10,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-28 02:59:10,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928616993] [2019-11-28 02:59:10,783 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 61 [2019-11-28 02:59:10,794 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:10,794 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:10,794 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:10,794 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:10,794 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:10,795 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:10,795 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:10,795 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:10,795 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration21_Loop [2019-11-28 02:59:10,795 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:10,795 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:10,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:10,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:10,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:10,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:10,880 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:10,880 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:10,885 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:10,885 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:10,888 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:10,888 INFO L440 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 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:10,894 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:10,894 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:10,905 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:10,905 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:10,909 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:10,910 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:10,910 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:10,910 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:10,910 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:10,910 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:10,910 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:10,911 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:10,911 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:10,911 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration21_Loop [2019-11-28 02:59:10,911 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:10,911 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:10,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:10,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:10,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:10,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:10,986 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:10,986 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:10,992 INFO L120 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-11-28 02:59:10,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:10,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:10,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:10,994 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 02:59:10,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:10,994 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 02:59:10,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:10,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:11,002 INFO L120 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-11-28 02:59:11,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:11,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:11,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:11,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:11,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:11,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:11,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:11,014 INFO L120 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-11-28 02:59:11,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:11,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:11,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:11,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:11,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:11,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:11,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:11,026 INFO L120 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-11-28 02:59:11,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:11,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:11,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:11,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:11,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:11,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:11,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:11,033 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:11,035 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:11,035 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 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 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:11,039 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:11,039 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:11,039 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:11,039 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 8 Supporting invariants [] [2019-11-28 02:59:11,041 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:11,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:11,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:11,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:11,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:59:11,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 309 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-28 02:59:11,161 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2019-11-28 02:59:11,161 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 147 transitions. cyclomatic complexity: 19 Second operand 10 states. [2019-11-28 02:59:11,509 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 147 transitions. cyclomatic complexity: 19. Second operand 10 states. Result 719 states and 818 transitions. Complement of second has 31 states. [2019-11-28 02:59:11,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 02:59:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2019-11-28 02:59:11,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 64 letters. [2019-11-28 02:59:11,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:11,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 107 letters. Loop has 64 letters. [2019-11-28 02:59:11,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:11,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 128 letters. [2019-11-28 02:59:11,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:11,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 719 states and 818 transitions. [2019-11-28 02:59:11,519 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2019-11-28 02:59:11,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 719 states to 522 states and 590 transitions. [2019-11-28 02:59:11,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-11-28 02:59:11,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2019-11-28 02:59:11,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 522 states and 590 transitions. [2019-11-28 02:59:11,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:11,523 INFO L688 BuchiCegarLoop]: Abstraction has 522 states and 590 transitions. [2019-11-28 02:59:11,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 590 transitions. [2019-11-28 02:59:11,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 338. [2019-11-28 02:59:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-11-28 02:59:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 367 transitions. [2019-11-28 02:59:11,530 INFO L711 BuchiCegarLoop]: Abstraction has 338 states and 367 transitions. [2019-11-28 02:59:11,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:11,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:59:11,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:59:11,531 INFO L87 Difference]: Start difference. First operand 338 states and 367 transitions. Second operand 9 states. [2019-11-28 02:59:11,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:11,611 INFO L93 Difference]: Finished difference Result 287 states and 320 transitions. [2019-11-28 02:59:11,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:59:11,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 287 states and 320 transitions. [2019-11-28 02:59:11,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2019-11-28 02:59:11,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 287 states to 236 states and 269 transitions. [2019-11-28 02:59:11,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-11-28 02:59:11,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-28 02:59:11,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 236 states and 269 transitions. [2019-11-28 02:59:11,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:11,622 INFO L688 BuchiCegarLoop]: Abstraction has 236 states and 269 transitions. [2019-11-28 02:59:11,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states and 269 transitions. [2019-11-28 02:59:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 139. [2019-11-28 02:59:11,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-28 02:59:11,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2019-11-28 02:59:11,627 INFO L711 BuchiCegarLoop]: Abstraction has 139 states and 157 transitions. [2019-11-28 02:59:11,627 INFO L591 BuchiCegarLoop]: Abstraction has 139 states and 157 transitions. [2019-11-28 02:59:11,627 INFO L424 BuchiCegarLoop]: ======== Iteration 22============ [2019-11-28 02:59:11,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 157 transitions. [2019-11-28 02:59:11,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2019-11-28 02:59:11,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:11,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:11,629 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-28 02:59:11,629 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 10, 7, 1, 1] [2019-11-28 02:59:11,630 INFO L794 eck$LassoCheckResult]: Stem: 13422#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 13423#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13434#L12 assume !(10 == main_~i~0); 13432#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 13431#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13424#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13425#L12 assume !(10 == main_~i~0); 13538#L12-2 assume !(0 == main_~i~0); 13537#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13536#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13535#L12 assume !(10 == main_~i~0); 13534#L12-2 assume !(0 == main_~i~0); 13533#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13532#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13531#L12 assume !(10 == main_~i~0); 13530#L12-2 assume !(0 == main_~i~0); 13529#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13528#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13527#L12 assume !(10 == main_~i~0); 13526#L12-2 assume !(0 == main_~i~0); 13525#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13524#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13523#L12 assume !(10 == main_~i~0); 13522#L12-2 assume !(0 == main_~i~0); 13521#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13520#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13519#L12 assume !(10 == main_~i~0); 13518#L12-2 assume !(0 == main_~i~0); 13517#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13516#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13515#L12 assume !(10 == main_~i~0); 13514#L12-2 assume !(0 == main_~i~0); 13513#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13512#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13511#L12 assume !(10 == main_~i~0); 13510#L12-2 assume !(0 == main_~i~0); 13509#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13508#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13468#L12 assume !(10 == main_~i~0); 13506#L12-2 assume !(0 == main_~i~0); 13505#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13467#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13441#L12 assume 10 == main_~i~0;main_~up~0 := 0; 13418#L12-2 [2019-11-28 02:59:11,630 INFO L796 eck$LassoCheckResult]: Loop: 13418#L12-2 assume !(0 == main_~i~0); 13419#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13466#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13465#L12 assume !(10 == main_~i~0); 13464#L12-2 assume !(0 == main_~i~0); 13463#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13462#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13461#L12 assume !(10 == main_~i~0); 13460#L12-2 assume !(0 == main_~i~0); 13459#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13458#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13457#L12 assume !(10 == main_~i~0); 13456#L12-2 assume !(0 == main_~i~0); 13455#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13454#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13453#L12 assume !(10 == main_~i~0); 13452#L12-2 assume !(0 == main_~i~0); 13451#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13450#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13449#L12 assume !(10 == main_~i~0); 13448#L12-2 assume !(0 == main_~i~0); 13447#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13446#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13445#L12 assume !(10 == main_~i~0); 13438#L12-2 assume !(0 == main_~i~0); 13440#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13439#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13435#L12 assume !(10 == main_~i~0); 13437#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 13504#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13502#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13428#L12 assume !(10 == main_~i~0); 13429#L12-2 assume !(0 == main_~i~0); 13433#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13503#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13501#L12 assume !(10 == main_~i~0); 13500#L12-2 assume !(0 == main_~i~0); 13499#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13498#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13497#L12 assume !(10 == main_~i~0); 13496#L12-2 assume !(0 == main_~i~0); 13495#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13494#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13493#L12 assume !(10 == main_~i~0); 13492#L12-2 assume !(0 == main_~i~0); 13491#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13490#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13489#L12 assume !(10 == main_~i~0); 13488#L12-2 assume !(0 == main_~i~0); 13487#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13486#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13485#L12 assume !(10 == main_~i~0); 13484#L12-2 assume !(0 == main_~i~0); 13483#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13482#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13481#L12 assume !(10 == main_~i~0); 13480#L12-2 assume !(0 == main_~i~0); 13479#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13478#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13477#L12 assume !(10 == main_~i~0); 13476#L12-2 assume !(0 == main_~i~0); 13475#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13474#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13473#L12 assume !(10 == main_~i~0); 13472#L12-2 assume !(0 == main_~i~0); 13471#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13469#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13470#L12 assume 10 == main_~i~0;main_~up~0 := 0; 13418#L12-2 [2019-11-28 02:59:11,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:11,631 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 14 times [2019-11-28 02:59:11,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:11,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720766651] [2019-11-28 02:59:11,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:11,645 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:11,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:11,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1847643336, now seen corresponding path program 14 times [2019-11-28 02:59:11,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:11,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250982659] [2019-11-28 02:59:11,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:11,673 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:11,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:11,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1125533446, now seen corresponding path program 7 times [2019-11-28 02:59:11,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:11,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838325432] [2019-11-28 02:59:11,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 996 proven. 91 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:11,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838325432] [2019-11-28 02:59:11,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888500487] [2019-11-28 02:59:11,822 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:11,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:59:11,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 996 proven. 91 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:11,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:11,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-28 02:59:11,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214993268] [2019-11-28 02:59:12,361 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 64 [2019-11-28 02:59:12,368 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:12,369 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:12,369 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:12,369 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:12,369 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:12,369 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:12,369 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:12,370 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:12,370 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration22_Loop [2019-11-28 02:59:12,370 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:12,370 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:12,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:12,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:12,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:12,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:12,444 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:12,445 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 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 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:12,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:12,449 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:12,452 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:12,452 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_21=0} Honda state: {v_rep~unnamed0~0~false_21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 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 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:12,459 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:12,460 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 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 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:12,467 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:12,467 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:12,470 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:12,472 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:12,472 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:12,472 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:12,472 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:12,473 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:12,473 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:12,473 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:12,473 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:12,473 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration22_Loop [2019-11-28 02:59:12,473 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:12,473 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:12,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:12,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:12,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:12,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:12,546 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:12,546 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 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 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:12,552 INFO L120 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-11-28 02:59:12,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:12,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:12,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:12,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:12,554 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:12,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:12,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 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 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:12,562 INFO L120 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-11-28 02:59:12,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:12,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:12,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:12,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:12,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:12,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:12,570 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 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 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:12,575 INFO L120 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-11-28 02:59:12,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:12,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:12,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:12,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:12,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:12,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:12,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:12,579 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:12,581 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:12,581 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 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 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:12,585 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:12,585 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:12,585 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:12,585 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 17 Supporting invariants [] [2019-11-28 02:59:12,587 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:12,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:12,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:12,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:12,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:59:12,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 373 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-28 02:59:12,707 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-11-28 02:59:12,707 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 139 states and 157 transitions. cyclomatic complexity: 21 Second operand 11 states. [2019-11-28 02:59:13,235 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 139 states and 157 transitions. cyclomatic complexity: 21. Second operand 11 states. Result 847 states and 974 transitions. Complement of second has 35 states. [2019-11-28 02:59:13,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 1 stem states 16 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 02:59:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2019-11-28 02:59:13,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 68 letters. [2019-11-28 02:59:13,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:13,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 111 letters. Loop has 68 letters. [2019-11-28 02:59:13,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:13,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 136 letters. [2019-11-28 02:59:13,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:13,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 847 states and 974 transitions. [2019-11-28 02:59:13,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 73 [2019-11-28 02:59:13,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 847 states to 590 states and 674 transitions. [2019-11-28 02:59:13,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2019-11-28 02:59:13,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2019-11-28 02:59:13,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 674 transitions. [2019-11-28 02:59:13,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:13,254 INFO L688 BuchiCegarLoop]: Abstraction has 590 states and 674 transitions. [2019-11-28 02:59:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 674 transitions. [2019-11-28 02:59:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 346. [2019-11-28 02:59:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-11-28 02:59:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 377 transitions. [2019-11-28 02:59:13,262 INFO L711 BuchiCegarLoop]: Abstraction has 346 states and 377 transitions. [2019-11-28 02:59:13,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:13,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:59:13,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:59:13,263 INFO L87 Difference]: Start difference. First operand 346 states and 377 transitions. Second operand 10 states. [2019-11-28 02:59:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:13,325 INFO L93 Difference]: Finished difference Result 311 states and 348 transitions. [2019-11-28 02:59:13,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:59:13,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 311 states and 348 transitions. [2019-11-28 02:59:13,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2019-11-28 02:59:13,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 311 states to 252 states and 289 transitions. [2019-11-28 02:59:13,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-11-28 02:59:13,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-28 02:59:13,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 252 states and 289 transitions. [2019-11-28 02:59:13,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:13,332 INFO L688 BuchiCegarLoop]: Abstraction has 252 states and 289 transitions. [2019-11-28 02:59:13,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states and 289 transitions. [2019-11-28 02:59:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 147. [2019-11-28 02:59:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-28 02:59:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 167 transitions. [2019-11-28 02:59:13,336 INFO L711 BuchiCegarLoop]: Abstraction has 147 states and 167 transitions. [2019-11-28 02:59:13,336 INFO L591 BuchiCegarLoop]: Abstraction has 147 states and 167 transitions. [2019-11-28 02:59:13,336 INFO L424 BuchiCegarLoop]: ======== Iteration 23============ [2019-11-28 02:59:13,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 167 transitions. [2019-11-28 02:59:13,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2019-11-28 02:59:13,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:13,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:13,338 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-28 02:59:13,338 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 10, 8, 1, 1] [2019-11-28 02:59:13,339 INFO L794 eck$LassoCheckResult]: Stem: 15817#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 15818#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15829#L12 assume !(10 == main_~i~0); 15827#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 15826#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15819#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15820#L12 assume !(10 == main_~i~0); 15937#L12-2 assume !(0 == main_~i~0); 15936#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15935#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15934#L12 assume !(10 == main_~i~0); 15933#L12-2 assume !(0 == main_~i~0); 15932#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15931#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15930#L12 assume !(10 == main_~i~0); 15929#L12-2 assume !(0 == main_~i~0); 15928#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15927#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15926#L12 assume !(10 == main_~i~0); 15925#L12-2 assume !(0 == main_~i~0); 15924#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15923#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15922#L12 assume !(10 == main_~i~0); 15921#L12-2 assume !(0 == main_~i~0); 15920#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15919#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15918#L12 assume !(10 == main_~i~0); 15917#L12-2 assume !(0 == main_~i~0); 15916#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15915#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15914#L12 assume !(10 == main_~i~0); 15913#L12-2 assume !(0 == main_~i~0); 15912#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15911#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15910#L12 assume !(10 == main_~i~0); 15909#L12-2 assume !(0 == main_~i~0); 15908#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15907#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15869#L12 assume !(10 == main_~i~0); 15905#L12-2 assume !(0 == main_~i~0); 15904#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15836#L12 assume 10 == main_~i~0;main_~up~0 := 0; 15813#L12-2 [2019-11-28 02:59:13,339 INFO L796 eck$LassoCheckResult]: Loop: 15813#L12-2 assume !(0 == main_~i~0); 15814#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15865#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15864#L12 assume !(10 == main_~i~0); 15863#L12-2 assume !(0 == main_~i~0); 15862#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15861#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15860#L12 assume !(10 == main_~i~0); 15859#L12-2 assume !(0 == main_~i~0); 15858#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15857#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15856#L12 assume !(10 == main_~i~0); 15855#L12-2 assume !(0 == main_~i~0); 15854#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15853#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15852#L12 assume !(10 == main_~i~0); 15851#L12-2 assume !(0 == main_~i~0); 15850#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15848#L12 assume !(10 == main_~i~0); 15847#L12-2 assume !(0 == main_~i~0); 15846#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15845#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15844#L12 assume !(10 == main_~i~0); 15843#L12-2 assume !(0 == main_~i~0); 15842#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15841#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15840#L12 assume !(10 == main_~i~0); 15833#L12-2 assume !(0 == main_~i~0); 15835#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15834#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15830#L12 assume !(10 == main_~i~0); 15832#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 15903#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15901#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15823#L12 assume !(10 == main_~i~0); 15824#L12-2 assume !(0 == main_~i~0); 15828#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15902#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15900#L12 assume !(10 == main_~i~0); 15899#L12-2 assume !(0 == main_~i~0); 15898#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15897#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15896#L12 assume !(10 == main_~i~0); 15895#L12-2 assume !(0 == main_~i~0); 15894#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15893#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15892#L12 assume !(10 == main_~i~0); 15891#L12-2 assume !(0 == main_~i~0); 15890#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15889#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15888#L12 assume !(10 == main_~i~0); 15887#L12-2 assume !(0 == main_~i~0); 15886#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15885#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15884#L12 assume !(10 == main_~i~0); 15883#L12-2 assume !(0 == main_~i~0); 15882#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15881#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15880#L12 assume !(10 == main_~i~0); 15879#L12-2 assume !(0 == main_~i~0); 15878#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15877#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15876#L12 assume !(10 == main_~i~0); 15875#L12-2 assume !(0 == main_~i~0); 15874#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15873#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15872#L12 assume !(10 == main_~i~0); 15871#L12-2 assume !(0 == main_~i~0); 15870#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15866#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15867#L12 assume 10 == main_~i~0;main_~up~0 := 0; 15813#L12-2 [2019-11-28 02:59:13,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:13,339 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 15 times [2019-11-28 02:59:13,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:13,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625404365] [2019-11-28 02:59:13,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:13,354 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:13,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:13,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1176703283, now seen corresponding path program 15 times [2019-11-28 02:59:13,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:13,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763428455] [2019-11-28 02:59:13,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:13,369 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:13,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:13,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1395997809, now seen corresponding path program 8 times [2019-11-28 02:59:13,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:13,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121581368] [2019-11-28 02:59:13,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 1077 proven. 120 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:13,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121581368] [2019-11-28 02:59:13,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135607386] [2019-11-28 02:59:13,458 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:13,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:59:13,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:13,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:59:13,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 1077 proven. 120 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:13,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:13,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-11-28 02:59:13,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378901358] [2019-11-28 02:59:13,980 WARN L192 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 69 [2019-11-28 02:59:13,995 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:13,995 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:13,995 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:13,995 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:13,996 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:13,996 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:13,996 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:13,996 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:13,996 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration23_Loop [2019-11-28 02:59:13,996 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:13,996 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:13,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:14,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:14,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:14,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:14,081 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:14,081 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 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 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:14,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:14,086 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:14,089 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:14,089 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_23=1} Honda state: {v_rep~unnamed0~0~true_23=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 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 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:14,095 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:14,095 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:14,099 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:14,099 INFO L440 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 110 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 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:14,105 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:14,105 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:14,109 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:14,109 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_23=0} Honda state: {v_rep~unnamed0~0~false_23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 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 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:14,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:14,116 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 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 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:14,124 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:14,124 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:14,132 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:14,134 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:14,134 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:14,134 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:14,134 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:14,134 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:14,134 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:14,134 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:14,134 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:14,134 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration23_Loop [2019-11-28 02:59:14,135 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:14,135 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:14,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:14,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:14,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:14,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:14,218 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:14,218 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 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 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:14,222 INFO L120 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-11-28 02:59:14,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:14,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:14,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:14,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:14,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:14,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:14,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 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 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:14,241 INFO L120 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-11-28 02:59:14,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:14,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:14,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:14,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:14,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:14,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:14,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:14,265 INFO L120 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-11-28 02:59:14,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:14,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:14,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:14,267 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 02:59:14,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:14,269 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 02:59:14,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:14,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 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 116 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:14,277 INFO L120 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-11-28 02:59:14,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:14,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:14,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:14,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:14,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:14,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:14,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:14,281 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:14,283 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:14,283 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 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 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:14,287 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:14,287 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:14,288 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:14,288 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2019-11-28 02:59:14,289 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:14,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:14,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:14,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:14,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 02:59:14,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-28 02:59:14,415 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2019-11-28 02:59:14,416 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 167 transitions. cyclomatic complexity: 23 Second operand 12 states. [2019-11-28 02:59:14,990 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 147 states and 167 transitions. cyclomatic complexity: 23. Second operand 12 states. Result 992 states and 1151 transitions. Complement of second has 39 states. [2019-11-28 02:59:14,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 18 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 02:59:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 89 transitions. [2019-11-28 02:59:14,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 72 letters. [2019-11-28 02:59:14,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:14,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 115 letters. Loop has 72 letters. [2019-11-28 02:59:14,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:14,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 144 letters. [2019-11-28 02:59:14,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:14,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 992 states and 1151 transitions. [2019-11-28 02:59:14,999 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 77 [2019-11-28 02:59:15,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 992 states to 667 states and 769 transitions. [2019-11-28 02:59:15,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2019-11-28 02:59:15,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2019-11-28 02:59:15,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 667 states and 769 transitions. [2019-11-28 02:59:15,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:15,005 INFO L688 BuchiCegarLoop]: Abstraction has 667 states and 769 transitions. [2019-11-28 02:59:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states and 769 transitions. [2019-11-28 02:59:15,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 354. [2019-11-28 02:59:15,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-11-28 02:59:15,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 387 transitions. [2019-11-28 02:59:15,013 INFO L711 BuchiCegarLoop]: Abstraction has 354 states and 387 transitions. [2019-11-28 02:59:15,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:15,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:59:15,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:59:15,014 INFO L87 Difference]: Start difference. First operand 354 states and 387 transitions. Second operand 11 states. [2019-11-28 02:59:15,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:15,092 INFO L93 Difference]: Finished difference Result 335 states and 376 transitions. [2019-11-28 02:59:15,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:59:15,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 335 states and 376 transitions. [2019-11-28 02:59:15,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2019-11-28 02:59:15,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 335 states to 268 states and 309 transitions. [2019-11-28 02:59:15,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-11-28 02:59:15,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-28 02:59:15,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 309 transitions. [2019-11-28 02:59:15,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:15,098 INFO L688 BuchiCegarLoop]: Abstraction has 268 states and 309 transitions. [2019-11-28 02:59:15,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states and 309 transitions. [2019-11-28 02:59:15,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 155. [2019-11-28 02:59:15,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-28 02:59:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2019-11-28 02:59:15,102 INFO L711 BuchiCegarLoop]: Abstraction has 155 states and 177 transitions. [2019-11-28 02:59:15,102 INFO L591 BuchiCegarLoop]: Abstraction has 155 states and 177 transitions. [2019-11-28 02:59:15,102 INFO L424 BuchiCegarLoop]: ======== Iteration 24============ [2019-11-28 02:59:15,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 177 transitions. [2019-11-28 02:59:15,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2019-11-28 02:59:15,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:15,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:15,105 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-28 02:59:15,105 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [19, 18, 18, 10, 9, 1, 1] [2019-11-28 02:59:15,105 INFO L794 eck$LassoCheckResult]: Stem: 18430#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 18431#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18442#L12 assume !(10 == main_~i~0); 18440#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 18439#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18432#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18433#L12 assume !(10 == main_~i~0); 18554#L12-2 assume !(0 == main_~i~0); 18553#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18552#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18551#L12 assume !(10 == main_~i~0); 18550#L12-2 assume !(0 == main_~i~0); 18549#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18548#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18547#L12 assume !(10 == main_~i~0); 18546#L12-2 assume !(0 == main_~i~0); 18545#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18544#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18543#L12 assume !(10 == main_~i~0); 18542#L12-2 assume !(0 == main_~i~0); 18541#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18540#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18539#L12 assume !(10 == main_~i~0); 18538#L12-2 assume !(0 == main_~i~0); 18537#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18536#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18535#L12 assume !(10 == main_~i~0); 18534#L12-2 assume !(0 == main_~i~0); 18533#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18532#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18531#L12 assume !(10 == main_~i~0); 18530#L12-2 assume !(0 == main_~i~0); 18529#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18528#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18527#L12 assume !(10 == main_~i~0); 18526#L12-2 assume !(0 == main_~i~0); 18525#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18524#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18484#L12 assume !(10 == main_~i~0); 18522#L12-2 assume !(0 == main_~i~0); 18521#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18483#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18449#L12 assume 10 == main_~i~0;main_~up~0 := 0; 18426#L12-2 [2019-11-28 02:59:15,106 INFO L796 eck$LassoCheckResult]: Loop: 18426#L12-2 assume !(0 == main_~i~0); 18427#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18482#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18481#L12 assume !(10 == main_~i~0); 18480#L12-2 assume !(0 == main_~i~0); 18479#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18478#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18477#L12 assume !(10 == main_~i~0); 18476#L12-2 assume !(0 == main_~i~0); 18475#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18474#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18473#L12 assume !(10 == main_~i~0); 18472#L12-2 assume !(0 == main_~i~0); 18471#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18470#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18469#L12 assume !(10 == main_~i~0); 18468#L12-2 assume !(0 == main_~i~0); 18467#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18466#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18465#L12 assume !(10 == main_~i~0); 18464#L12-2 assume !(0 == main_~i~0); 18463#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18462#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18461#L12 assume !(10 == main_~i~0); 18460#L12-2 assume !(0 == main_~i~0); 18459#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18458#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18457#L12 assume !(10 == main_~i~0); 18456#L12-2 assume !(0 == main_~i~0); 18455#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18454#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18453#L12 assume !(10 == main_~i~0); 18446#L12-2 assume !(0 == main_~i~0); 18448#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18447#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18443#L12 assume !(10 == main_~i~0); 18445#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 18520#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18518#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18436#L12 assume !(10 == main_~i~0); 18437#L12-2 assume !(0 == main_~i~0); 18441#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18519#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18517#L12 assume !(10 == main_~i~0); 18516#L12-2 assume !(0 == main_~i~0); 18515#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18514#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18513#L12 assume !(10 == main_~i~0); 18512#L12-2 assume !(0 == main_~i~0); 18511#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18510#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18509#L12 assume !(10 == main_~i~0); 18508#L12-2 assume !(0 == main_~i~0); 18507#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18506#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18505#L12 assume !(10 == main_~i~0); 18504#L12-2 assume !(0 == main_~i~0); 18503#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18502#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18501#L12 assume !(10 == main_~i~0); 18500#L12-2 assume !(0 == main_~i~0); 18499#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18498#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18497#L12 assume !(10 == main_~i~0); 18496#L12-2 assume !(0 == main_~i~0); 18495#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18494#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18493#L12 assume !(10 == main_~i~0); 18492#L12-2 assume !(0 == main_~i~0); 18491#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18490#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18489#L12 assume !(10 == main_~i~0); 18488#L12-2 assume !(0 == main_~i~0); 18487#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18485#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18486#L12 assume 10 == main_~i~0;main_~up~0 := 0; 18426#L12-2 [2019-11-28 02:59:15,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:15,106 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 16 times [2019-11-28 02:59:15,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:15,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945656824] [2019-11-28 02:59:15,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:15,118 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:15,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:15,119 INFO L82 PathProgramCache]: Analyzing trace with hash 289875998, now seen corresponding path program 16 times [2019-11-28 02:59:15,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:15,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788791626] [2019-11-28 02:59:15,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:15,135 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:15,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:15,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1498053540, now seen corresponding path program 9 times [2019-11-28 02:59:15,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:15,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301221632] [2019-11-28 02:59:15,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1158 proven. 153 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:15,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301221632] [2019-11-28 02:59:15,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502589177] [2019-11-28 02:59:15,248 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:15,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-11-28 02:59:15,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:15,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:59:15,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1158 proven. 153 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:15,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:15,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-11-28 02:59:15,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779653384] [2019-11-28 02:59:15,796 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 70 [2019-11-28 02:59:15,806 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:15,806 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:15,806 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:15,806 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:15,807 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:15,807 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,807 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:15,807 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:15,807 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration24_Loop [2019-11-28 02:59:15,807 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:15,807 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:15,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:15,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:15,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:15,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:15,870 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:15,871 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 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 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,875 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:15,875 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:15,878 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:15,878 INFO L440 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 120 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 120 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,883 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:15,883 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:15,886 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:15,886 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_25=1} Honda state: {v_rep~unnamed0~0~true_25=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 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 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:15,891 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:15,894 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:15,894 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_25=0} Honda state: {v_rep~unnamed0~0~false_25=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 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 122 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,898 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:15,898 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 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 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,905 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:15,905 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:15,909 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:15,910 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:15,910 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:15,910 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:15,911 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:15,911 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:15,911 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,911 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:15,911 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:15,911 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration24_Loop [2019-11-28 02:59:15,911 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:15,912 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:15,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:15,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:15,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:15,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:15,979 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:15,979 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 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 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,983 INFO L120 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-11-28 02:59:15,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:15,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:15,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:15,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:15,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:15,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:15,989 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 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 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,995 INFO L120 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-11-28 02:59:15,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:15,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:15,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:15,996 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 02:59:15,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:15,997 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 02:59:15,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:16,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 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 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:16,006 INFO L120 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-11-28 02:59:16,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:16,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:16,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:16,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:16,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:16,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:16,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 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 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:16,019 INFO L120 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-11-28 02:59:16,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:16,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:16,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:16,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:16,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:16,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:16,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:16,023 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:16,025 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:16,025 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 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 128 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:16,031 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:16,031 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:16,031 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:16,031 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2019-11-28 02:59:16,033 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:16,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:16,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:16,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:16,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 02:59:16,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-28 02:59:16,180 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2019-11-28 02:59:16,180 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 155 states and 177 transitions. cyclomatic complexity: 25 Second operand 13 states. [2019-11-28 02:59:16,911 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 155 states and 177 transitions. cyclomatic complexity: 25. Second operand 13 states. Result 1168 states and 1366 transitions. Complement of second has 43 states. [2019-11-28 02:59:16,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 1 stem states 20 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 02:59:16,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 98 transitions. [2019-11-28 02:59:16,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 98 transitions. Stem has 43 letters. Loop has 76 letters. [2019-11-28 02:59:16,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:16,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 98 transitions. Stem has 119 letters. Loop has 76 letters. [2019-11-28 02:59:16,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:16,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 98 transitions. Stem has 43 letters. Loop has 152 letters. [2019-11-28 02:59:16,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:16,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1168 states and 1366 transitions. [2019-11-28 02:59:16,924 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2019-11-28 02:59:16,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1168 states to 767 states and 892 transitions. [2019-11-28 02:59:16,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2019-11-28 02:59:16,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2019-11-28 02:59:16,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 767 states and 892 transitions. [2019-11-28 02:59:16,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:16,932 INFO L688 BuchiCegarLoop]: Abstraction has 767 states and 892 transitions. [2019-11-28 02:59:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states and 892 transitions. [2019-11-28 02:59:16,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 376. [2019-11-28 02:59:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-11-28 02:59:16,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 413 transitions. [2019-11-28 02:59:16,942 INFO L711 BuchiCegarLoop]: Abstraction has 376 states and 413 transitions. [2019-11-28 02:59:16,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:16,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:59:16,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:59:16,943 INFO L87 Difference]: Start difference. First operand 376 states and 413 transitions. Second operand 12 states. [2019-11-28 02:59:17,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:17,020 INFO L93 Difference]: Finished difference Result 359 states and 404 transitions. [2019-11-28 02:59:17,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:59:17,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 359 states and 404 transitions. [2019-11-28 02:59:17,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 83 [2019-11-28 02:59:17,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 359 states to 284 states and 329 transitions. [2019-11-28 02:59:17,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-11-28 02:59:17,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-28 02:59:17,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 284 states and 329 transitions. [2019-11-28 02:59:17,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:17,027 INFO L688 BuchiCegarLoop]: Abstraction has 284 states and 329 transitions. [2019-11-28 02:59:17,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states and 329 transitions. [2019-11-28 02:59:17,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 163. [2019-11-28 02:59:17,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-28 02:59:17,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 187 transitions. [2019-11-28 02:59:17,032 INFO L711 BuchiCegarLoop]: Abstraction has 163 states and 187 transitions. [2019-11-28 02:59:17,032 INFO L591 BuchiCegarLoop]: Abstraction has 163 states and 187 transitions. [2019-11-28 02:59:17,032 INFO L424 BuchiCegarLoop]: ======== Iteration 25============ [2019-11-28 02:59:17,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 187 transitions. [2019-11-28 02:59:17,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:17,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:17,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:17,034 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-28 02:59:17,035 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2019-11-28 02:59:17,035 INFO L794 eck$LassoCheckResult]: Stem: 21306#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 21307#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21318#L12 assume !(10 == main_~i~0); 21316#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 21315#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21308#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21309#L12 assume !(10 == main_~i~0); 21434#L12-2 assume !(0 == main_~i~0); 21433#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21432#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21431#L12 assume !(10 == main_~i~0); 21430#L12-2 assume !(0 == main_~i~0); 21429#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21428#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21427#L12 assume !(10 == main_~i~0); 21426#L12-2 assume !(0 == main_~i~0); 21425#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21424#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21423#L12 assume !(10 == main_~i~0); 21422#L12-2 assume !(0 == main_~i~0); 21421#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21420#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21419#L12 assume !(10 == main_~i~0); 21418#L12-2 assume !(0 == main_~i~0); 21417#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21416#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21415#L12 assume !(10 == main_~i~0); 21414#L12-2 assume !(0 == main_~i~0); 21413#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21412#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21411#L12 assume !(10 == main_~i~0); 21410#L12-2 assume !(0 == main_~i~0); 21409#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21408#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21407#L12 assume !(10 == main_~i~0); 21406#L12-2 assume !(0 == main_~i~0); 21405#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21404#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21366#L12 assume !(10 == main_~i~0); 21402#L12-2 assume !(0 == main_~i~0); 21401#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21365#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21325#L12 assume 10 == main_~i~0;main_~up~0 := 0; 21302#L12-2 [2019-11-28 02:59:17,035 INFO L796 eck$LassoCheckResult]: Loop: 21302#L12-2 assume !(0 == main_~i~0); 21303#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21362#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21361#L12 assume !(10 == main_~i~0); 21360#L12-2 assume !(0 == main_~i~0); 21359#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21358#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21357#L12 assume !(10 == main_~i~0); 21356#L12-2 assume !(0 == main_~i~0); 21355#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21354#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21353#L12 assume !(10 == main_~i~0); 21352#L12-2 assume !(0 == main_~i~0); 21351#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21350#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21349#L12 assume !(10 == main_~i~0); 21348#L12-2 assume !(0 == main_~i~0); 21347#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21346#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21345#L12 assume !(10 == main_~i~0); 21344#L12-2 assume !(0 == main_~i~0); 21343#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21342#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21341#L12 assume !(10 == main_~i~0); 21340#L12-2 assume !(0 == main_~i~0); 21339#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21338#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21337#L12 assume !(10 == main_~i~0); 21336#L12-2 assume !(0 == main_~i~0); 21335#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21334#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21333#L12 assume !(10 == main_~i~0); 21332#L12-2 assume !(0 == main_~i~0); 21331#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21330#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21329#L12 assume !(10 == main_~i~0); 21322#L12-2 assume !(0 == main_~i~0); 21324#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21323#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21319#L12 assume !(10 == main_~i~0); 21321#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 21400#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21398#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21312#L12 assume !(10 == main_~i~0); 21313#L12-2 assume !(0 == main_~i~0); 21317#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21399#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21397#L12 assume !(10 == main_~i~0); 21396#L12-2 assume !(0 == main_~i~0); 21395#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21394#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21393#L12 assume !(10 == main_~i~0); 21392#L12-2 assume !(0 == main_~i~0); 21391#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21390#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21389#L12 assume !(10 == main_~i~0); 21388#L12-2 assume !(0 == main_~i~0); 21387#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21386#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21385#L12 assume !(10 == main_~i~0); 21384#L12-2 assume !(0 == main_~i~0); 21383#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21382#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21381#L12 assume !(10 == main_~i~0); 21380#L12-2 assume !(0 == main_~i~0); 21379#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21378#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21377#L12 assume !(10 == main_~i~0); 21376#L12-2 assume !(0 == main_~i~0); 21375#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21373#L12 assume !(10 == main_~i~0); 21372#L12-2 assume !(0 == main_~i~0); 21371#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21370#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21369#L12 assume !(10 == main_~i~0); 21368#L12-2 assume !(0 == main_~i~0); 21367#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21363#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21364#L12 assume 10 == main_~i~0;main_~up~0 := 0; 21302#L12-2 [2019-11-28 02:59:17,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:17,036 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 17 times [2019-11-28 02:59:17,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:17,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467354940] [2019-11-28 02:59:17,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:17,049 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:17,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:17,050 INFO L82 PathProgramCache]: Analyzing trace with hash -312487543, now seen corresponding path program 17 times [2019-11-28 02:59:17,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:17,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416166289] [2019-11-28 02:59:17,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:17,068 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:17,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:17,069 INFO L82 PathProgramCache]: Analyzing trace with hash 799661767, now seen corresponding path program 10 times [2019-11-28 02:59:17,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:17,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885772828] [2019-11-28 02:59:17,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:17,099 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:17,687 WARN L192 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 78 [2019-11-28 02:59:17,923 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 47 [2019-11-28 02:59:17,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 02:59:17 BoogieIcfgContainer [2019-11-28 02:59:17,963 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 02:59:17,964 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:59:17,964 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:59:17,964 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:59:17,965 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:58:58" (3/4) ... [2019-11-28 02:59:17,968 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 02:59:18,031 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:59:18,032 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:59:18,033 INFO L168 Benchmark]: Toolchain (without parser) took 19652.16 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 508.6 MB). Free memory was 959.0 MB in the beginning and 1.5 GB in the end (delta: -497.9 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:18,033 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:59:18,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.10 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 946.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:18,034 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:18,035 INFO L168 Benchmark]: Boogie Preprocessor took 17.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:59:18,035 INFO L168 Benchmark]: RCFGBuilder took 217.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:18,036 INFO L168 Benchmark]: BuchiAutomizer took 18993.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 366.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -349.5 MB). Peak memory consumption was 660.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:18,036 INFO L168 Benchmark]: Witness Printer took 68.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:18,038 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 267.10 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 946.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 217.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18993.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 366.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -349.5 MB). Peak memory consumption was 660.2 MB. Max. memory is 11.5 GB. * Witness Printer took 68.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 35 terminating modules (22 trivial, 12 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function -2 * i + 1 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + 6 and consists of 8 locations. One deterministic module has affine ranking function -2 * i + 13 and consists of 10 locations. One deterministic module has affine ranking function -1 * i + 7 and consists of 12 locations. One deterministic module has affine ranking function -2 * i + 15 and consists of 14 locations. One deterministic module has affine ranking function -1 * i + 8 and consists of 16 locations. One deterministic module has affine ranking function -2 * i + 17 and consists of 18 locations. One deterministic module has affine ranking function -1 * i + 9 and consists of 20 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 22 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. 22 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 163 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.9s and 25 iterations. TraceHistogramMax:20. Analysis of lassos took 12.2s. Construction of modules took 2.0s. Büchi inclusion checks took 4.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 34. Automata minimization 0.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 2269 StatesRemovedByMinimization, 34 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 163 states and ocurred in iteration 24. Nontrivial modules had stage [12, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1368/3680 HoareTripleCheckerStatistics: 262 SDtfs, 787 SDslu, 9 SDs, 0 SdLazy, 2168 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT2 conc0 concLT9 SILN0 SILU0 SILI10 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax168 hnf100 lsp41 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq181 hnf93 smp84 dnf134 smp100 tf108 neg93 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 26 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 13 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 15]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {up=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@645406e4=0, \result=0, i=10} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 Loop: [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...