./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Ex08.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/Ex08.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 0f19c27ba74e1ebec32cb641e6640521812ace19 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:20,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:58:20,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:58:20,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:58:20,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:58:20,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:58:20,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:58:20,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:58:20,106 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:58:20,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:58:20,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:58:20,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:58:20,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:58:20,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:58:20,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:58:20,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:58:20,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:58:20,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:58:20,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:58:20,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:58:20,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:58:20,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:58:20,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:58:20,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:58:20,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:58:20,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:58:20,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:58:20,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:58:20,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:58:20,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:58:20,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:58:20,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:58:20,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:58:20,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:58:20,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:58:20,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:58:20,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:58:20,143 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:58:20,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:58:20,144 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:58:20,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:58:20,150 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:20,173 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:58:20,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:58:20,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:58:20,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:58:20,176 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:58:20,177 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 02:58:20,177 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 02:58:20,177 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 02:58:20,177 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 02:58:20,178 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 02:58:20,179 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 02:58:20,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:58:20,179 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:58:20,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:58:20,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:58:20,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 02:58:20,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 02:58:20,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 02:58:20,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:58:20,182 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 02:58:20,182 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:58:20,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 02:58:20,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:58:20,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:58:20,183 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 02:58:20,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:58:20,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:58:20,184 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 02:58:20,185 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 02:58:20,185 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 -> 0f19c27ba74e1ebec32cb641e6640521812ace19 [2019-11-28 02:58:20,478 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:58:20,498 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:58:20,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:58:20,503 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:58:20,504 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:58:20,505 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Ex08.c [2019-11-28 02:58:20,571 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a4d4b56c/9ef3b7c656b64d8186754fa0530f86bd/FLAG1f0a3fd2e [2019-11-28 02:58:20,992 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:58:20,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2019-11-28 02:58:20,999 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a4d4b56c/9ef3b7c656b64d8186754fa0530f86bd/FLAG1f0a3fd2e [2019-11-28 02:58:21,368 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a4d4b56c/9ef3b7c656b64d8186754fa0530f86bd [2019-11-28 02:58:21,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:58:21,375 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:58:21,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:58:21,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:58:21,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:58:21,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:58:21" (1/1) ... [2019-11-28 02:58:21,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60311b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:21, skipping insertion in model container [2019-11-28 02:58:21,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:58:21" (1/1) ... [2019-11-28 02:58:21,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:58:21,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:58:21,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:58:21,585 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:58:21,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:58:21,620 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:58:21,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:21 WrapperNode [2019-11-28 02:58:21,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:58:21,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:58:21,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:58:21,621 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:58:21,630 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:21" (1/1) ... [2019-11-28 02:58:21,635 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:21" (1/1) ... [2019-11-28 02:58:21,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:58:21,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:58:21,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:58:21,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:58:21,717 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:21" (1/1) ... [2019-11-28 02:58:21,717 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:21" (1/1) ... [2019-11-28 02:58:21,718 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:21" (1/1) ... [2019-11-28 02:58:21,718 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:21" (1/1) ... [2019-11-28 02:58:21,720 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:21" (1/1) ... [2019-11-28 02:58:21,723 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:21" (1/1) ... [2019-11-28 02:58:21,724 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:21" (1/1) ... [2019-11-28 02:58:21,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:58:21,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:58:21,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:58:21,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:58:21,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:21" (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:21,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:58:21,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:58:21,917 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:58:21,917 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 02:58:21,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:58:21 BoogieIcfgContainer [2019-11-28 02:58:21,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:58:21,919 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 02:58:21,919 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 02:58:21,922 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 02:58:21,923 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:58:21,923 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 02:58:21" (1/3) ... [2019-11-28 02:58:21,924 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59824a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:58:21, skipping insertion in model container [2019-11-28 02:58:21,924 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:58:21,924 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:21" (2/3) ... [2019-11-28 02:58:21,925 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59824a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:58:21, skipping insertion in model container [2019-11-28 02:58:21,925 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:58:21,925 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:58:21" (3/3) ... [2019-11-28 02:58:21,926 INFO L371 chiAutomizerObserver]: Analyzing ICFG Ex08.c [2019-11-28 02:58:21,974 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 02:58:21,974 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 02:58:21,974 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 02:58:21,975 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:58:21,975 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:58:21,975 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 02:58:21,975 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:58:21,975 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 02:58:21,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-11-28 02:58:22,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:58:22,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:22,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:22,022 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:58:22,022 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:58:22,022 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 02:58:22,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-11-28 02:58:22,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:58:22,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:22,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:22,025 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:58:22,025 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:58:22,034 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:22,035 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true assume !!(main_~i~0 > 0); 6#L12true assume 1 == main_~i~0;main_~up~0 := 1; 3#L12-2true assume 10 == main_~i~0;main_~up~0 := 0; 9#L15-1true assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5#L18-1true [2019-11-28 02:58:22,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:22,044 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 02:58:22,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:22,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851757562] [2019-11-28 02:58:22,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:22,161 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:22,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:22,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1234538, now seen corresponding path program 1 times [2019-11-28 02:58:22,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:22,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223403961] [2019-11-28 02:58:22,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:22,217 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:22,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223403961] [2019-11-28 02:58:22,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:58:22,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:58:22,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306432826] [2019-11-28 02:58:22,226 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:22,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:22,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:58:22,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:58:22,246 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-11-28 02:58:22,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:22,306 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2019-11-28 02:58:22,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:58:22,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 19 transitions. [2019-11-28 02:58:22,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 02:58:22,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 14 transitions. [2019-11-28 02:58:22,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 02:58:22,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 02:58:22,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. [2019-11-28 02:58:22,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:58:22,318 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-11-28 02:58:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. [2019-11-28 02:58:22,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-28 02:58:22,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 02:58:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-11-28 02:58:22,347 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-11-28 02:58:22,347 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-11-28 02:58:22,347 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 02:58:22,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2019-11-28 02:58:22,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 02:58:22,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:22,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:22,348 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:58:22,349 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:58:22,349 INFO L794 eck$LassoCheckResult]: Stem: 33#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; 34#L18-1 [2019-11-28 02:58:22,349 INFO L796 eck$LassoCheckResult]: Loop: 34#L18-1 assume !!(main_~i~0 > 0); 39#L12 assume !(1 == main_~i~0); 37#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 38#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 34#L18-1 [2019-11-28 02:58:22,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:22,350 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-28 02:58:22,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:22,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514004459] [2019-11-28 02:58:22,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:22,357 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:22,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:22,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1236460, now seen corresponding path program 1 times [2019-11-28 02:58:22,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:22,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282007610] [2019-11-28 02:58:22,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:22,374 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:22,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282007610] [2019-11-28 02:58:22,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:58:22,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:58:22,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443416638] [2019-11-28 02:58:22,376 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:22,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:22,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:58:22,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:58:22,376 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 02:58:22,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:22,387 INFO L93 Difference]: Finished difference Result 13 states and 20 transitions. [2019-11-28 02:58:22,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:58:22,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 20 transitions. [2019-11-28 02:58:22,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 02:58:22,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 20 transitions. [2019-11-28 02:58:22,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 02:58:22,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 02:58:22,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 20 transitions. [2019-11-28 02:58:22,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:58:22,391 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2019-11-28 02:58:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 20 transitions. [2019-11-28 02:58:22,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-28 02:58:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 02:58:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2019-11-28 02:58:22,394 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2019-11-28 02:58:22,394 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2019-11-28 02:58:22,395 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 02:58:22,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2019-11-28 02:58:22,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 02:58:22,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:22,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:22,396 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:58:22,396 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:58:22,396 INFO L794 eck$LassoCheckResult]: Stem: 61#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; 62#L18-1 [2019-11-28 02:58:22,397 INFO L796 eck$LassoCheckResult]: Loop: 62#L18-1 assume !!(main_~i~0 > 0); 71#L12 assume !(1 == main_~i~0); 70#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 66#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 62#L18-1 [2019-11-28 02:58:22,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:22,397 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-28 02:58:22,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:22,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286951011] [2019-11-28 02:58:22,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:22,404 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:22,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:22,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1236462, now seen corresponding path program 1 times [2019-11-28 02:58:22,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:22,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207013474] [2019-11-28 02:58:22,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:22,416 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:22,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:22,417 INFO L82 PathProgramCache]: Analyzing trace with hash 29865613, now seen corresponding path program 1 times [2019-11-28 02:58:22,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:22,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269759901] [2019-11-28 02:58:22,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:22,429 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:22,493 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:22,494 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:22,494 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:22,494 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:22,494 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:22,494 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:22,494 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:22,495 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:22,495 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2019-11-28 02:58:22,495 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:22,495 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:22,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:22,521 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:22,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:58:22,535 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:22,626 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:22,627 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:22,637 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:22,637 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:22,647 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:22,648 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:22,670 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:22,670 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:22,677 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:22,677 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:22,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:22,690 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:22,694 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:22,694 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) [2019-11-28 02:58:22,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:22,711 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:22,735 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:22,735 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:22,745 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:22,748 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:22,748 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:22,748 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:22,748 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:22,748 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:22,749 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:22,751 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:22,751 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:22,751 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2019-11-28 02:58:22,751 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:22,751 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:22,753 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:22,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:22,762 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:22,768 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:22,849 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:22,856 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:22,867 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:58:22,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:22,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:22,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:22,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:22,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:22,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:22,889 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:22,900 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:58:22,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:22,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:22,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:22,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:22,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:22,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:22,913 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:58:22,934 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:58:22,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:22,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:22,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:22,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:22,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:22,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:22,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:22,944 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:22,951 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:58:22,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:22,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:22,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:22,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:22,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:22,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:22,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:22,963 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:22,976 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:22,976 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:58:22,987 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:22,987 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:22,988 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:22,988 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 02:58:22,993 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:23,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:23,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:23,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:23,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:23,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:23,062 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:23,066 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:58:23,066 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-28 02:58:23,115 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 28 states and 43 transitions. Complement of second has 5 states. [2019-11-28 02:58:23,117 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:58:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:58:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-28 02:58:23,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-28 02:58:23,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:23,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 02:58:23,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:23,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 8 letters. [2019-11-28 02:58:23,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:23,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 43 transitions. [2019-11-28 02:58:23,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 02:58:23,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 40 transitions. [2019-11-28 02:58:23,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 02:58:23,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-28 02:58:23,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 40 transitions. [2019-11-28 02:58:23,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:23,132 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2019-11-28 02:58:23,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 40 transitions. [2019-11-28 02:58:23,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 02:58:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 02:58:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2019-11-28 02:58:23,141 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2019-11-28 02:58:23,141 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2019-11-28 02:58:23,142 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 02:58:23,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 40 transitions. [2019-11-28 02:58:23,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 02:58:23,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:23,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:23,147 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 02:58:23,147 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:58:23,148 INFO L794 eck$LassoCheckResult]: Stem: 140#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; 141#L18-1 assume !!(main_~i~0 > 0); 152#L12 assume 1 == main_~i~0;main_~up~0 := 1; 159#L12-2 assume !(10 == main_~i~0); 154#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 155#L18-1 [2019-11-28 02:58:23,148 INFO L796 eck$LassoCheckResult]: Loop: 155#L18-1 assume !!(main_~i~0 > 0); 161#L12 assume 1 == main_~i~0;main_~up~0 := 1; 136#L12-2 assume !(10 == main_~i~0); 137#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 155#L18-1 [2019-11-28 02:58:23,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:23,149 INFO L82 PathProgramCache]: Analyzing trace with hash 29863751, now seen corresponding path program 1 times [2019-11-28 02:58:23,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:23,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075622781] [2019-11-28 02:58:23,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:23,173 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:23,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:23,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1234600, now seen corresponding path program 1 times [2019-11-28 02:58:23,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:23,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485791951] [2019-11-28 02:58:23,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:23,193 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:23,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:23,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1816490734, now seen corresponding path program 2 times [2019-11-28 02:58:23,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:23,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60669628] [2019-11-28 02:58:23,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:23,259 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:58:23,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60669628] [2019-11-28 02:58:23,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:58:23,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:58:23,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658511651] [2019-11-28 02:58:23,284 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:23,285 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:23,285 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:23,285 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:23,285 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:23,285 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:23,285 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:23,285 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:23,285 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2019-11-28 02:58:23,286 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:23,286 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:23,287 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:23,295 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:23,299 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:23,309 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:23,380 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:23,381 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:58:23,387 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:23,388 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:58:23,393 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:23,393 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:58:23,412 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:23,412 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:58:23,418 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:23,418 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:58:23,431 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:23,431 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:58:23,437 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:23,437 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:58:23,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:23,457 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:58:23,481 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:23,482 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:23,490 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:23,493 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:23,493 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:23,493 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:23,494 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:23,494 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:23,494 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:23,494 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:23,494 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:23,494 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2019-11-28 02:58:23,494 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:23,495 INFO L274 LassoAnalysis]: Starting lasso preprocessing... Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:23,497 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:23,502 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:23,508 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:23,518 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:23,581 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:23,582 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:58:23,597 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:58:23,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:23,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:23,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:23,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:23,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:23,605 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:58:23,611 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) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:23,619 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:58:23,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:23,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:23,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:23,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:23,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:23,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:23,642 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:58:23,658 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:58:23,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:23,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:23,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:23,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:23,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:23,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:23,665 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:58:23,669 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:23,672 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:23,672 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:58:23,682 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:23,682 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:23,683 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:23,683 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 3 Supporting invariants [] Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:23,685 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:23,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:23,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:23,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:23,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:23,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:23,746 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:23,746 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:58:23,746 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 40 transitions. cyclomatic complexity: 17 Second operand 4 states. [2019-11-28 02:58:23,787 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 40 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 43 states and 64 transitions. Complement of second has 7 states. [2019-11-28 02:58:23,788 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:58:23,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:58:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-28 02:58:23,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 02:58:23,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:23,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-28 02:58:23,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:23,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-28 02:58:23,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:23,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 64 transitions. [2019-11-28 02:58:23,792 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-11-28 02:58:23,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 63 transitions. [2019-11-28 02:58:23,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-28 02:58:23,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-28 02:58:23,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 63 transitions. [2019-11-28 02:58:23,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:23,794 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 63 transitions. [2019-11-28 02:58:23,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 63 transitions. [2019-11-28 02:58:23,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-11-28 02:58:23,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 02:58:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2019-11-28 02:58:23,799 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 60 transitions. [2019-11-28 02:58:23,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:23,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:58:23,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:58:23,800 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. Second operand 4 states. [2019-11-28 02:58:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:23,825 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2019-11-28 02:58:23,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:58:23,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 64 transitions. [2019-11-28 02:58:23,827 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2019-11-28 02:58:23,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 41 states and 59 transitions. [2019-11-28 02:58:23,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 02:58:23,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-28 02:58:23,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 59 transitions. [2019-11-28 02:58:23,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:23,829 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 59 transitions. [2019-11-28 02:58:23,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 59 transitions. [2019-11-28 02:58:23,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2019-11-28 02:58:23,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 02:58:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2019-11-28 02:58:23,833 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2019-11-28 02:58:23,833 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2019-11-28 02:58:23,833 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 02:58:23,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2019-11-28 02:58:23,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 02:58:23,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:23,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:23,835 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 02:58:23,835 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:58:23,835 INFO L794 eck$LassoCheckResult]: Stem: 347#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; 348#L18-1 assume !!(main_~i~0 > 0); 352#L12 assume 1 == main_~i~0;main_~up~0 := 1; 343#L12-2 assume !(10 == main_~i~0); 344#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 363#L18-1 [2019-11-28 02:58:23,835 INFO L796 eck$LassoCheckResult]: Loop: 363#L18-1 assume !!(main_~i~0 > 0); 354#L12 assume !(1 == main_~i~0); 355#L12-2 assume !(10 == main_~i~0); 364#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 363#L18-1 [2019-11-28 02:58:23,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:23,836 INFO L82 PathProgramCache]: Analyzing trace with hash 29863751, now seen corresponding path program 3 times [2019-11-28 02:58:23,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:23,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439860834] [2019-11-28 02:58:23,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:23,845 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:23,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:23,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1236522, now seen corresponding path program 1 times [2019-11-28 02:58:23,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:23,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567389632] [2019-11-28 02:58:23,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:23,853 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:23,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:23,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1816492656, now seen corresponding path program 1 times [2019-11-28 02:58:23,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:23,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346749579] [2019-11-28 02:58:23,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:23,864 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:23,885 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:23,885 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:23,885 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:23,886 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:23,886 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:23,886 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:23,886 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:23,886 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:23,886 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2019-11-28 02:58:23,887 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:23,887 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:23,888 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:23,892 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:23,895 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:23,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:58:24,035 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:24,036 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:58:24,059 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:24,059 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:58:24,065 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:24,065 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:58:24,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:24,081 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:58:24,085 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:24,085 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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:24,106 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:24,107 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:24,111 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:24,111 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:58:24,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:24,122 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:58:24,132 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:24,132 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:58:24,157 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:24,157 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=15} Honda state: {ULTIMATE.start_main_~i~0=15} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0=1}, {ULTIMATE.start_main_~i~0=0}, {ULTIMATE.start_main_~i~0=0}] Lambdas: [1, 9, 11] Nus: [0, 0] [2019-11-28 02:58:24,204 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:24,204 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:24,204 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:24,205 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:24,205 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:24,205 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:24,205 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:24,205 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:24,205 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2019-11-28 02:58:24,205 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:24,205 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:24,209 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:24,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:24,215 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:24,217 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:24,220 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:24,231 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:24,356 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:24,358 INFO L404 LassoAnalysis]: Checking for nontermination... 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:58:24,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:24,371 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:24,375 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:24,375 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:24,415 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:24,415 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:24,422 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:24,422 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:24,434 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:24,434 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:24,438 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:24,438 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:24,445 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:24,445 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:24,449 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:24,449 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_6=0} Honda state: {v_rep~unnamed0~0~false_6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:24,455 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:24,456 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:24,471 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:24,471 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:58:24,483 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:24,485 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:24,485 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:24,485 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:24,485 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:24,485 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:24,485 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:24,486 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:24,486 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:24,486 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2019-11-28 02:58:24,486 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:24,486 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:24,488 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:24,491 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:24,493 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:24,495 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:24,507 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:24,515 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:24,621 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:24,621 INFO L489 LassoAnalysis]: Using template 'affine'. 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:58:24,634 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:58:24,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:24,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:24,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:24,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:24,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:24,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:24,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:24,639 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:24,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:58:24,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:24,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:24,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:24,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:24,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:24,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:24,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:24,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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:24,664 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:58:24,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:24,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:24,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:24,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:24,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:24,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:24,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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:24,686 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:58:24,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:24,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:24,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:24,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:24,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:24,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:24,697 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:24,706 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:58:24,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:24,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:24,709 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 02:58:24,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:24,726 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-28 02:58:24,726 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:24,748 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:24,777 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-28 02:58:24,777 INFO L444 ModelExtractionUtils]: 1 out of 11 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:24,784 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:24,791 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-11-28 02:58:24,792 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:24,792 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 21 Supporting invariants [-1*ULTIMATE.start_main_~i~0 + 10 >= 0] [2019-11-28 02:58:24,800 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-11-28 02:58:24,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:24,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:24,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:24,878 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:58:24,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:24,894 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:24,894 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 02:58:24,894 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 42 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-11-28 02:58:24,981 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 42 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 38 states and 55 transitions. Complement of second has 8 states. [2019-11-28 02:58:24,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 02:58:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:58:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-11-28 02:58:24,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 02:58:24,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:24,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-28 02:58:24,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:24,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-28 02:58:24,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:24,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 55 transitions. [2019-11-28 02:58:24,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 02:58:24,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 37 states and 54 transitions. [2019-11-28 02:58:24,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-28 02:58:24,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:58:24,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 54 transitions. [2019-11-28 02:58:24,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:24,988 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 54 transitions. [2019-11-28 02:58:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 54 transitions. [2019-11-28 02:58:24,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-11-28 02:58:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 02:58:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-11-28 02:58:24,991 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-11-28 02:58:24,991 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-11-28 02:58:24,991 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 02:58:24,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 53 transitions. [2019-11-28 02:58:24,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 02:58:24,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:24,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:24,993 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:24,993 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:58:24,993 INFO L794 eck$LassoCheckResult]: Stem: 476#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; 477#L18-1 assume !!(main_~i~0 > 0); 481#L12 assume 1 == main_~i~0;main_~up~0 := 1; 493#L12-2 assume !(10 == main_~i~0); 492#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 491#L18-1 assume !!(main_~i~0 > 0); 483#L12 assume !(1 == main_~i~0); 484#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 473#L15-1 [2019-11-28 02:58:24,993 INFO L796 eck$LassoCheckResult]: Loop: 473#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 478#L18-1 assume !!(main_~i~0 > 0); 479#L12 assume !(1 == main_~i~0); 472#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 473#L15-1 [2019-11-28 02:58:24,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:24,994 INFO L82 PathProgramCache]: Analyzing trace with hash 612785863, now seen corresponding path program 1 times [2019-11-28 02:58:24,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:24,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548844392] [2019-11-28 02:58:24,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:25,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548844392] [2019-11-28 02:58:25,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937531764] [2019-11-28 02:58:25,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 02:58:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:25,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:58:25,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:25,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:25,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-28 02:58:25,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825982492] [2019-11-28 02:58:25,056 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:25,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1737972, now seen corresponding path program 2 times [2019-11-28 02:58:25,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:25,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487721002] [2019-11-28 02:58:25,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:25,064 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:25,108 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:25,108 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:25,109 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:25,109 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:25,109 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:25,109 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:25,109 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:25,109 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:25,109 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2019-11-28 02:58:25,110 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:25,110 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:25,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:58:25,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:58:25,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:25,123 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:25,186 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:25,186 INFO L404 LassoAnalysis]: Checking for nontermination... 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:58:25,198 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:25,199 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:58:25,203 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:25,204 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:25,211 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:25,211 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:25,215 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:25,215 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_8=1} Honda state: {v_rep~unnamed0~0~true_8=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:58:25,223 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:25,223 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 41 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:25,236 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:25,236 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:25,329 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:25,330 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:25,331 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:25,331 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:25,331 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:25,331 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:25,331 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:25,331 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:25,331 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:25,331 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2019-11-28 02:58:25,332 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:25,332 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:25,333 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:25,343 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:25,346 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:25,349 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:25,413 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:25,414 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:25,427 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:58:25,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:25,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:25,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:25,429 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 02:58:25,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:25,432 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 02:58:25,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:25,435 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:25,454 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:58:25,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:25,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:25,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:25,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:25,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:25,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:25,470 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 Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:25,478 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:58:25,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:25,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:25,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:25,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:25,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:25,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:25,487 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:25,496 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:58:25,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:25,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:25,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:25,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:25,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:25,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:25,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:25,502 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:25,505 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 02:58:25,505 INFO L444 ModelExtractionUtils]: 1 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:25,510 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:25,510 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:25,510 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:25,510 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:58:25,513 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:25,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:25,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:25,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:25,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:25,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:25,579 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:25,579 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:58:25,580 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 53 transitions. cyclomatic complexity: 21 Second operand 4 states. [2019-11-28 02:58:25,615 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 53 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 91 states and 135 transitions. Complement of second has 7 states. [2019-11-28 02:58:25,616 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:58:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:58:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-28 02:58:25,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-28 02:58:25,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:25,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 4 letters. [2019-11-28 02:58:25,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:25,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 8 letters. [2019-11-28 02:58:25,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:25,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 135 transitions. [2019-11-28 02:58:25,621 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2019-11-28 02:58:25,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 115 transitions. [2019-11-28 02:58:25,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2019-11-28 02:58:25,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-11-28 02:58:25,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 115 transitions. [2019-11-28 02:58:25,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:25,623 INFO L688 BuchiCegarLoop]: Abstraction has 78 states and 115 transitions. [2019-11-28 02:58:25,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 115 transitions. [2019-11-28 02:58:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-11-28 02:58:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 02:58:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2019-11-28 02:58:25,629 INFO L711 BuchiCegarLoop]: Abstraction has 77 states and 114 transitions. [2019-11-28 02:58:25,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:25,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:58:25,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:58:25,630 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand 4 states. [2019-11-28 02:58:25,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:25,653 INFO L93 Difference]: Finished difference Result 105 states and 148 transitions. [2019-11-28 02:58:25,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:58:25,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 148 transitions. [2019-11-28 02:58:25,655 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2019-11-28 02:58:25,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 105 states and 148 transitions. [2019-11-28 02:58:25,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2019-11-28 02:58:25,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2019-11-28 02:58:25,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 148 transitions. [2019-11-28 02:58:25,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:25,658 INFO L688 BuchiCegarLoop]: Abstraction has 105 states and 148 transitions. [2019-11-28 02:58:25,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 148 transitions. [2019-11-28 02:58:25,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2019-11-28 02:58:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-28 02:58:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2019-11-28 02:58:25,664 INFO L711 BuchiCegarLoop]: Abstraction has 91 states and 130 transitions. [2019-11-28 02:58:25,664 INFO L591 BuchiCegarLoop]: Abstraction has 91 states and 130 transitions. [2019-11-28 02:58:25,664 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 02:58:25,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 130 transitions. [2019-11-28 02:58:25,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2019-11-28 02:58:25,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:25,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:25,666 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-28 02:58:25,666 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:58:25,666 INFO L794 eck$LassoCheckResult]: Stem: 867#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; 868#L18-1 assume !!(main_~i~0 > 0); 905#L12 assume 1 == main_~i~0;main_~up~0 := 1; 904#L12-2 assume !(10 == main_~i~0); 903#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 901#L18-1 assume !!(main_~i~0 > 0); 902#L12 assume !(1 == main_~i~0); 914#L12-2 assume !(10 == main_~i~0); 912#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 890#L18-1 [2019-11-28 02:58:25,666 INFO L796 eck$LassoCheckResult]: Loop: 890#L18-1 assume !!(main_~i~0 > 0); 908#L12 assume 1 == main_~i~0;main_~up~0 := 1; 899#L12-2 assume !(10 == main_~i~0); 897#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 890#L18-1 [2019-11-28 02:58:25,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:25,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1816492658, now seen corresponding path program 1 times [2019-11-28 02:58:25,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:25,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731686666] [2019-11-28 02:58:25,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:58:25,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731686666] [2019-11-28 02:58:25,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:58:25,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:58:25,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251381825] [2019-11-28 02:58:25,698 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:25,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:25,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1234602, now seen corresponding path program 1 times [2019-11-28 02:58:25,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:25,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205616537] [2019-11-28 02:58:25,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:25,725 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:25,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205616537] [2019-11-28 02:58:25,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:58:25,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:58:25,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944006785] [2019-11-28 02:58:25,726 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:25,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:25,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:58:25,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:58:25,727 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. cyclomatic complexity: 49 Second operand 3 states. [2019-11-28 02:58:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:25,742 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2019-11-28 02:58:25,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:58:25,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 77 transitions. [2019-11-28 02:58:25,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 02:58:25,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 51 states and 63 transitions. [2019-11-28 02:58:25,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-11-28 02:58:25,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-28 02:58:25,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2019-11-28 02:58:25,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:25,749 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2019-11-28 02:58:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2019-11-28 02:58:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-28 02:58:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 02:58:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2019-11-28 02:58:25,755 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-11-28 02:58:25,755 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-11-28 02:58:25,755 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 02:58:25,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 60 transitions. [2019-11-28 02:58:25,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-28 02:58:25,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:25,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:25,759 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2019-11-28 02:58:25,760 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2019-11-28 02:58:25,760 INFO L794 eck$LassoCheckResult]: Stem: 1030#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; 1031#L18-1 assume !!(main_~i~0 > 0); 1061#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1059#L12-2 assume !(10 == main_~i~0); 1057#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1055#L18-1 assume !!(main_~i~0 > 0); 1048#L12 assume !(1 == main_~i~0); 1051#L12-2 assume !(10 == main_~i~0); 1049#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1047#L18-1 assume !!(main_~i~0 > 0); 1046#L12 assume !(1 == main_~i~0); 1045#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1044#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1034#L18-1 assume !!(main_~i~0 > 0); 1035#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1026#L12-2 [2019-11-28 02:58:25,760 INFO L796 eck$LassoCheckResult]: Loop: 1026#L12-2 assume !(10 == main_~i~0); 1027#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1068#L18-1 assume !!(main_~i~0 > 0); 1036#L12 assume !(1 == main_~i~0); 1037#L12-2 assume !(10 == main_~i~0); 1073#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1032#L18-1 assume !!(main_~i~0 > 0); 1033#L12 assume !(1 == main_~i~0); 1072#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1040#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1041#L18-1 assume !!(main_~i~0 > 0); 1071#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1026#L12-2 [2019-11-28 02:58:25,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:25,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1399375584, now seen corresponding path program 1 times [2019-11-28 02:58:25,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:25,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678507109] [2019-11-28 02:58:25,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 02:58:25,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678507109] [2019-11-28 02:58:25,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:58:25,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:58:25,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438017062] [2019-11-28 02:58:25,791 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:25,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:25,792 INFO L82 PathProgramCache]: Analyzing trace with hash 388845694, now seen corresponding path program 1 times [2019-11-28 02:58:25,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:25,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399780443] [2019-11-28 02:58:25,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:25,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:58:25,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399780443] [2019-11-28 02:58:25,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:58:25,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:58:25,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146145838] [2019-11-28 02:58:25,811 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:25,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:25,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:58:25,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:58:25,812 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-11-28 02:58:25,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:25,835 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2019-11-28 02:58:25,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:58:25,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 79 transitions. [2019-11-28 02:58:25,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:25,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 63 states and 78 transitions. [2019-11-28 02:58:25,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-28 02:58:25,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-28 02:58:25,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 78 transitions. [2019-11-28 02:58:25,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:25,838 INFO L688 BuchiCegarLoop]: Abstraction has 63 states and 78 transitions. [2019-11-28 02:58:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 78 transitions. [2019-11-28 02:58:25,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2019-11-28 02:58:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 02:58:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2019-11-28 02:58:25,842 INFO L711 BuchiCegarLoop]: Abstraction has 56 states and 68 transitions. [2019-11-28 02:58:25,842 INFO L591 BuchiCegarLoop]: Abstraction has 56 states and 68 transitions. [2019-11-28 02:58:25,842 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 02:58:25,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 68 transitions. [2019-11-28 02:58:25,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-11-28 02:58:25,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:25,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:25,844 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 3, 3, 2, 2, 2, 1, 1] [2019-11-28 02:58:25,844 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1] [2019-11-28 02:58:25,845 INFO L794 eck$LassoCheckResult]: Stem: 1152#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; 1153#L18-1 assume !!(main_~i~0 > 0); 1182#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1180#L12-2 assume !(10 == main_~i~0); 1178#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1176#L18-1 assume !!(main_~i~0 > 0); 1169#L12 assume !(1 == main_~i~0); 1172#L12-2 assume !(10 == main_~i~0); 1170#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1168#L18-1 assume !!(main_~i~0 > 0); 1167#L12 assume !(1 == main_~i~0); 1166#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1160#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1161#L18-1 assume !!(main_~i~0 > 0); 1159#L12 assume !(1 == main_~i~0); 1149#L12-2 assume !(10 == main_~i~0); 1151#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1156#L18-1 assume !!(main_~i~0 > 0); 1157#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1191#L12-2 [2019-11-28 02:58:25,845 INFO L796 eck$LassoCheckResult]: Loop: 1191#L12-2 assume !(10 == main_~i~0); 1162#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1154#L18-1 assume !!(main_~i~0 > 0); 1155#L12 assume !(1 == main_~i~0); 1158#L12-2 assume !(10 == main_~i~0); 1197#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1200#L18-1 assume !!(main_~i~0 > 0); 1199#L12 assume !(1 == main_~i~0); 1196#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1148#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1163#L18-1 assume !!(main_~i~0 > 0); 1194#L12 assume !(1 == main_~i~0); 1195#L12-2 assume !(10 == main_~i~0); 1198#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1202#L18-1 assume !!(main_~i~0 > 0); 1201#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1191#L12-2 [2019-11-28 02:58:25,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:25,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1376811083, now seen corresponding path program 2 times [2019-11-28 02:58:25,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:25,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793694761] [2019-11-28 02:58:25,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:25,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793694761] [2019-11-28 02:58:25,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476159186] [2019-11-28 02:58:25,892 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 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:58:25,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:58:25,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:25,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:25,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 02:58:25,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:25,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-11-28 02:58:25,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551123352] [2019-11-28 02:58:25,922 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:25,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:25,922 INFO L82 PathProgramCache]: Analyzing trace with hash 656081641, now seen corresponding path program 2 times [2019-11-28 02:58:25,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:25,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669705941] [2019-11-28 02:58:25,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:25,971 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:58:25,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669705941] [2019-11-28 02:58:25,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739301129] [2019-11-28 02:58:25,972 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 02:58:26,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:58:26,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:26,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:26,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:26,018 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:58:26,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:26,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 02:58:26,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925622849] [2019-11-28 02:58:26,021 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:26,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:26,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:58:26,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:58:26,025 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-11-28 02:58:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:26,059 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2019-11-28 02:58:26,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:58:26,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 94 transitions. [2019-11-28 02:58:26,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2019-11-28 02:58:26,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 75 states and 93 transitions. [2019-11-28 02:58:26,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-11-28 02:58:26,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-11-28 02:58:26,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 93 transitions. [2019-11-28 02:58:26,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:26,067 INFO L688 BuchiCegarLoop]: Abstraction has 75 states and 93 transitions. [2019-11-28 02:58:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 93 transitions. [2019-11-28 02:58:26,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2019-11-28 02:58:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 02:58:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2019-11-28 02:58:26,071 INFO L711 BuchiCegarLoop]: Abstraction has 68 states and 83 transitions. [2019-11-28 02:58:26,071 INFO L591 BuchiCegarLoop]: Abstraction has 68 states and 83 transitions. [2019-11-28 02:58:26,071 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 02:58:26,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 83 transitions. [2019-11-28 02:58:26,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-11-28 02:58:26,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:26,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:26,075 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 4, 4, 3, 2, 2, 1, 1] [2019-11-28 02:58:26,075 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 2, 1, 1] [2019-11-28 02:58:26,075 INFO L794 eck$LassoCheckResult]: Stem: 1397#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; 1398#L18-1 assume !!(main_~i~0 > 0); 1422#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1421#L12-2 assume !(10 == main_~i~0); 1420#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1419#L18-1 assume !!(main_~i~0 > 0); 1416#L12 assume !(1 == main_~i~0); 1418#L12-2 assume !(10 == main_~i~0); 1417#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1415#L18-1 assume !!(main_~i~0 > 0); 1414#L12 assume !(1 == main_~i~0); 1413#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1406#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1407#L18-1 assume !!(main_~i~0 > 0); 1457#L12 assume !(1 == main_~i~0); 1456#L12-2 assume !(10 == main_~i~0); 1455#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1454#L18-1 assume !!(main_~i~0 > 0); 1453#L12 assume !(1 == main_~i~0); 1433#L12-2 assume !(10 == main_~i~0); 1439#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1438#L18-1 assume !!(main_~i~0 > 0); 1432#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1431#L12-2 [2019-11-28 02:58:26,075 INFO L796 eck$LassoCheckResult]: Loop: 1431#L12-2 assume !(10 == main_~i~0); 1443#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1440#L18-1 assume !!(main_~i~0 > 0); 1434#L12 assume !(1 == main_~i~0); 1435#L12-2 assume !(10 == main_~i~0); 1428#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1437#L18-1 assume !!(main_~i~0 > 0); 1430#L12 assume !(1 == main_~i~0); 1427#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1393#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1449#L18-1 assume !!(main_~i~0 > 0); 1450#L12 assume !(1 == main_~i~0); 1451#L12-2 assume !(10 == main_~i~0); 1410#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1411#L18-1 assume !!(main_~i~0 > 0); 1403#L12 assume !(1 == main_~i~0); 1404#L12-2 assume !(10 == main_~i~0); 1429#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1399#L18-1 assume !!(main_~i~0 > 0); 1400#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1431#L12-2 [2019-11-28 02:58:26,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:26,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1767603254, now seen corresponding path program 3 times [2019-11-28 02:58:26,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:26,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040040174] [2019-11-28 02:58:26,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:26,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040040174] [2019-11-28 02:58:26,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327147828] [2019-11-28 02:58:26,139 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 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:58:26,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-28 02:58:26,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:26,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:58:26,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 02:58:26,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:26,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2019-11-28 02:58:26,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474659397] [2019-11-28 02:58:26,212 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:26,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:26,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1254328276, now seen corresponding path program 3 times [2019-11-28 02:58:26,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:26,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068261289] [2019-11-28 02:58:26,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:26,242 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:58:26,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068261289] [2019-11-28 02:58:26,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148324439] [2019-11-28 02:58:26,243 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 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 [2019-11-28 02:58:26,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 02:58:26,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:26,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:58:26,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:26,287 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:58:26,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:26,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-28 02:58:26,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102671310] [2019-11-28 02:58:26,289 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:26,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:26,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:58:26,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:58:26,290 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. cyclomatic complexity: 21 Second operand 6 states. [2019-11-28 02:58:26,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:26,342 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2019-11-28 02:58:26,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:58:26,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 109 transitions. [2019-11-28 02:58:26,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2019-11-28 02:58:26,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 87 states and 108 transitions. [2019-11-28 02:58:26,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-11-28 02:58:26,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-11-28 02:58:26,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 108 transitions. [2019-11-28 02:58:26,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:26,345 INFO L688 BuchiCegarLoop]: Abstraction has 87 states and 108 transitions. [2019-11-28 02:58:26,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 108 transitions. [2019-11-28 02:58:26,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2019-11-28 02:58:26,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 02:58:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2019-11-28 02:58:26,350 INFO L711 BuchiCegarLoop]: Abstraction has 80 states and 98 transitions. [2019-11-28 02:58:26,350 INFO L591 BuchiCegarLoop]: Abstraction has 80 states and 98 transitions. [2019-11-28 02:58:26,350 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 02:58:26,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 98 transitions. [2019-11-28 02:58:26,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-11-28 02:58:26,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:26,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:26,352 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 2, 1, 1] [2019-11-28 02:58:26,352 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2019-11-28 02:58:26,353 INFO L794 eck$LassoCheckResult]: Stem: 1696#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; 1697#L18-1 assume !!(main_~i~0 > 0); 1720#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1719#L12-2 assume !(10 == main_~i~0); 1718#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1717#L18-1 assume !!(main_~i~0 > 0); 1714#L12 assume !(1 == main_~i~0); 1716#L12-2 assume !(10 == main_~i~0); 1715#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1713#L18-1 assume !!(main_~i~0 > 0); 1712#L12 assume !(1 == main_~i~0); 1711#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1704#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1705#L18-1 assume !!(main_~i~0 > 0); 1751#L12 assume !(1 == main_~i~0); 1750#L12-2 assume !(10 == main_~i~0); 1749#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1748#L18-1 assume !!(main_~i~0 > 0); 1747#L12 assume !(1 == main_~i~0); 1746#L12-2 assume !(10 == main_~i~0); 1745#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1744#L18-1 assume !!(main_~i~0 > 0); 1743#L12 assume !(1 == main_~i~0); 1728#L12-2 assume !(10 == main_~i~0); 1732#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1731#L18-1 assume !!(main_~i~0 > 0); 1727#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1709#L12-2 [2019-11-28 02:58:26,353 INFO L796 eck$LassoCheckResult]: Loop: 1709#L12-2 assume !(10 == main_~i~0); 1710#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1762#L18-1 assume !!(main_~i~0 > 0); 1729#L12 assume !(1 == main_~i~0); 1730#L12-2 assume !(10 == main_~i~0); 1741#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1738#L18-1 assume !!(main_~i~0 > 0); 1739#L12 assume !(1 == main_~i~0); 1759#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1692#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1708#L18-1 assume !!(main_~i~0 > 0); 1761#L12 assume !(1 == main_~i~0); 1760#L12-2 assume !(10 == main_~i~0); 1758#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1757#L18-1 assume !!(main_~i~0 > 0); 1756#L12 assume !(1 == main_~i~0); 1755#L12-2 assume !(10 == main_~i~0); 1754#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1753#L18-1 assume !!(main_~i~0 > 0); 1752#L12 assume !(1 == main_~i~0); 1726#L12-2 assume !(10 == main_~i~0); 1736#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1733#L18-1 assume !!(main_~i~0 > 0); 1725#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1709#L12-2 [2019-11-28 02:58:26,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:26,353 INFO L82 PathProgramCache]: Analyzing trace with hash 442274465, now seen corresponding path program 4 times [2019-11-28 02:58:26,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:26,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810687216] [2019-11-28 02:58:26,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:26,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810687216] [2019-11-28 02:58:26,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638869920] [2019-11-28 02:58:26,411 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 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:58:26,440 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:58:26,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:26,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:26,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:26,445 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-28 02:58:26,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:26,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 10 [2019-11-28 02:58:26,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613188239] [2019-11-28 02:58:26,446 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:26,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:26,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1418092737, now seen corresponding path program 4 times [2019-11-28 02:58:26,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:26,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790655239] [2019-11-28 02:58:26,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:26,489 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:58:26,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790655239] [2019-11-28 02:58:26,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793699201] [2019-11-28 02:58:26,490 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 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:58:26,510 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:58:26,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:26,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:58:26,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:26,517 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:58:26,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:26,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 02:58:26,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025695683] [2019-11-28 02:58:26,518 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:26,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:26,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:58:26,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:58:26,519 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. cyclomatic complexity: 24 Second operand 7 states. [2019-11-28 02:58:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:26,579 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2019-11-28 02:58:26,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:58:26,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 124 transitions. [2019-11-28 02:58:26,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-11-28 02:58:26,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 99 states and 123 transitions. [2019-11-28 02:58:26,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-11-28 02:58:26,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-11-28 02:58:26,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 123 transitions. [2019-11-28 02:58:26,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:26,582 INFO L688 BuchiCegarLoop]: Abstraction has 99 states and 123 transitions. [2019-11-28 02:58:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 123 transitions. [2019-11-28 02:58:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2019-11-28 02:58:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-28 02:58:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2019-11-28 02:58:26,586 INFO L711 BuchiCegarLoop]: Abstraction has 92 states and 113 transitions. [2019-11-28 02:58:26,586 INFO L591 BuchiCegarLoop]: Abstraction has 92 states and 113 transitions. [2019-11-28 02:58:26,587 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 02:58:26,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 113 transitions. [2019-11-28 02:58:26,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2019-11-28 02:58:26,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:26,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:26,589 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 6, 6, 5, 2, 2, 1, 1] [2019-11-28 02:58:26,589 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 5, 2, 1, 1] [2019-11-28 02:58:26,589 INFO L794 eck$LassoCheckResult]: Stem: 2041#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; 2042#L18-1 assume !!(main_~i~0 > 0); 2063#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2062#L12-2 assume !(10 == main_~i~0); 2061#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2060#L18-1 assume !!(main_~i~0 > 0); 2057#L12 assume !(1 == main_~i~0); 2059#L12-2 assume !(10 == main_~i~0); 2058#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2056#L18-1 assume !!(main_~i~0 > 0); 2055#L12 assume !(1 == main_~i~0); 2054#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2048#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2049#L18-1 assume !!(main_~i~0 > 0); 2098#L12 assume !(1 == main_~i~0); 2097#L12-2 assume !(10 == main_~i~0); 2096#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2095#L18-1 assume !!(main_~i~0 > 0); 2094#L12 assume !(1 == main_~i~0); 2093#L12-2 assume !(10 == main_~i~0); 2092#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2091#L18-1 assume !!(main_~i~0 > 0); 2090#L12 assume !(1 == main_~i~0); 2089#L12-2 assume !(10 == main_~i~0); 2088#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2087#L18-1 assume !!(main_~i~0 > 0); 2086#L12 assume !(1 == main_~i~0); 2072#L12-2 assume !(10 == main_~i~0); 2075#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2074#L18-1 assume !!(main_~i~0 > 0); 2071#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2069#L12-2 [2019-11-28 02:58:26,590 INFO L796 eck$LassoCheckResult]: Loop: 2069#L12-2 assume !(10 == main_~i~0); 2084#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2082#L18-1 assume !!(main_~i~0 > 0); 2073#L12 assume !(1 == main_~i~0); 2052#L12-2 assume !(10 == main_~i~0); 2053#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2115#L18-1 assume !!(main_~i~0 > 0); 2113#L12 assume !(1 == main_~i~0); 2111#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2037#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2051#L18-1 assume !!(main_~i~0 > 0); 2114#L12 assume !(1 == main_~i~0); 2112#L12-2 assume !(10 == main_~i~0); 2110#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2109#L18-1 assume !!(main_~i~0 > 0); 2108#L12 assume !(1 == main_~i~0); 2107#L12-2 assume !(10 == main_~i~0); 2106#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2105#L18-1 assume !!(main_~i~0 > 0); 2104#L12 assume !(1 == main_~i~0); 2103#L12-2 assume !(10 == main_~i~0); 2102#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2101#L18-1 assume !!(main_~i~0 > 0); 2100#L12 assume !(1 == main_~i~0); 2070#L12-2 assume !(10 == main_~i~0); 2080#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2076#L18-1 assume !!(main_~i~0 > 0); 2068#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2069#L12-2 [2019-11-28 02:58:26,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:26,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1631159412, now seen corresponding path program 5 times [2019-11-28 02:58:26,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:26,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590342464] [2019-11-28 02:58:26,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 14 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:26,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590342464] [2019-11-28 02:58:26,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535654398] [2019-11-28 02:58:26,663 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 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:58:26,699 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 02:58:26,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:26,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:26,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 56 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-28 02:58:26,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:26,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2019-11-28 02:58:26,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333504217] [2019-11-28 02:58:26,708 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:26,708 INFO L82 PathProgramCache]: Analyzing trace with hash 187697450, now seen corresponding path program 5 times [2019-11-28 02:58:26,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:26,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417409350] [2019-11-28 02:58:26,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:26,791 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:58:26,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417409350] [2019-11-28 02:58:26,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693569354] [2019-11-28 02:58:26,792 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 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:58:26,826 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-28 02:58:26,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:26,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:58:26,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:26,835 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:58:26,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:26,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-28 02:58:26,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800217246] [2019-11-28 02:58:26,839 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:26,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:26,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:58:26,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:58:26,841 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. cyclomatic complexity: 27 Second operand 8 states. [2019-11-28 02:58:26,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:26,919 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2019-11-28 02:58:26,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:58:26,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 139 transitions. [2019-11-28 02:58:26,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2019-11-28 02:58:26,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 111 states and 138 transitions. [2019-11-28 02:58:26,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2019-11-28 02:58:26,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2019-11-28 02:58:26,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 138 transitions. [2019-11-28 02:58:26,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:26,924 INFO L688 BuchiCegarLoop]: Abstraction has 111 states and 138 transitions. [2019-11-28 02:58:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 138 transitions. [2019-11-28 02:58:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2019-11-28 02:58:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 02:58:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2019-11-28 02:58:26,928 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 128 transitions. [2019-11-28 02:58:26,928 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 128 transitions. [2019-11-28 02:58:26,928 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 02:58:26,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 128 transitions. [2019-11-28 02:58:26,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2019-11-28 02:58:26,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:26,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:26,931 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 7, 7, 6, 2, 2, 1, 1] [2019-11-28 02:58:26,931 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 6, 2, 1, 1] [2019-11-28 02:58:26,931 INFO L794 eck$LassoCheckResult]: Stem: 2436#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; 2437#L18-1 assume !!(main_~i~0 > 0); 2460#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2459#L12-2 assume !(10 == main_~i~0); 2458#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2457#L18-1 assume !!(main_~i~0 > 0); 2454#L12 assume !(1 == main_~i~0); 2456#L12-2 assume !(10 == main_~i~0); 2455#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2453#L18-1 assume !!(main_~i~0 > 0); 2452#L12 assume !(1 == main_~i~0); 2451#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2445#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2446#L18-1 assume !!(main_~i~0 > 0); 2500#L12 assume !(1 == main_~i~0); 2499#L12-2 assume !(10 == main_~i~0); 2498#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2497#L18-1 assume !!(main_~i~0 > 0); 2496#L12 assume !(1 == main_~i~0); 2495#L12-2 assume !(10 == main_~i~0); 2494#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2493#L18-1 assume !!(main_~i~0 > 0); 2492#L12 assume !(1 == main_~i~0); 2491#L12-2 assume !(10 == main_~i~0); 2490#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2489#L18-1 assume !!(main_~i~0 > 0); 2488#L12 assume !(1 == main_~i~0); 2487#L12-2 assume !(10 == main_~i~0); 2486#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2485#L18-1 assume !!(main_~i~0 > 0); 2484#L12 assume !(1 == main_~i~0); 2468#L12-2 assume !(10 == main_~i~0); 2472#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2471#L18-1 assume !!(main_~i~0 > 0); 2467#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2449#L12-2 [2019-11-28 02:58:26,931 INFO L796 eck$LassoCheckResult]: Loop: 2449#L12-2 assume !(10 == main_~i~0); 2450#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2479#L18-1 assume !!(main_~i~0 > 0); 2469#L12 assume !(1 == main_~i~0); 2470#L12-2 assume !(10 == main_~i~0); 2481#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2482#L18-1 assume !!(main_~i~0 > 0); 2525#L12 assume !(1 == main_~i~0); 2523#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2432#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2448#L18-1 assume !!(main_~i~0 > 0); 2442#L12 assume !(1 == main_~i~0); 2443#L12-2 assume !(10 == main_~i~0); 2516#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2515#L18-1 assume !!(main_~i~0 > 0); 2514#L12 assume !(1 == main_~i~0); 2513#L12-2 assume !(10 == main_~i~0); 2512#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2511#L18-1 assume !!(main_~i~0 > 0); 2510#L12 assume !(1 == main_~i~0); 2509#L12-2 assume !(10 == main_~i~0); 2508#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2507#L18-1 assume !!(main_~i~0 > 0); 2506#L12 assume !(1 == main_~i~0); 2505#L12-2 assume !(10 == main_~i~0); 2504#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2503#L18-1 assume !!(main_~i~0 > 0); 2502#L12 assume !(1 == main_~i~0); 2466#L12-2 assume !(10 == main_~i~0); 2478#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2476#L18-1 assume !!(main_~i~0 > 0); 2465#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2449#L12-2 [2019-11-28 02:58:26,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:26,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1729366281, now seen corresponding path program 6 times [2019-11-28 02:58:26,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:26,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426436533] [2019-11-28 02:58:26,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:27,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426436533] [2019-11-28 02:58:27,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943247933] [2019-11-28 02:58:27,032 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 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:58:27,074 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-28 02:58:27,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:27,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:58:27,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 63 proven. 55 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 02:58:27,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:27,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2019-11-28 02:58:27,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7419002] [2019-11-28 02:58:27,215 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:27,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:27,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1954121109, now seen corresponding path program 6 times [2019-11-28 02:58:27,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:27,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294559198] [2019-11-28 02:58:27,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:27,264 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:58:27,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294559198] [2019-11-28 02:58:27,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368222630] [2019-11-28 02:58:27,265 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 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:58:27,299 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-28 02:58:27,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:27,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:58:27,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:27,306 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:58:27,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:27,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-28 02:58:27,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044816735] [2019-11-28 02:58:27,308 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:27,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:27,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:58:27,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:58:27,309 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. cyclomatic complexity: 30 Second operand 9 states. [2019-11-28 02:58:27,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:27,389 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2019-11-28 02:58:27,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:58:27,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 154 transitions. [2019-11-28 02:58:27,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2019-11-28 02:58:27,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 123 states and 153 transitions. [2019-11-28 02:58:27,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-11-28 02:58:27,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-11-28 02:58:27,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 153 transitions. [2019-11-28 02:58:27,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:27,392 INFO L688 BuchiCegarLoop]: Abstraction has 123 states and 153 transitions. [2019-11-28 02:58:27,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 153 transitions. [2019-11-28 02:58:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2019-11-28 02:58:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-28 02:58:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2019-11-28 02:58:27,394 INFO L711 BuchiCegarLoop]: Abstraction has 116 states and 143 transitions. [2019-11-28 02:58:27,394 INFO L591 BuchiCegarLoop]: Abstraction has 116 states and 143 transitions. [2019-11-28 02:58:27,394 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-28 02:58:27,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 143 transitions. [2019-11-28 02:58:27,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2019-11-28 02:58:27,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:27,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:27,401 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 8, 8, 7, 2, 2, 1, 1] [2019-11-28 02:58:27,401 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 7, 2, 1, 1] [2019-11-28 02:58:27,401 INFO L794 eck$LassoCheckResult]: Stem: 2888#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; 2889#L18-1 assume !!(main_~i~0 > 0); 2912#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2911#L12-2 assume !(10 == main_~i~0); 2910#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2909#L18-1 assume !!(main_~i~0 > 0); 2906#L12 assume !(1 == main_~i~0); 2908#L12-2 assume !(10 == main_~i~0); 2907#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2905#L18-1 assume !!(main_~i~0 > 0); 2904#L12 assume !(1 == main_~i~0); 2903#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2897#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2898#L18-1 assume !!(main_~i~0 > 0); 2956#L12 assume !(1 == main_~i~0); 2955#L12-2 assume !(10 == main_~i~0); 2954#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2953#L18-1 assume !!(main_~i~0 > 0); 2952#L12 assume !(1 == main_~i~0); 2951#L12-2 assume !(10 == main_~i~0); 2950#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2949#L18-1 assume !!(main_~i~0 > 0); 2948#L12 assume !(1 == main_~i~0); 2947#L12-2 assume !(10 == main_~i~0); 2946#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2945#L18-1 assume !!(main_~i~0 > 0); 2944#L12 assume !(1 == main_~i~0); 2943#L12-2 assume !(10 == main_~i~0); 2942#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2941#L18-1 assume !!(main_~i~0 > 0); 2940#L12 assume !(1 == main_~i~0); 2939#L12-2 assume !(10 == main_~i~0); 2938#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2937#L18-1 assume !!(main_~i~0 > 0); 2936#L12 assume !(1 == main_~i~0); 2920#L12-2 assume !(10 == main_~i~0); 2924#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2923#L18-1 assume !!(main_~i~0 > 0); 2919#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2901#L12-2 [2019-11-28 02:58:27,401 INFO L796 eck$LassoCheckResult]: Loop: 2901#L12-2 assume !(10 == main_~i~0); 2902#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2931#L18-1 assume !!(main_~i~0 > 0); 2921#L12 assume !(1 == main_~i~0); 2922#L12-2 assume !(10 == main_~i~0); 2933#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2934#L18-1 assume !!(main_~i~0 > 0); 2985#L12 assume !(1 == main_~i~0); 2983#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2884#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2900#L18-1 assume !!(main_~i~0 > 0); 2894#L12 assume !(1 == main_~i~0); 2895#L12-2 assume !(10 == main_~i~0); 2976#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2975#L18-1 assume !!(main_~i~0 > 0); 2974#L12 assume !(1 == main_~i~0); 2973#L12-2 assume !(10 == main_~i~0); 2972#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2971#L18-1 assume !!(main_~i~0 > 0); 2970#L12 assume !(1 == main_~i~0); 2969#L12-2 assume !(10 == main_~i~0); 2968#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2967#L18-1 assume !!(main_~i~0 > 0); 2966#L12 assume !(1 == main_~i~0); 2965#L12-2 assume !(10 == main_~i~0); 2964#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2963#L18-1 assume !!(main_~i~0 > 0); 2962#L12 assume !(1 == main_~i~0); 2961#L12-2 assume !(10 == main_~i~0); 2960#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2959#L18-1 assume !!(main_~i~0 > 0); 2958#L12 assume !(1 == main_~i~0); 2918#L12-2 assume !(10 == main_~i~0); 2930#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2928#L18-1 assume !!(main_~i~0 > 0); 2917#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2901#L12-2 [2019-11-28 02:58:27,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:27,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1010842398, now seen corresponding path program 7 times [2019-11-28 02:58:27,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:27,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107533142] [2019-11-28 02:58:27,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 18 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:27,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107533142] [2019-11-28 02:58:27,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970540399] [2019-11-28 02:58:27,491 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 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:58:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:27,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:27,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:27,520 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-11-28 02:58:27,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:27,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 13 [2019-11-28 02:58:27,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742115796] [2019-11-28 02:58:27,521 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:27,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:27,521 INFO L82 PathProgramCache]: Analyzing trace with hash -360131456, now seen corresponding path program 7 times [2019-11-28 02:58:27,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:27,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101206122] [2019-11-28 02:58:27,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:27,591 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:58:27,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101206122] [2019-11-28 02:58:27,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034813037] [2019-11-28 02:58:27,591 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:27,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:58:27,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:27,625 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:58:27,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:27,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-28 02:58:27,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988568401] [2019-11-28 02:58:27,626 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:27,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:27,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:58:27,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:58:27,627 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. cyclomatic complexity: 33 Second operand 10 states. [2019-11-28 02:58:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:27,699 INFO L93 Difference]: Finished difference Result 136 states and 169 transitions. [2019-11-28 02:58:27,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:58:27,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 169 transitions. [2019-11-28 02:58:27,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2019-11-28 02:58:27,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 135 states and 168 transitions. [2019-11-28 02:58:27,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2019-11-28 02:58:27,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2019-11-28 02:58:27,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 168 transitions. [2019-11-28 02:58:27,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:27,704 INFO L688 BuchiCegarLoop]: Abstraction has 135 states and 168 transitions. [2019-11-28 02:58:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 168 transitions. [2019-11-28 02:58:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2019-11-28 02:58:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-28 02:58:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2019-11-28 02:58:27,709 INFO L711 BuchiCegarLoop]: Abstraction has 128 states and 158 transitions. [2019-11-28 02:58:27,709 INFO L591 BuchiCegarLoop]: Abstraction has 128 states and 158 transitions. [2019-11-28 02:58:27,709 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-28 02:58:27,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 158 transitions. [2019-11-28 02:58:27,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2019-11-28 02:58:27,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:27,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:27,717 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 9, 9, 8, 2, 2, 1, 1] [2019-11-28 02:58:27,717 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 8, 2, 1, 1] [2019-11-28 02:58:27,717 INFO L794 eck$LassoCheckResult]: Stem: 3383#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; 3384#L18-1 assume !!(main_~i~0 > 0); 3405#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3404#L12-2 assume !(10 == main_~i~0); 3403#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3402#L18-1 assume !!(main_~i~0 > 0); 3399#L12 assume !(1 == main_~i~0); 3401#L12-2 assume !(10 == main_~i~0); 3400#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3398#L18-1 assume !!(main_~i~0 > 0); 3397#L12 assume !(1 == main_~i~0); 3396#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 3390#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3391#L18-1 assume !!(main_~i~0 > 0); 3452#L12 assume !(1 == main_~i~0); 3451#L12-2 assume !(10 == main_~i~0); 3450#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3449#L18-1 assume !!(main_~i~0 > 0); 3448#L12 assume !(1 == main_~i~0); 3447#L12-2 assume !(10 == main_~i~0); 3446#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3445#L18-1 assume !!(main_~i~0 > 0); 3444#L12 assume !(1 == main_~i~0); 3443#L12-2 assume !(10 == main_~i~0); 3442#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3441#L18-1 assume !!(main_~i~0 > 0); 3440#L12 assume !(1 == main_~i~0); 3439#L12-2 assume !(10 == main_~i~0); 3438#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3437#L18-1 assume !!(main_~i~0 > 0); 3436#L12 assume !(1 == main_~i~0); 3435#L12-2 assume !(10 == main_~i~0); 3434#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3433#L18-1 assume !!(main_~i~0 > 0); 3432#L12 assume !(1 == main_~i~0); 3431#L12-2 assume !(10 == main_~i~0); 3430#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3429#L18-1 assume !!(main_~i~0 > 0); 3428#L12 assume !(1 == main_~i~0); 3414#L12-2 assume !(10 == main_~i~0); 3417#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3416#L18-1 assume !!(main_~i~0 > 0); 3413#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3411#L12-2 [2019-11-28 02:58:27,718 INFO L796 eck$LassoCheckResult]: Loop: 3411#L12-2 assume !(10 == main_~i~0); 3426#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3424#L18-1 assume !!(main_~i~0 > 0); 3415#L12 assume !(1 == main_~i~0); 3394#L12-2 assume !(10 == main_~i~0); 3395#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3481#L18-1 assume !!(main_~i~0 > 0); 3479#L12 assume !(1 == main_~i~0); 3477#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 3379#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3393#L18-1 assume !!(main_~i~0 > 0); 3480#L12 assume !(1 == main_~i~0); 3478#L12-2 assume !(10 == main_~i~0); 3476#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3475#L18-1 assume !!(main_~i~0 > 0); 3474#L12 assume !(1 == main_~i~0); 3473#L12-2 assume !(10 == main_~i~0); 3472#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3471#L18-1 assume !!(main_~i~0 > 0); 3470#L12 assume !(1 == main_~i~0); 3469#L12-2 assume !(10 == main_~i~0); 3468#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3467#L18-1 assume !!(main_~i~0 > 0); 3466#L12 assume !(1 == main_~i~0); 3465#L12-2 assume !(10 == main_~i~0); 3464#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3463#L18-1 assume !!(main_~i~0 > 0); 3462#L12 assume !(1 == main_~i~0); 3461#L12-2 assume !(10 == main_~i~0); 3460#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3459#L18-1 assume !!(main_~i~0 > 0); 3458#L12 assume !(1 == main_~i~0); 3457#L12-2 assume !(10 == main_~i~0); 3456#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3455#L18-1 assume !!(main_~i~0 > 0); 3454#L12 assume !(1 == main_~i~0); 3412#L12-2 assume !(10 == main_~i~0); 3422#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3418#L18-1 assume !!(main_~i~0 > 0); 3410#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3411#L12-2 [2019-11-28 02:58:27,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:27,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1563122355, now seen corresponding path program 8 times [2019-11-28 02:58:27,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:27,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827556001] [2019-11-28 02:58:27,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:27,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827556001] [2019-11-28 02:58:27,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21620853] [2019-11-28 02:58:27,843 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:27,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:58:27,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:27,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:27,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-28 02:58:27,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:27,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 14 [2019-11-28 02:58:27,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660709631] [2019-11-28 02:58:27,880 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:27,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:27,881 INFO L82 PathProgramCache]: Analyzing trace with hash 422622699, now seen corresponding path program 8 times [2019-11-28 02:58:27,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:27,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646046993] [2019-11-28 02:58:27,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:27,952 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:58:27,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646046993] [2019-11-28 02:58:27,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910324726] [2019-11-28 02:58:27,953 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:27,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:58:27,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:27,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:58:27,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:27,991 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:58:27,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:27,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-28 02:58:27,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551456784] [2019-11-28 02:58:27,993 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:27,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:27,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:58:27,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:58:27,993 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. cyclomatic complexity: 36 Second operand 11 states. [2019-11-28 02:58:28,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:28,089 INFO L93 Difference]: Finished difference Result 148 states and 184 transitions. [2019-11-28 02:58:28,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:58:28,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 184 transitions. [2019-11-28 02:58:28,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2019-11-28 02:58:28,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 147 states and 183 transitions. [2019-11-28 02:58:28,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2019-11-28 02:58:28,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2019-11-28 02:58:28,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 183 transitions. [2019-11-28 02:58:28,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:28,092 INFO L688 BuchiCegarLoop]: Abstraction has 147 states and 183 transitions. [2019-11-28 02:58:28,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 183 transitions. [2019-11-28 02:58:28,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 140. [2019-11-28 02:58:28,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-28 02:58:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 173 transitions. [2019-11-28 02:58:28,095 INFO L711 BuchiCegarLoop]: Abstraction has 140 states and 173 transitions. [2019-11-28 02:58:28,096 INFO L591 BuchiCegarLoop]: Abstraction has 140 states and 173 transitions. [2019-11-28 02:58:28,096 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-28 02:58:28,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 173 transitions. [2019-11-28 02:58:28,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2019-11-28 02:58:28,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:28,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:28,098 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [12, 10, 10, 9, 2, 2, 1, 1] [2019-11-28 02:58:28,098 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2019-11-28 02:58:28,098 INFO L794 eck$LassoCheckResult]: Stem: 3928#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; 3929#L18-1 assume !!(main_~i~0 > 0); 3952#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3951#L12-2 assume !(10 == main_~i~0); 3950#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3949#L18-1 assume !!(main_~i~0 > 0); 3946#L12 assume !(1 == main_~i~0); 3948#L12-2 assume !(10 == main_~i~0); 3947#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3945#L18-1 assume !!(main_~i~0 > 0); 3944#L12 assume !(1 == main_~i~0); 3943#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 3937#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3938#L18-1 assume !!(main_~i~0 > 0); 4004#L12 assume !(1 == main_~i~0); 4003#L12-2 assume !(10 == main_~i~0); 4002#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4001#L18-1 assume !!(main_~i~0 > 0); 4000#L12 assume !(1 == main_~i~0); 3999#L12-2 assume !(10 == main_~i~0); 3998#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3997#L18-1 assume !!(main_~i~0 > 0); 3996#L12 assume !(1 == main_~i~0); 3995#L12-2 assume !(10 == main_~i~0); 3994#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3993#L18-1 assume !!(main_~i~0 > 0); 3992#L12 assume !(1 == main_~i~0); 3991#L12-2 assume !(10 == main_~i~0); 3990#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3989#L18-1 assume !!(main_~i~0 > 0); 3988#L12 assume !(1 == main_~i~0); 3987#L12-2 assume !(10 == main_~i~0); 3986#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3985#L18-1 assume !!(main_~i~0 > 0); 3984#L12 assume !(1 == main_~i~0); 3983#L12-2 assume !(10 == main_~i~0); 3982#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3981#L18-1 assume !!(main_~i~0 > 0); 3980#L12 assume !(1 == main_~i~0); 3979#L12-2 assume !(10 == main_~i~0); 3978#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3977#L18-1 assume !!(main_~i~0 > 0); 3976#L12 assume !(1 == main_~i~0); 3958#L12-2 assume !(10 == main_~i~0); 3964#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3963#L18-1 assume !!(main_~i~0 > 0); 3957#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3941#L12-2 [2019-11-28 02:58:28,099 INFO L796 eck$LassoCheckResult]: Loop: 3941#L12-2 assume !(10 == main_~i~0); 3942#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3971#L18-1 assume !!(main_~i~0 > 0); 3961#L12 assume !(1 == main_~i~0); 3962#L12-2 assume !(10 == main_~i~0); 3973#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3974#L18-1 assume !!(main_~i~0 > 0); 4041#L12 assume !(1 == main_~i~0); 4039#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 3924#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3940#L18-1 assume !!(main_~i~0 > 0); 3934#L12 assume !(1 == main_~i~0); 3935#L12-2 assume !(10 == main_~i~0); 4032#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4031#L18-1 assume !!(main_~i~0 > 0); 4030#L12 assume !(1 == main_~i~0); 4029#L12-2 assume !(10 == main_~i~0); 4028#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4027#L18-1 assume !!(main_~i~0 > 0); 4026#L12 assume !(1 == main_~i~0); 4025#L12-2 assume !(10 == main_~i~0); 4024#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4023#L18-1 assume !!(main_~i~0 > 0); 4022#L12 assume !(1 == main_~i~0); 4021#L12-2 assume !(10 == main_~i~0); 4020#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4019#L18-1 assume !!(main_~i~0 > 0); 4018#L12 assume !(1 == main_~i~0); 4017#L12-2 assume !(10 == main_~i~0); 4016#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4015#L18-1 assume !!(main_~i~0 > 0); 4014#L12 assume !(1 == main_~i~0); 4013#L12-2 assume !(10 == main_~i~0); 4012#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4011#L18-1 assume !!(main_~i~0 > 0); 4010#L12 assume !(1 == main_~i~0); 4009#L12-2 assume !(10 == main_~i~0); 4008#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4007#L18-1 assume !!(main_~i~0 > 0); 4006#L12 assume !(1 == main_~i~0); 3960#L12-2 assume !(10 == main_~i~0); 3970#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3968#L18-1 assume !!(main_~i~0 > 0); 3959#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3941#L12-2 [2019-11-28 02:58:28,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:28,099 INFO L82 PathProgramCache]: Analyzing trace with hash 844978232, now seen corresponding path program 9 times [2019-11-28 02:58:28,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:28,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443611390] [2019-11-28 02:58:28,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 100 proven. 6 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:28,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443611390] [2019-11-28 02:58:28,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577028637] [2019-11-28 02:58:28,125 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:28,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-11-28 02:58:28,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:28,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:28,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 100 proven. 6 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:28,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:28,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-28 02:58:28,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525766498] [2019-11-28 02:58:28,166 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:28,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:28,166 INFO L82 PathProgramCache]: Analyzing trace with hash 82045398, now seen corresponding path program 9 times [2019-11-28 02:58:28,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:28,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936827935] [2019-11-28 02:58:28,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:28,178 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:28,340 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 45 [2019-11-28 02:58:28,349 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:28,349 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:28,349 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:28,349 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:28,349 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:28,350 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:28,350 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:28,350 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:28,350 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration16_Loop [2019-11-28 02:58:28,350 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:28,350 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:28,351 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:28,353 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:28,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:28,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:28,413 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:28,413 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:28,418 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:28,419 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:28,422 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:28,422 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_10=0} Honda state: {v_rep~unnamed0~0~false_10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:58:28,428 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:28,428 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:28,430 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:28,430 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_10=1} Honda state: {v_rep~unnamed0~0~true_10=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:58:28,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:28,435 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:28,438 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:28,438 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 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:58:28,444 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:28,444 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:28,452 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:28,452 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:28,456 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:28,457 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:28,457 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:28,457 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:28,457 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:28,457 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:28,457 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:28,457 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:28,458 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:28,458 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration16_Loop [2019-11-28 02:58:28,458 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:28,458 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:28,459 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:28,461 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:28,465 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:28,469 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:28,525 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:28,526 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:28,531 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:58:28,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:28,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:28,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:28,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:28,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:28,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:28,537 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:28,541 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:58:28,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:28,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:28,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:28,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:28,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:28,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:28,553 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:28,559 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:58:28,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:28,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:28,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:28,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:28,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:28,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:28,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:28,565 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:28,571 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:58:28,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:28,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:28,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:28,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:28,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:28,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:28,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:28,577 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:28,579 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:28,579 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:28,583 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:28,583 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:28,583 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:28,583 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:58:28,585 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:28,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:28,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:28,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:28,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:58:28,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:28,670 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:58:28,670 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 173 transitions. cyclomatic complexity: 39 Second operand 8 states. [2019-11-28 02:58:29,016 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 173 transitions. cyclomatic complexity: 39. Second operand 8 states. Result 378 states and 460 transitions. Complement of second has 27 states. [2019-11-28 02:58:29,016 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:58:29,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:58:29,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 38 transitions. [2019-11-28 02:58:29,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 38 transitions. Stem has 47 letters. Loop has 44 letters. [2019-11-28 02:58:29,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:29,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 38 transitions. Stem has 91 letters. Loop has 44 letters. [2019-11-28 02:58:29,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:29,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 38 transitions. Stem has 47 letters. Loop has 88 letters. [2019-11-28 02:58:29,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:29,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 378 states and 460 transitions. [2019-11-28 02:58:29,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2019-11-28 02:58:29,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 378 states to 289 states and 350 transitions. [2019-11-28 02:58:29,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2019-11-28 02:58:29,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-11-28 02:58:29,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 289 states and 350 transitions. [2019-11-28 02:58:29,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:29,027 INFO L688 BuchiCegarLoop]: Abstraction has 289 states and 350 transitions. [2019-11-28 02:58:29,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states and 350 transitions. [2019-11-28 02:58:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 197. [2019-11-28 02:58:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-28 02:58:29,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 242 transitions. [2019-11-28 02:58:29,031 INFO L711 BuchiCegarLoop]: Abstraction has 197 states and 242 transitions. [2019-11-28 02:58:29,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:29,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:58:29,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:58:29,032 INFO L87 Difference]: Start difference. First operand 197 states and 242 transitions. Second operand 5 states. [2019-11-28 02:58:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:29,061 INFO L93 Difference]: Finished difference Result 167 states and 201 transitions. [2019-11-28 02:58:29,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:58:29,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 201 transitions. [2019-11-28 02:58:29,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2019-11-28 02:58:29,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 159 states and 192 transitions. [2019-11-28 02:58:29,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2019-11-28 02:58:29,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2019-11-28 02:58:29,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 192 transitions. [2019-11-28 02:58:29,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:29,069 INFO L688 BuchiCegarLoop]: Abstraction has 159 states and 192 transitions. [2019-11-28 02:58:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 192 transitions. [2019-11-28 02:58:29,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 152. [2019-11-28 02:58:29,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-28 02:58:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 185 transitions. [2019-11-28 02:58:29,072 INFO L711 BuchiCegarLoop]: Abstraction has 152 states and 185 transitions. [2019-11-28 02:58:29,072 INFO L591 BuchiCegarLoop]: Abstraction has 152 states and 185 transitions. [2019-11-28 02:58:29,072 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-28 02:58:29,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 185 transitions. [2019-11-28 02:58:29,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2019-11-28 02:58:29,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:29,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:29,075 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [13, 11, 11, 9, 3, 2, 1, 1] [2019-11-28 02:58:29,075 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 9, 3, 1, 1] [2019-11-28 02:58:29,075 INFO L794 eck$LassoCheckResult]: Stem: 5288#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; 5289#L18-1 assume !!(main_~i~0 > 0); 5316#L12 assume 1 == main_~i~0;main_~up~0 := 1; 5315#L12-2 assume !(10 == main_~i~0); 5314#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5313#L18-1 assume !!(main_~i~0 > 0); 5312#L12 assume !(1 == main_~i~0); 5311#L12-2 assume !(10 == main_~i~0); 5310#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5309#L18-1 assume !!(main_~i~0 > 0); 5306#L12 assume !(1 == main_~i~0); 5308#L12-2 assume !(10 == main_~i~0); 5307#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5305#L18-1 assume !!(main_~i~0 > 0); 5304#L12 assume !(1 == main_~i~0); 5303#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 5296#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5297#L18-1 assume !!(main_~i~0 > 0); 5359#L12 assume !(1 == main_~i~0); 5358#L12-2 assume !(10 == main_~i~0); 5357#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5356#L18-1 assume !!(main_~i~0 > 0); 5355#L12 assume !(1 == main_~i~0); 5354#L12-2 assume !(10 == main_~i~0); 5353#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5352#L18-1 assume !!(main_~i~0 > 0); 5351#L12 assume !(1 == main_~i~0); 5350#L12-2 assume !(10 == main_~i~0); 5349#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5348#L18-1 assume !!(main_~i~0 > 0); 5347#L12 assume !(1 == main_~i~0); 5346#L12-2 assume !(10 == main_~i~0); 5345#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5344#L18-1 assume !!(main_~i~0 > 0); 5343#L12 assume !(1 == main_~i~0); 5342#L12-2 assume !(10 == main_~i~0); 5341#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5340#L18-1 assume !!(main_~i~0 > 0); 5339#L12 assume !(1 == main_~i~0); 5338#L12-2 assume !(10 == main_~i~0); 5337#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5336#L18-1 assume !!(main_~i~0 > 0); 5335#L12 assume !(1 == main_~i~0); 5334#L12-2 assume !(10 == main_~i~0); 5333#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5332#L18-1 assume !!(main_~i~0 > 0); 5331#L12 assume !(1 == main_~i~0); 5326#L12-2 assume !(10 == main_~i~0); 5329#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5328#L18-1 assume !!(main_~i~0 > 0); 5324#L12 assume 1 == main_~i~0;main_~up~0 := 1; 5325#L12-2 [2019-11-28 02:58:29,075 INFO L796 eck$LassoCheckResult]: Loop: 5325#L12-2 assume !(10 == main_~i~0); 5299#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5290#L18-1 assume !!(main_~i~0 > 0); 5291#L12 assume !(1 == main_~i~0); 5433#L12-2 assume !(10 == main_~i~0); 5435#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5434#L18-1 assume !!(main_~i~0 > 0); 5327#L12 assume !(1 == main_~i~0); 5301#L12-2 assume !(10 == main_~i~0); 5302#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5431#L18-1 assume !!(main_~i~0 > 0); 5429#L12 assume !(1 == main_~i~0); 5427#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 5285#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5300#L18-1 assume !!(main_~i~0 > 0); 5294#L12 assume !(1 == main_~i~0); 5295#L12-2 assume !(10 == main_~i~0); 5420#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5418#L18-1 assume !!(main_~i~0 > 0); 5416#L12 assume !(1 == main_~i~0); 5414#L12-2 assume !(10 == main_~i~0); 5412#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5410#L18-1 assume !!(main_~i~0 > 0); 5408#L12 assume !(1 == main_~i~0); 5406#L12-2 assume !(10 == main_~i~0); 5404#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5402#L18-1 assume !!(main_~i~0 > 0); 5400#L12 assume !(1 == main_~i~0); 5398#L12-2 assume !(10 == main_~i~0); 5396#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5394#L18-1 assume !!(main_~i~0 > 0); 5392#L12 assume !(1 == main_~i~0); 5390#L12-2 assume !(10 == main_~i~0); 5388#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5386#L18-1 assume !!(main_~i~0 > 0); 5384#L12 assume !(1 == main_~i~0); 5382#L12-2 assume !(10 == main_~i~0); 5380#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5378#L18-1 assume !!(main_~i~0 > 0); 5376#L12 assume !(1 == main_~i~0); 5374#L12-2 assume !(10 == main_~i~0); 5372#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5370#L18-1 assume !!(main_~i~0 > 0); 5368#L12 assume !(1 == main_~i~0); 5366#L12-2 assume !(10 == main_~i~0); 5364#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5360#L18-1 assume !!(main_~i~0 > 0); 5361#L12 assume 1 == main_~i~0;main_~up~0 := 1; 5325#L12-2 [2019-11-28 02:58:29,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:29,076 INFO L82 PathProgramCache]: Analyzing trace with hash -890757087, now seen corresponding path program 10 times [2019-11-28 02:58:29,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:29,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732329114] [2019-11-28 02:58:29,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 137 proven. 15 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:29,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732329114] [2019-11-28 02:58:29,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247443993] [2019-11-28 02:58:29,112 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:29,144 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:58:29,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:29,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:58:29,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:29,150 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 137 proven. 15 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:29,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:29,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 02:58:29,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386169476] [2019-11-28 02:58:29,151 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:29,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:29,151 INFO L82 PathProgramCache]: Analyzing trace with hash -294604097, now seen corresponding path program 10 times [2019-11-28 02:58:29,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:29,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95696001] [2019-11-28 02:58:29,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:29,163 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:29,358 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 48 [2019-11-28 02:58:29,376 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:29,376 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:29,376 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:29,376 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:29,377 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:29,377 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:29,377 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:29,377 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:29,377 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration17_Loop [2019-11-28 02:58:29,380 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:29,380 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:29,381 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:29,385 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:29,390 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:29,394 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:29,442 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:29,442 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:29,448 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:29,449 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:29,451 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:29,452 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_12=1} Honda state: {v_rep~unnamed0~0~true_12=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:29,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:29,458 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 75 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 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:58:29,467 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:29,467 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:29,471 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:29,472 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:29,472 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:29,472 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:29,472 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:29,472 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:29,472 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:29,473 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:29,473 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:29,473 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration17_Loop [2019-11-28 02:58:29,473 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:29,473 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:29,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:58:29,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:58:29,478 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:29,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:58:29,545 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:29,545 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 02:58:29,555 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:29,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:29,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:29,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:29,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:29,558 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:29,558 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:29,561 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 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:58:29,581 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:58:29,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:29,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:29,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:29,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:29,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:29,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:29,595 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:29,601 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:58:29,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:29,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:29,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:29,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:29,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:29,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:29,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:29,606 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:29,608 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 02:58:29,608 INFO L444 ModelExtractionUtils]: 1 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:29,612 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:29,612 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:29,612 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:29,612 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:58:29,614 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:29,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:29,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:29,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:29,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:58:29,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:29,675 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:58:29,675 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 152 states and 185 transitions. cyclomatic complexity: 39 Second operand 7 states. [2019-11-28 02:58:29,872 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 152 states and 185 transitions. cyclomatic complexity: 39. Second operand 7 states. Result 486 states and 584 transitions. Complement of second has 19 states. [2019-11-28 02:58:29,876 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:58:29,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:58:29,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2019-11-28 02:58:29,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 51 letters. Loop has 48 letters. [2019-11-28 02:58:29,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:29,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 99 letters. Loop has 48 letters. [2019-11-28 02:58:29,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:29,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 51 letters. Loop has 96 letters. [2019-11-28 02:58:29,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:29,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 486 states and 584 transitions. [2019-11-28 02:58:29,883 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2019-11-28 02:58:29,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 486 states to 419 states and 494 transitions. [2019-11-28 02:58:29,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2019-11-28 02:58:29,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2019-11-28 02:58:29,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 419 states and 494 transitions. [2019-11-28 02:58:29,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:29,887 INFO L688 BuchiCegarLoop]: Abstraction has 419 states and 494 transitions. [2019-11-28 02:58:29,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states and 494 transitions. [2019-11-28 02:58:29,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 385. [2019-11-28 02:58:29,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-11-28 02:58:29,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 460 transitions. [2019-11-28 02:58:29,895 INFO L711 BuchiCegarLoop]: Abstraction has 385 states and 460 transitions. [2019-11-28 02:58:29,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:29,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:58:29,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:58:29,895 INFO L87 Difference]: Start difference. First operand 385 states and 460 transitions. Second operand 6 states. [2019-11-28 02:58:29,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:29,930 INFO L93 Difference]: Finished difference Result 195 states and 228 transitions. [2019-11-28 02:58:29,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:58:29,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 228 transitions. [2019-11-28 02:58:29,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2019-11-28 02:58:29,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 171 states and 204 transitions. [2019-11-28 02:58:29,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-28 02:58:29,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-28 02:58:29,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 204 transitions. [2019-11-28 02:58:29,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:29,934 INFO L688 BuchiCegarLoop]: Abstraction has 171 states and 204 transitions. [2019-11-28 02:58:29,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 204 transitions. [2019-11-28 02:58:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2019-11-28 02:58:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-28 02:58:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 197 transitions. [2019-11-28 02:58:29,937 INFO L711 BuchiCegarLoop]: Abstraction has 164 states and 197 transitions. [2019-11-28 02:58:29,937 INFO L591 BuchiCegarLoop]: Abstraction has 164 states and 197 transitions. [2019-11-28 02:58:29,937 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-11-28 02:58:29,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 197 transitions. [2019-11-28 02:58:29,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2019-11-28 02:58:29,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:29,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:29,940 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [14, 12, 12, 9, 4, 2, 1, 1] [2019-11-28 02:58:29,940 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 9, 4, 1, 1] [2019-11-28 02:58:29,940 INFO L794 eck$LassoCheckResult]: Stem: 7004#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; 7005#L18-1 assume !!(main_~i~0 > 0); 7033#L12 assume 1 == main_~i~0;main_~up~0 := 1; 7032#L12-2 assume !(10 == main_~i~0); 7031#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7030#L18-1 assume !!(main_~i~0 > 0); 7029#L12 assume !(1 == main_~i~0); 7028#L12-2 assume !(10 == main_~i~0); 7027#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7026#L18-1 assume !!(main_~i~0 > 0); 7025#L12 assume !(1 == main_~i~0); 7024#L12-2 assume !(10 == main_~i~0); 7023#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7022#L18-1 assume !!(main_~i~0 > 0); 7019#L12 assume !(1 == main_~i~0); 7021#L12-2 assume !(10 == main_~i~0); 7020#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7018#L18-1 assume !!(main_~i~0 > 0); 7017#L12 assume !(1 == main_~i~0); 7016#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 7011#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7012#L18-1 assume !!(main_~i~0 > 0); 7076#L12 assume !(1 == main_~i~0); 7075#L12-2 assume !(10 == main_~i~0); 7074#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7073#L18-1 assume !!(main_~i~0 > 0); 7072#L12 assume !(1 == main_~i~0); 7071#L12-2 assume !(10 == main_~i~0); 7070#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7069#L18-1 assume !!(main_~i~0 > 0); 7068#L12 assume !(1 == main_~i~0); 7067#L12-2 assume !(10 == main_~i~0); 7066#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7065#L18-1 assume !!(main_~i~0 > 0); 7064#L12 assume !(1 == main_~i~0); 7063#L12-2 assume !(10 == main_~i~0); 7062#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7061#L18-1 assume !!(main_~i~0 > 0); 7060#L12 assume !(1 == main_~i~0); 7059#L12-2 assume !(10 == main_~i~0); 7058#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7057#L18-1 assume !!(main_~i~0 > 0); 7056#L12 assume !(1 == main_~i~0); 7055#L12-2 assume !(10 == main_~i~0); 7054#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7053#L18-1 assume !!(main_~i~0 > 0); 7052#L12 assume !(1 == main_~i~0); 7051#L12-2 assume !(10 == main_~i~0); 7050#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7049#L18-1 assume !!(main_~i~0 > 0); 7048#L12 assume !(1 == main_~i~0); 7042#L12-2 assume !(10 == main_~i~0); 7046#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7045#L18-1 assume !!(main_~i~0 > 0); 7040#L12 assume 1 == main_~i~0;main_~up~0 := 1; 7041#L12-2 [2019-11-28 02:58:29,940 INFO L796 eck$LassoCheckResult]: Loop: 7041#L12-2 assume !(10 == main_~i~0); 7163#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7162#L18-1 assume !!(main_~i~0 > 0); 7043#L12 assume !(1 == main_~i~0); 7044#L12-2 assume !(10 == main_~i~0); 7161#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7160#L18-1 assume !!(main_~i~0 > 0); 7159#L12 assume !(1 == main_~i~0); 7158#L12-2 assume !(10 == main_~i~0); 7156#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7154#L18-1 assume !!(main_~i~0 > 0); 7152#L12 assume !(1 == main_~i~0); 7151#L12-2 assume !(10 == main_~i~0); 7146#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7149#L18-1 assume !!(main_~i~0 > 0); 7148#L12 assume !(1 == main_~i~0); 7145#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 7001#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7014#L18-1 assume !!(main_~i~0 > 0); 7141#L12 assume !(1 == main_~i~0); 7139#L12-2 assume !(10 == main_~i~0); 7137#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7135#L18-1 assume !!(main_~i~0 > 0); 7133#L12 assume !(1 == main_~i~0); 7131#L12-2 assume !(10 == main_~i~0); 7129#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7127#L18-1 assume !!(main_~i~0 > 0); 7125#L12 assume !(1 == main_~i~0); 7123#L12-2 assume !(10 == main_~i~0); 7121#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7119#L18-1 assume !!(main_~i~0 > 0); 7117#L12 assume !(1 == main_~i~0); 7115#L12-2 assume !(10 == main_~i~0); 7113#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7111#L18-1 assume !!(main_~i~0 > 0); 7109#L12 assume !(1 == main_~i~0); 7107#L12-2 assume !(10 == main_~i~0); 7105#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7103#L18-1 assume !!(main_~i~0 > 0); 7101#L12 assume !(1 == main_~i~0); 7099#L12-2 assume !(10 == main_~i~0); 7097#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7095#L18-1 assume !!(main_~i~0 > 0); 7093#L12 assume !(1 == main_~i~0); 7091#L12-2 assume !(10 == main_~i~0); 7089#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7087#L18-1 assume !!(main_~i~0 > 0); 7085#L12 assume !(1 == main_~i~0); 7084#L12-2 assume !(10 == main_~i~0); 7082#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7079#L18-1 assume !!(main_~i~0 > 0); 7080#L12 assume 1 == main_~i~0;main_~up~0 := 1; 7041#L12-2 [2019-11-28 02:58:29,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:29,940 INFO L82 PathProgramCache]: Analyzing trace with hash 260754314, now seen corresponding path program 11 times [2019-11-28 02:58:29,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:29,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943967637] [2019-11-28 02:58:29,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:29,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943967637] [2019-11-28 02:58:29,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260735618] [2019-11-28 02:58:29,975 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:30,017 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-28 02:58:30,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:30,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:58:30,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:30,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:30,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-28 02:58:30,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684177359] [2019-11-28 02:58:30,026 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:30,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:30,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1093459752, now seen corresponding path program 11 times [2019-11-28 02:58:30,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:30,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980214932] [2019-11-28 02:58:30,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:30,039 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:30,246 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 51 [2019-11-28 02:58:30,256 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:30,256 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:30,257 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:30,257 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:30,257 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:30,257 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:30,257 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:30,257 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:30,257 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration18_Loop [2019-11-28 02:58:30,258 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:30,258 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:30,259 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:30,261 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:30,266 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:30,273 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:30,322 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:30,322 INFO L404 LassoAnalysis]: Checking for nontermination... 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:58:30,327 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:30,327 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:58:30,330 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:30,330 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_14=1} Honda state: {v_rep~unnamed0~0~true_14=1} 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:58:30,336 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:30,336 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:58:30,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:30,345 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:30,356 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:30,358 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:30,358 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:30,358 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:30,358 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:30,358 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:30,358 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:30,358 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:30,358 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:30,359 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration18_Loop [2019-11-28 02:58:30,359 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:30,359 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:30,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:30,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:30,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:30,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:58:30,426 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:30,426 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:58:30,432 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:58:30,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:30,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:30,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:30,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:30,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:30,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:30,441 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:58:30,449 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:58:30,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:30,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:30,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:30,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:30,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:30,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:30,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:30,453 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:30,455 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:30,455 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 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:30,459 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:30,459 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:30,459 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:30,459 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:58:30,461 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:30,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:30,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:30,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:30,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:58:30,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:30,537 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:58:30,538 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 197 transitions. cyclomatic complexity: 39 Second operand 8 states. [2019-11-28 02:58:30,752 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 197 transitions. cyclomatic complexity: 39. Second operand 8 states. Result 586 states and 700 transitions. Complement of second has 23 states. [2019-11-28 02:58:30,755 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:58:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:58:30,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2019-11-28 02:58:30,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 55 letters. Loop has 52 letters. [2019-11-28 02:58:30,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:30,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 107 letters. Loop has 52 letters. [2019-11-28 02:58:30,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:30,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 55 letters. Loop has 104 letters. [2019-11-28 02:58:30,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:30,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 586 states and 700 transitions. [2019-11-28 02:58:30,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2019-11-28 02:58:30,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 586 states to 485 states and 570 transitions. [2019-11-28 02:58:30,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2019-11-28 02:58:30,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2019-11-28 02:58:30,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 485 states and 570 transitions. [2019-11-28 02:58:30,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:30,765 INFO L688 BuchiCegarLoop]: Abstraction has 485 states and 570 transitions. [2019-11-28 02:58:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states and 570 transitions. [2019-11-28 02:58:30,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 441. [2019-11-28 02:58:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-11-28 02:58:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 526 transitions. [2019-11-28 02:58:30,773 INFO L711 BuchiCegarLoop]: Abstraction has 441 states and 526 transitions. [2019-11-28 02:58:30,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:30,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:58:30,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:58:30,774 INFO L87 Difference]: Start difference. First operand 441 states and 526 transitions. Second operand 7 states. [2019-11-28 02:58:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:30,824 INFO L93 Difference]: Finished difference Result 215 states and 248 transitions. [2019-11-28 02:58:30,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:58:30,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 215 states and 248 transitions. [2019-11-28 02:58:30,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2019-11-28 02:58:30,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 215 states to 183 states and 216 transitions. [2019-11-28 02:58:30,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2019-11-28 02:58:30,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2019-11-28 02:58:30,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 216 transitions. [2019-11-28 02:58:30,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:30,829 INFO L688 BuchiCegarLoop]: Abstraction has 183 states and 216 transitions. [2019-11-28 02:58:30,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states and 216 transitions. [2019-11-28 02:58:30,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 176. [2019-11-28 02:58:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-28 02:58:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 209 transitions. [2019-11-28 02:58:30,833 INFO L711 BuchiCegarLoop]: Abstraction has 176 states and 209 transitions. [2019-11-28 02:58:30,833 INFO L591 BuchiCegarLoop]: Abstraction has 176 states and 209 transitions. [2019-11-28 02:58:30,833 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-11-28 02:58:30,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states and 209 transitions. [2019-11-28 02:58:30,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2019-11-28 02:58:30,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:30,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:30,836 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [15, 13, 13, 9, 5, 2, 1, 1] [2019-11-28 02:58:30,836 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 9, 5, 1, 1] [2019-11-28 02:58:30,836 INFO L794 eck$LassoCheckResult]: Stem: 8953#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; 8954#L18-1 assume !!(main_~i~0 > 0); 8986#L12 assume 1 == main_~i~0;main_~up~0 := 1; 8985#L12-2 assume !(10 == main_~i~0); 8984#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8983#L18-1 assume !!(main_~i~0 > 0); 8982#L12 assume !(1 == main_~i~0); 8981#L12-2 assume !(10 == main_~i~0); 8980#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8979#L18-1 assume !!(main_~i~0 > 0); 8978#L12 assume !(1 == main_~i~0); 8977#L12-2 assume !(10 == main_~i~0); 8976#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8975#L18-1 assume !!(main_~i~0 > 0); 8974#L12 assume !(1 == main_~i~0); 8973#L12-2 assume !(10 == main_~i~0); 8972#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8971#L18-1 assume !!(main_~i~0 > 0); 8968#L12 assume !(1 == main_~i~0); 8970#L12-2 assume !(10 == main_~i~0); 8969#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8967#L18-1 assume !!(main_~i~0 > 0); 8966#L12 assume !(1 == main_~i~0); 8965#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 8960#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8961#L18-1 assume !!(main_~i~0 > 0); 9029#L12 assume !(1 == main_~i~0); 9028#L12-2 assume !(10 == main_~i~0); 9027#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9026#L18-1 assume !!(main_~i~0 > 0); 9025#L12 assume !(1 == main_~i~0); 9024#L12-2 assume !(10 == main_~i~0); 9023#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9022#L18-1 assume !!(main_~i~0 > 0); 9021#L12 assume !(1 == main_~i~0); 9020#L12-2 assume !(10 == main_~i~0); 9019#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9018#L18-1 assume !!(main_~i~0 > 0); 9017#L12 assume !(1 == main_~i~0); 9016#L12-2 assume !(10 == main_~i~0); 9015#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9014#L18-1 assume !!(main_~i~0 > 0); 9013#L12 assume !(1 == main_~i~0); 9012#L12-2 assume !(10 == main_~i~0); 9011#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9010#L18-1 assume !!(main_~i~0 > 0); 9009#L12 assume !(1 == main_~i~0); 9008#L12-2 assume !(10 == main_~i~0); 9007#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9006#L18-1 assume !!(main_~i~0 > 0); 9005#L12 assume !(1 == main_~i~0); 9004#L12-2 assume !(10 == main_~i~0); 9003#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9002#L18-1 assume !!(main_~i~0 > 0); 9001#L12 assume !(1 == main_~i~0); 8995#L12-2 assume !(10 == main_~i~0); 8999#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8998#L18-1 assume !!(main_~i~0 > 0); 8993#L12 assume 1 == main_~i~0;main_~up~0 := 1; 8994#L12-2 [2019-11-28 02:58:30,836 INFO L796 eck$LassoCheckResult]: Loop: 8994#L12-2 assume !(10 == main_~i~0); 9124#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9121#L18-1 assume !!(main_~i~0 > 0); 8996#L12 assume !(1 == main_~i~0); 8997#L12-2 assume !(10 == main_~i~0); 9123#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9122#L18-1 assume !!(main_~i~0 > 0); 9120#L12 assume !(1 == main_~i~0); 9119#L12-2 assume !(10 == main_~i~0); 9118#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9117#L18-1 assume !!(main_~i~0 > 0); 9115#L12 assume !(1 == main_~i~0); 9113#L12-2 assume !(10 == main_~i~0); 9111#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9109#L18-1 assume !!(main_~i~0 > 0); 9107#L12 assume !(1 == main_~i~0); 9105#L12-2 assume !(10 == main_~i~0); 9100#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9103#L18-1 assume !!(main_~i~0 > 0); 9101#L12 assume !(1 == main_~i~0); 9099#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 8950#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8963#L18-1 assume !!(main_~i~0 > 0); 9093#L12 assume !(1 == main_~i~0); 9091#L12-2 assume !(10 == main_~i~0); 9089#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9087#L18-1 assume !!(main_~i~0 > 0); 9085#L12 assume !(1 == main_~i~0); 9083#L12-2 assume !(10 == main_~i~0); 9081#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9079#L18-1 assume !!(main_~i~0 > 0); 9077#L12 assume !(1 == main_~i~0); 9075#L12-2 assume !(10 == main_~i~0); 9073#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9071#L18-1 assume !!(main_~i~0 > 0); 9069#L12 assume !(1 == main_~i~0); 9067#L12-2 assume !(10 == main_~i~0); 9065#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9063#L18-1 assume !!(main_~i~0 > 0); 9061#L12 assume !(1 == main_~i~0); 9059#L12-2 assume !(10 == main_~i~0); 9057#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9055#L18-1 assume !!(main_~i~0 > 0); 9053#L12 assume !(1 == main_~i~0); 9051#L12-2 assume !(10 == main_~i~0); 9049#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9047#L18-1 assume !!(main_~i~0 > 0); 9045#L12 assume !(1 == main_~i~0); 9043#L12-2 assume !(10 == main_~i~0); 9041#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9039#L18-1 assume !!(main_~i~0 > 0); 9038#L12 assume !(1 == main_~i~0); 9036#L12-2 assume !(10 == main_~i~0); 9034#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9030#L18-1 assume !!(main_~i~0 > 0); 9031#L12 assume 1 == main_~i~0;main_~up~0 := 1; 8994#L12-2 [2019-11-28 02:58:30,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:30,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1566074253, now seen corresponding path program 12 times [2019-11-28 02:58:30,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:30,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450398062] [2019-11-28 02:58:30,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 211 proven. 45 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:30,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450398062] [2019-11-28 02:58:30,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589168182] [2019-11-28 02:58:30,884 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:30,925 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-11-28 02:58:30,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:30,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:58:30,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 211 proven. 45 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:30,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:30,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-28 02:58:30,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387186745] [2019-11-28 02:58:30,936 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:30,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:30,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1203416849, now seen corresponding path program 12 times [2019-11-28 02:58:30,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:30,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179340243] [2019-11-28 02:58:30,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:30,949 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:31,173 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 54 [2019-11-28 02:58:31,185 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:31,185 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:31,185 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:31,185 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:31,185 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:31,185 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:31,186 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:31,186 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:31,186 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration19_Loop [2019-11-28 02:58:31,186 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:31,186 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:31,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:31,189 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:31,192 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:31,194 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:31,242 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:31,243 INFO L404 LassoAnalysis]: Checking for nontermination... 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:58:31,248 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:31,248 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:31,251 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:31,251 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_16=1} Honda state: {v_rep~unnamed0~0~true_16=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:31,260 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:31,261 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:31,264 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:31,264 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: [] Waiting until toolchain timeout for monitored process 90 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 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:58:31,269 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:31,269 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:31,272 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:31,272 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_16=0} Honda state: {v_rep~unnamed0~0~false_16=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:58:31,277 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:31,277 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:58:31,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:31,286 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:31,289 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:31,291 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:31,291 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:31,291 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:31,291 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:31,291 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:31,291 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:31,291 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:31,292 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:31,292 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration19_Loop [2019-11-28 02:58:31,292 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:31,292 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:31,293 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:31,296 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:31,300 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:31,302 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:31,349 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:31,349 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:58:31,353 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:58:31,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:31,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:31,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:31,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:31,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:31,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:31,360 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) [2019-11-28 02:58:31,366 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:58:31,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:31,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:31,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:31,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:31,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:31,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:31,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:31,387 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:58:31,393 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:58:31,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:31,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:31,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:31,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:31,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:31,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:31,398 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:58:31,403 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:58:31,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:31,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:31,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:31,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:31,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:31,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:31,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:31,410 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:31,412 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 02:58:31,412 INFO L444 ModelExtractionUtils]: 1 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:58:31,418 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:31,418 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:31,418 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:31,419 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:58:31,420 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:31,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:31,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:31,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:31,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:58:31,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:31,508 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:58:31,508 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 176 states and 209 transitions. cyclomatic complexity: 39 Second operand 9 states. [2019-11-28 02:58:31,790 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 176 states and 209 transitions. cyclomatic complexity: 39. Second operand 9 states. Result 702 states and 836 transitions. Complement of second has 27 states. [2019-11-28 02:58:31,791 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:58:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 02:58:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2019-11-28 02:58:31,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 59 letters. Loop has 56 letters. [2019-11-28 02:58:31,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:31,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 115 letters. Loop has 56 letters. [2019-11-28 02:58:31,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:31,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 59 letters. Loop has 112 letters. [2019-11-28 02:58:31,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:31,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 702 states and 836 transitions. [2019-11-28 02:58:31,799 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2019-11-28 02:58:31,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 702 states to 559 states and 656 transitions. [2019-11-28 02:58:31,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2019-11-28 02:58:31,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2019-11-28 02:58:31,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 559 states and 656 transitions. [2019-11-28 02:58:31,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:31,803 INFO L688 BuchiCegarLoop]: Abstraction has 559 states and 656 transitions. [2019-11-28 02:58:31,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states and 656 transitions. [2019-11-28 02:58:31,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 505. [2019-11-28 02:58:31,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-11-28 02:58:31,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 602 transitions. [2019-11-28 02:58:31,811 INFO L711 BuchiCegarLoop]: Abstraction has 505 states and 602 transitions. [2019-11-28 02:58:31,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:31,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:58:31,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:58:31,812 INFO L87 Difference]: Start difference. First operand 505 states and 602 transitions. Second operand 8 states. [2019-11-28 02:58:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:31,874 INFO L93 Difference]: Finished difference Result 235 states and 268 transitions. [2019-11-28 02:58:31,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:58:31,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 235 states and 268 transitions. [2019-11-28 02:58:31,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2019-11-28 02:58:31,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 235 states to 195 states and 228 transitions. [2019-11-28 02:58:31,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2019-11-28 02:58:31,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2019-11-28 02:58:31,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 228 transitions. [2019-11-28 02:58:31,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:31,880 INFO L688 BuchiCegarLoop]: Abstraction has 195 states and 228 transitions. [2019-11-28 02:58:31,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 228 transitions. [2019-11-28 02:58:31,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 188. [2019-11-28 02:58:31,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-28 02:58:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 221 transitions. [2019-11-28 02:58:31,884 INFO L711 BuchiCegarLoop]: Abstraction has 188 states and 221 transitions. [2019-11-28 02:58:31,884 INFO L591 BuchiCegarLoop]: Abstraction has 188 states and 221 transitions. [2019-11-28 02:58:31,884 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2019-11-28 02:58:31,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 221 transitions. [2019-11-28 02:58:31,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 60 [2019-11-28 02:58:31,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:31,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:31,887 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [16, 14, 14, 9, 6, 2, 1, 1] [2019-11-28 02:58:31,887 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 9, 6, 1, 1] [2019-11-28 02:58:31,887 INFO L794 eck$LassoCheckResult]: Stem: 11159#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; 11160#L18-1 assume !!(main_~i~0 > 0); 11198#L12 assume 1 == main_~i~0;main_~up~0 := 1; 11197#L12-2 assume !(10 == main_~i~0); 11196#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11195#L18-1 assume !!(main_~i~0 > 0); 11194#L12 assume !(1 == main_~i~0); 11193#L12-2 assume !(10 == main_~i~0); 11192#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11191#L18-1 assume !!(main_~i~0 > 0); 11190#L12 assume !(1 == main_~i~0); 11189#L12-2 assume !(10 == main_~i~0); 11188#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11187#L18-1 assume !!(main_~i~0 > 0); 11186#L12 assume !(1 == main_~i~0); 11185#L12-2 assume !(10 == main_~i~0); 11184#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11183#L18-1 assume !!(main_~i~0 > 0); 11182#L12 assume !(1 == main_~i~0); 11181#L12-2 assume !(10 == main_~i~0); 11180#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11179#L18-1 assume !!(main_~i~0 > 0); 11176#L12 assume !(1 == main_~i~0); 11178#L12-2 assume !(10 == main_~i~0); 11177#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11175#L18-1 assume !!(main_~i~0 > 0); 11174#L12 assume !(1 == main_~i~0); 11173#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 11167#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11168#L18-1 assume !!(main_~i~0 > 0); 11241#L12 assume !(1 == main_~i~0); 11240#L12-2 assume !(10 == main_~i~0); 11239#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11238#L18-1 assume !!(main_~i~0 > 0); 11237#L12 assume !(1 == main_~i~0); 11236#L12-2 assume !(10 == main_~i~0); 11235#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11234#L18-1 assume !!(main_~i~0 > 0); 11233#L12 assume !(1 == main_~i~0); 11232#L12-2 assume !(10 == main_~i~0); 11231#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11230#L18-1 assume !!(main_~i~0 > 0); 11229#L12 assume !(1 == main_~i~0); 11228#L12-2 assume !(10 == main_~i~0); 11227#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11226#L18-1 assume !!(main_~i~0 > 0); 11225#L12 assume !(1 == main_~i~0); 11224#L12-2 assume !(10 == main_~i~0); 11223#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11222#L18-1 assume !!(main_~i~0 > 0); 11221#L12 assume !(1 == main_~i~0); 11220#L12-2 assume !(10 == main_~i~0); 11219#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11218#L18-1 assume !!(main_~i~0 > 0); 11217#L12 assume !(1 == main_~i~0); 11216#L12-2 assume !(10 == main_~i~0); 11215#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11214#L18-1 assume !!(main_~i~0 > 0); 11213#L12 assume !(1 == main_~i~0); 11206#L12-2 assume !(10 == main_~i~0); 11211#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11210#L18-1 assume !!(main_~i~0 > 0); 11204#L12 assume 1 == main_~i~0;main_~up~0 := 1; 11205#L12-2 [2019-11-28 02:58:31,888 INFO L796 eck$LassoCheckResult]: Loop: 11205#L12-2 assume !(10 == main_~i~0); 11336#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11334#L18-1 assume !!(main_~i~0 > 0); 11208#L12 assume !(1 == main_~i~0); 11209#L12-2 assume !(10 == main_~i~0); 11330#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11329#L18-1 assume !!(main_~i~0 > 0); 11328#L12 assume !(1 == main_~i~0); 11327#L12-2 assume !(10 == main_~i~0); 11326#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11325#L18-1 assume !!(main_~i~0 > 0); 11324#L12 assume !(1 == main_~i~0); 11323#L12-2 assume !(10 == main_~i~0); 11322#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11321#L18-1 assume !!(main_~i~0 > 0); 11320#L12 assume !(1 == main_~i~0); 11319#L12-2 assume !(10 == main_~i~0); 11318#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11317#L18-1 assume !!(main_~i~0 > 0); 11316#L12 assume !(1 == main_~i~0); 11315#L12-2 assume !(10 == main_~i~0); 11311#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11313#L18-1 assume !!(main_~i~0 > 0); 11312#L12 assume !(1 == main_~i~0); 11310#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 11156#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11171#L18-1 assume !!(main_~i~0 > 0); 11165#L12 assume !(1 == main_~i~0); 11166#L12-2 assume !(10 == main_~i~0); 11302#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11300#L18-1 assume !!(main_~i~0 > 0); 11298#L12 assume !(1 == main_~i~0); 11296#L12-2 assume !(10 == main_~i~0); 11294#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11292#L18-1 assume !!(main_~i~0 > 0); 11290#L12 assume !(1 == main_~i~0); 11288#L12-2 assume !(10 == main_~i~0); 11286#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11284#L18-1 assume !!(main_~i~0 > 0); 11282#L12 assume !(1 == main_~i~0); 11280#L12-2 assume !(10 == main_~i~0); 11278#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11276#L18-1 assume !!(main_~i~0 > 0); 11274#L12 assume !(1 == main_~i~0); 11272#L12-2 assume !(10 == main_~i~0); 11270#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11268#L18-1 assume !!(main_~i~0 > 0); 11266#L12 assume !(1 == main_~i~0); 11264#L12-2 assume !(10 == main_~i~0); 11262#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11260#L18-1 assume !!(main_~i~0 > 0); 11258#L12 assume !(1 == main_~i~0); 11256#L12-2 assume !(10 == main_~i~0); 11254#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11252#L18-1 assume !!(main_~i~0 > 0); 11250#L12 assume !(1 == main_~i~0); 11248#L12-2 assume !(10 == main_~i~0); 11246#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11242#L18-1 assume !!(main_~i~0 > 0); 11243#L12 assume 1 == main_~i~0;main_~up~0 := 1; 11205#L12-2 [2019-11-28 02:58:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:31,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1417622308, now seen corresponding path program 13 times [2019-11-28 02:58:31,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:31,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039328872] [2019-11-28 02:58:31,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:32,095 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 248 proven. 66 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:32,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039328872] [2019-11-28 02:58:32,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544400629] [2019-11-28 02:58:32,096 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:58:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:32,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:58:32,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 248 proven. 66 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:32,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:32,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-28 02:58:32,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527380882] [2019-11-28 02:58:32,153 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:32,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:32,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1315151238, now seen corresponding path program 13 times [2019-11-28 02:58:32,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:32,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658271700] [2019-11-28 02:58:32,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:32,166 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:32,422 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 57 [2019-11-28 02:58:32,438 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:32,438 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:32,439 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:32,439 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:32,439 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:32,439 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:32,439 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:32,439 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:32,439 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration20_Loop [2019-11-28 02:58:32,439 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:32,439 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:32,440 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:32,442 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:32,447 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:32,449 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:32,492 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:32,492 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) [2019-11-28 02:58:32,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:32,497 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:32,500 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:32,500 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_18=1} Honda state: {v_rep~unnamed0~0~true_18=1} 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:58:32,505 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:32,505 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:32,508 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:32,508 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: [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Exception during sending of exit command (exit): Broken pipe 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:58:32,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:32,513 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:32,516 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:32,516 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_18=0} Honda state: {v_rep~unnamed0~0~false_18=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:58:32,521 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:32,522 INFO L160 nArgumentSynthesizer]: Using integer mode. 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:58:32,529 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:32,529 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:32,532 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:32,533 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:32,533 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:32,533 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:32,534 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:32,534 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:32,534 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:32,534 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:32,534 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:32,534 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration20_Loop [2019-11-28 02:58:32,534 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:32,534 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:32,535 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:32,538 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:32,541 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:32,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:32,592 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:32,592 INFO L489 LassoAnalysis]: Using template 'affine'. 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:58:32,597 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:58:32,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:32,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:32,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:32,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:32,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:32,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:32,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:32,601 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 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:58:32,606 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:58:32,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:32,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:32,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:32,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:32,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:32,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:32,612 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 107 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 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:32,618 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:58:32,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:32,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:32,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:32,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:32,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:32,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:32,624 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 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:58:32,629 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:58:32,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:32,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:32,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:32,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:32,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:32,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:32,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:32,633 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:32,635 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:32,636 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 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:58:32,640 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:32,640 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:32,641 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:32,641 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:58:32,642 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:32,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:32,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:32,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:32,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:58:32,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:32,743 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:58:32,743 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 221 transitions. cyclomatic complexity: 39 Second operand 10 states. [2019-11-28 02:58:33,078 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 221 transitions. cyclomatic complexity: 39. Second operand 10 states. Result 834 states and 992 transitions. Complement of second has 31 states. [2019-11-28 02:58:33,079 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:58:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 02:58:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2019-11-28 02:58:33,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 63 letters. Loop has 60 letters. [2019-11-28 02:58:33,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:33,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 123 letters. Loop has 60 letters. [2019-11-28 02:58:33,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:33,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 63 letters. Loop has 120 letters. [2019-11-28 02:58:33,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:33,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 834 states and 992 transitions. [2019-11-28 02:58:33,085 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 64 [2019-11-28 02:58:33,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 834 states to 641 states and 752 transitions. [2019-11-28 02:58:33,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2019-11-28 02:58:33,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2019-11-28 02:58:33,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 641 states and 752 transitions. [2019-11-28 02:58:33,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:33,089 INFO L688 BuchiCegarLoop]: Abstraction has 641 states and 752 transitions. [2019-11-28 02:58:33,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states and 752 transitions. [2019-11-28 02:58:33,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 577. [2019-11-28 02:58:33,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-11-28 02:58:33,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 688 transitions. [2019-11-28 02:58:33,098 INFO L711 BuchiCegarLoop]: Abstraction has 577 states and 688 transitions. [2019-11-28 02:58:33,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:33,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:58:33,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:58:33,099 INFO L87 Difference]: Start difference. First operand 577 states and 688 transitions. Second operand 9 states. [2019-11-28 02:58:33,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:33,169 INFO L93 Difference]: Finished difference Result 255 states and 288 transitions. [2019-11-28 02:58:33,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:58:33,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 255 states and 288 transitions. [2019-11-28 02:58:33,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2019-11-28 02:58:33,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 255 states to 207 states and 240 transitions. [2019-11-28 02:58:33,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2019-11-28 02:58:33,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2019-11-28 02:58:33,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 240 transitions. [2019-11-28 02:58:33,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:33,172 INFO L688 BuchiCegarLoop]: Abstraction has 207 states and 240 transitions. [2019-11-28 02:58:33,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 240 transitions. [2019-11-28 02:58:33,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2019-11-28 02:58:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-28 02:58:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 233 transitions. [2019-11-28 02:58:33,175 INFO L711 BuchiCegarLoop]: Abstraction has 200 states and 233 transitions. [2019-11-28 02:58:33,175 INFO L591 BuchiCegarLoop]: Abstraction has 200 states and 233 transitions. [2019-11-28 02:58:33,175 INFO L424 BuchiCegarLoop]: ======== Iteration 21============ [2019-11-28 02:58:33,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 233 transitions. [2019-11-28 02:58:33,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-11-28 02:58:33,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:33,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:33,178 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [17, 15, 15, 9, 7, 2, 1, 1] [2019-11-28 02:58:33,178 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 9, 7, 1, 1] [2019-11-28 02:58:33,178 INFO L794 eck$LassoCheckResult]: Stem: 13646#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; 13647#L18-1 assume !!(main_~i~0 > 0); 13688#L12 assume 1 == main_~i~0;main_~up~0 := 1; 13687#L12-2 assume !(10 == main_~i~0); 13686#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13685#L18-1 assume !!(main_~i~0 > 0); 13684#L12 assume !(1 == main_~i~0); 13683#L12-2 assume !(10 == main_~i~0); 13682#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13681#L18-1 assume !!(main_~i~0 > 0); 13680#L12 assume !(1 == main_~i~0); 13679#L12-2 assume !(10 == main_~i~0); 13678#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13677#L18-1 assume !!(main_~i~0 > 0); 13676#L12 assume !(1 == main_~i~0); 13675#L12-2 assume !(10 == main_~i~0); 13674#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13673#L18-1 assume !!(main_~i~0 > 0); 13672#L12 assume !(1 == main_~i~0); 13671#L12-2 assume !(10 == main_~i~0); 13670#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13669#L18-1 assume !!(main_~i~0 > 0); 13668#L12 assume !(1 == main_~i~0); 13667#L12-2 assume !(10 == main_~i~0); 13666#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13665#L18-1 assume !!(main_~i~0 > 0); 13662#L12 assume !(1 == main_~i~0); 13664#L12-2 assume !(10 == main_~i~0); 13663#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13661#L18-1 assume !!(main_~i~0 > 0); 13660#L12 assume !(1 == main_~i~0); 13659#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 13654#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13655#L18-1 assume !!(main_~i~0 > 0); 13826#L12 assume !(1 == main_~i~0); 13825#L12-2 assume !(10 == main_~i~0); 13824#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13823#L18-1 assume !!(main_~i~0 > 0); 13815#L12 assume !(1 == main_~i~0); 13812#L12-2 assume !(10 == main_~i~0); 13809#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13806#L18-1 assume !!(main_~i~0 > 0); 13803#L12 assume !(1 == main_~i~0); 13800#L12-2 assume !(10 == main_~i~0); 13797#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13794#L18-1 assume !!(main_~i~0 > 0); 13791#L12 assume !(1 == main_~i~0); 13788#L12-2 assume !(10 == main_~i~0); 13785#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13782#L18-1 assume !!(main_~i~0 > 0); 13779#L12 assume !(1 == main_~i~0); 13776#L12-2 assume !(10 == main_~i~0); 13773#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13770#L18-1 assume !!(main_~i~0 > 0); 13767#L12 assume !(1 == main_~i~0); 13764#L12-2 assume !(10 == main_~i~0); 13761#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13758#L18-1 assume !!(main_~i~0 > 0); 13755#L12 assume !(1 == main_~i~0); 13752#L12-2 assume !(10 == main_~i~0); 13749#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13746#L18-1 assume !!(main_~i~0 > 0); 13743#L12 assume !(1 == main_~i~0); 13731#L12-2 assume !(10 == main_~i~0); 13739#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13736#L18-1 assume !!(main_~i~0 > 0); 13730#L12 assume 1 == main_~i~0;main_~up~0 := 1; 13642#L12-2 [2019-11-28 02:58:33,178 INFO L796 eck$LassoCheckResult]: Loop: 13642#L12-2 assume !(10 == main_~i~0); 13643#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13727#L18-1 assume !!(main_~i~0 > 0); 13726#L12 assume !(1 == main_~i~0); 13725#L12-2 assume !(10 == main_~i~0); 13724#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13723#L18-1 assume !!(main_~i~0 > 0); 13722#L12 assume !(1 == main_~i~0); 13721#L12-2 assume !(10 == main_~i~0); 13720#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13719#L18-1 assume !!(main_~i~0 > 0); 13718#L12 assume !(1 == main_~i~0); 13717#L12-2 assume !(10 == main_~i~0); 13716#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13715#L18-1 assume !!(main_~i~0 > 0); 13714#L12 assume !(1 == main_~i~0); 13713#L12-2 assume !(10 == main_~i~0); 13712#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13711#L18-1 assume !!(main_~i~0 > 0); 13710#L12 assume !(1 == main_~i~0); 13709#L12-2 assume !(10 == main_~i~0); 13708#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13707#L18-1 assume !!(main_~i~0 > 0); 13706#L12 assume !(1 == main_~i~0); 13705#L12-2 assume !(10 == main_~i~0); 13697#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13702#L18-1 assume !!(main_~i~0 > 0); 13699#L12 assume !(1 == main_~i~0); 13696#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 13657#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13658#L18-1 assume !!(main_~i~0 > 0); 13652#L12 assume !(1 == main_~i~0); 13653#L12-2 assume !(10 == main_~i~0); 13695#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13818#L18-1 assume !!(main_~i~0 > 0); 13816#L12 assume !(1 == main_~i~0); 13813#L12-2 assume !(10 == main_~i~0); 13810#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13807#L18-1 assume !!(main_~i~0 > 0); 13804#L12 assume !(1 == main_~i~0); 13801#L12-2 assume !(10 == main_~i~0); 13798#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13795#L18-1 assume !!(main_~i~0 > 0); 13792#L12 assume !(1 == main_~i~0); 13789#L12-2 assume !(10 == main_~i~0); 13786#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13783#L18-1 assume !!(main_~i~0 > 0); 13780#L12 assume !(1 == main_~i~0); 13777#L12-2 assume !(10 == main_~i~0); 13774#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13771#L18-1 assume !!(main_~i~0 > 0); 13768#L12 assume !(1 == main_~i~0); 13765#L12-2 assume !(10 == main_~i~0); 13762#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13759#L18-1 assume !!(main_~i~0 > 0); 13756#L12 assume !(1 == main_~i~0); 13753#L12-2 assume !(10 == main_~i~0); 13750#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13747#L18-1 assume !!(main_~i~0 > 0); 13744#L12 assume !(1 == main_~i~0); 13733#L12-2 assume !(10 == main_~i~0); 13740#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13737#L18-1 assume !!(main_~i~0 > 0); 13732#L12 assume 1 == main_~i~0;main_~up~0 := 1; 13642#L12-2 [2019-11-28 02:58:33,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:33,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1714987717, now seen corresponding path program 14 times [2019-11-28 02:58:33,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:33,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323156354] [2019-11-28 02:58:33,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:33,245 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 285 proven. 91 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:33,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323156354] [2019-11-28 02:58:33,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680116542] [2019-11-28 02:58:33,245 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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:33,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:58:33,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:33,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:58:33,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 285 proven. 91 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:33,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:33,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-28 02:58:33,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047351807] [2019-11-28 02:58:33,294 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:33,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:33,295 INFO L82 PathProgramCache]: Analyzing trace with hash 590625123, now seen corresponding path program 14 times [2019-11-28 02:58:33,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:33,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497599851] [2019-11-28 02:58:33,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:33,307 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:33,638 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 60 [2019-11-28 02:58:33,647 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:33,647 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:33,648 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:33,648 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:33,648 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:33,648 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,648 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:33,648 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:33,648 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration21_Loop [2019-11-28 02:58:33,648 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:33,649 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:33,650 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:33,658 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:33,661 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:33,663 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:33,708 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:33,708 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2019-11-28 02:58:33,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:33,713 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,717 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:33,717 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 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:33,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:33,723 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,727 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:33,727 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_20=0} Honda state: {v_rep~unnamed0~0~false_20=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2019-11-28 02:58:33,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:33,734 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,739 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:33,739 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_20=1} Honda state: {v_rep~unnamed0~0~true_20=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2019-11-28 02:58:33,746 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:33,746 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 114 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 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:33,756 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:33,756 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,762 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:33,764 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:33,764 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:33,764 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:33,764 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:33,764 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:33,764 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,764 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:33,764 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:33,764 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration21_Loop [2019-11-28 02:58:33,765 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:33,765 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:33,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:33,771 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:33,776 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:33,782 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:33,834 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:33,834 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 02:58:33,840 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:58:33,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:33,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:33,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:33,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:33,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:33,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:33,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 116 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,845 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 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:33,854 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:58:33,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:33,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:33,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:33,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:33,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:33,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,861 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 118 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:33,870 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:58:33,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:33,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:33,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:33,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:33,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:33,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 118 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,879 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 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:33,886 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:58:33,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:33,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:33,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:33,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:33,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:33,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:33,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:33,892 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:33,894 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 02:58:33,894 INFO L444 ModelExtractionUtils]: 1 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 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:58:33,897 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:33,897 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:33,898 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:33,898 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:58:33,899 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:33,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:33,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:33,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:33,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:58:33,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 344 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:34,012 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:58:34,012 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 233 transitions. cyclomatic complexity: 39 Second operand 11 states. [2019-11-28 02:58:34,436 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 200 states and 233 transitions. cyclomatic complexity: 39. Second operand 11 states. Result 982 states and 1168 transitions. Complement of second has 35 states. [2019-11-28 02:58:34,436 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:58:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 02:58:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2019-11-28 02:58:34,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 67 letters. Loop has 64 letters. [2019-11-28 02:58:34,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:34,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 131 letters. Loop has 64 letters. [2019-11-28 02:58:34,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:34,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 67 letters. Loop has 128 letters. [2019-11-28 02:58:34,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:34,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 982 states and 1168 transitions. [2019-11-28 02:58:34,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 68 [2019-11-28 02:58:34,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 982 states to 731 states and 858 transitions. [2019-11-28 02:58:34,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2019-11-28 02:58:34,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2019-11-28 02:58:34,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 731 states and 858 transitions. [2019-11-28 02:58:34,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:34,458 INFO L688 BuchiCegarLoop]: Abstraction has 731 states and 858 transitions. [2019-11-28 02:58:34,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states and 858 transitions. [2019-11-28 02:58:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 657. [2019-11-28 02:58:34,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-11-28 02:58:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 784 transitions. [2019-11-28 02:58:34,472 INFO L711 BuchiCegarLoop]: Abstraction has 657 states and 784 transitions. [2019-11-28 02:58:34,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:34,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:58:34,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:58:34,473 INFO L87 Difference]: Start difference. First operand 657 states and 784 transitions. Second operand 10 states. [2019-11-28 02:58:34,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:34,543 INFO L93 Difference]: Finished difference Result 275 states and 308 transitions. [2019-11-28 02:58:34,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:58:34,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 308 transitions. [2019-11-28 02:58:34,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2019-11-28 02:58:34,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 219 states and 252 transitions. [2019-11-28 02:58:34,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2019-11-28 02:58:34,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2019-11-28 02:58:34,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 252 transitions. [2019-11-28 02:58:34,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:34,553 INFO L688 BuchiCegarLoop]: Abstraction has 219 states and 252 transitions. [2019-11-28 02:58:34,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 252 transitions. [2019-11-28 02:58:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 212. [2019-11-28 02:58:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-28 02:58:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 245 transitions. [2019-11-28 02:58:34,557 INFO L711 BuchiCegarLoop]: Abstraction has 212 states and 245 transitions. [2019-11-28 02:58:34,557 INFO L591 BuchiCegarLoop]: Abstraction has 212 states and 245 transitions. [2019-11-28 02:58:34,557 INFO L424 BuchiCegarLoop]: ======== Iteration 22============ [2019-11-28 02:58:34,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 212 states and 245 transitions. [2019-11-28 02:58:34,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2019-11-28 02:58:34,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:34,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:34,559 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [18, 16, 16, 9, 8, 2, 1, 1] [2019-11-28 02:58:34,560 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 9, 8, 1, 1] [2019-11-28 02:58:34,560 INFO L794 eck$LassoCheckResult]: Stem: 16438#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; 16439#L18-1 assume !!(main_~i~0 > 0); 16484#L12 assume 1 == main_~i~0;main_~up~0 := 1; 16483#L12-2 assume !(10 == main_~i~0); 16482#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16481#L18-1 assume !!(main_~i~0 > 0); 16480#L12 assume !(1 == main_~i~0); 16479#L12-2 assume !(10 == main_~i~0); 16478#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16477#L18-1 assume !!(main_~i~0 > 0); 16476#L12 assume !(1 == main_~i~0); 16475#L12-2 assume !(10 == main_~i~0); 16474#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16473#L18-1 assume !!(main_~i~0 > 0); 16472#L12 assume !(1 == main_~i~0); 16471#L12-2 assume !(10 == main_~i~0); 16470#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16469#L18-1 assume !!(main_~i~0 > 0); 16468#L12 assume !(1 == main_~i~0); 16467#L12-2 assume !(10 == main_~i~0); 16466#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16465#L18-1 assume !!(main_~i~0 > 0); 16464#L12 assume !(1 == main_~i~0); 16463#L12-2 assume !(10 == main_~i~0); 16462#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16461#L18-1 assume !!(main_~i~0 > 0); 16460#L12 assume !(1 == main_~i~0); 16459#L12-2 assume !(10 == main_~i~0); 16458#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16457#L18-1 assume !!(main_~i~0 > 0); 16454#L12 assume !(1 == main_~i~0); 16456#L12-2 assume !(10 == main_~i~0); 16455#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16453#L18-1 assume !!(main_~i~0 > 0); 16452#L12 assume !(1 == main_~i~0); 16451#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 16446#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16447#L18-1 assume !!(main_~i~0 > 0); 16621#L12 assume !(1 == main_~i~0); 16620#L12-2 assume !(10 == main_~i~0); 16619#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16618#L18-1 assume !!(main_~i~0 > 0); 16616#L12 assume !(1 == main_~i~0); 16613#L12-2 assume !(10 == main_~i~0); 16610#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16607#L18-1 assume !!(main_~i~0 > 0); 16604#L12 assume !(1 == main_~i~0); 16601#L12-2 assume !(10 == main_~i~0); 16598#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16595#L18-1 assume !!(main_~i~0 > 0); 16592#L12 assume !(1 == main_~i~0); 16589#L12-2 assume !(10 == main_~i~0); 16586#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16583#L18-1 assume !!(main_~i~0 > 0); 16580#L12 assume !(1 == main_~i~0); 16577#L12-2 assume !(10 == main_~i~0); 16574#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16571#L18-1 assume !!(main_~i~0 > 0); 16568#L12 assume !(1 == main_~i~0); 16565#L12-2 assume !(10 == main_~i~0); 16562#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16559#L18-1 assume !!(main_~i~0 > 0); 16556#L12 assume !(1 == main_~i~0); 16553#L12-2 assume !(10 == main_~i~0); 16550#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16547#L18-1 assume !!(main_~i~0 > 0); 16544#L12 assume !(1 == main_~i~0); 16533#L12-2 assume !(10 == main_~i~0); 16540#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16537#L18-1 assume !!(main_~i~0 > 0); 16532#L12 assume 1 == main_~i~0;main_~up~0 := 1; 16434#L12-2 [2019-11-28 02:58:34,560 INFO L796 eck$LassoCheckResult]: Loop: 16434#L12-2 assume !(10 == main_~i~0); 16435#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16527#L18-1 assume !!(main_~i~0 > 0); 16526#L12 assume !(1 == main_~i~0); 16525#L12-2 assume !(10 == main_~i~0); 16524#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16523#L18-1 assume !!(main_~i~0 > 0); 16522#L12 assume !(1 == main_~i~0); 16521#L12-2 assume !(10 == main_~i~0); 16520#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16519#L18-1 assume !!(main_~i~0 > 0); 16518#L12 assume !(1 == main_~i~0); 16517#L12-2 assume !(10 == main_~i~0); 16516#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16515#L18-1 assume !!(main_~i~0 > 0); 16514#L12 assume !(1 == main_~i~0); 16513#L12-2 assume !(10 == main_~i~0); 16512#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16511#L18-1 assume !!(main_~i~0 > 0); 16510#L12 assume !(1 == main_~i~0); 16509#L12-2 assume !(10 == main_~i~0); 16508#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16507#L18-1 assume !!(main_~i~0 > 0); 16506#L12 assume !(1 == main_~i~0); 16505#L12-2 assume !(10 == main_~i~0); 16504#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16503#L18-1 assume !!(main_~i~0 > 0); 16502#L12 assume !(1 == main_~i~0); 16501#L12-2 assume !(10 == main_~i~0); 16493#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16498#L18-1 assume !!(main_~i~0 > 0); 16495#L12 assume !(1 == main_~i~0); 16492#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 16449#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16450#L18-1 assume !!(main_~i~0 > 0); 16444#L12 assume !(1 == main_~i~0); 16445#L12-2 assume !(10 == main_~i~0); 16491#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16617#L18-1 assume !!(main_~i~0 > 0); 16615#L12 assume !(1 == main_~i~0); 16612#L12-2 assume !(10 == main_~i~0); 16609#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16606#L18-1 assume !!(main_~i~0 > 0); 16603#L12 assume !(1 == main_~i~0); 16600#L12-2 assume !(10 == main_~i~0); 16597#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16594#L18-1 assume !!(main_~i~0 > 0); 16591#L12 assume !(1 == main_~i~0); 16588#L12-2 assume !(10 == main_~i~0); 16585#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16582#L18-1 assume !!(main_~i~0 > 0); 16579#L12 assume !(1 == main_~i~0); 16576#L12-2 assume !(10 == main_~i~0); 16573#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16570#L18-1 assume !!(main_~i~0 > 0); 16567#L12 assume !(1 == main_~i~0); 16564#L12-2 assume !(10 == main_~i~0); 16561#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16558#L18-1 assume !!(main_~i~0 > 0); 16555#L12 assume !(1 == main_~i~0); 16552#L12-2 assume !(10 == main_~i~0); 16549#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16546#L18-1 assume !!(main_~i~0 > 0); 16543#L12 assume !(1 == main_~i~0); 16531#L12-2 assume !(10 == main_~i~0); 16539#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16536#L18-1 assume !!(main_~i~0 > 0); 16530#L12 assume 1 == main_~i~0;main_~up~0 := 1; 16434#L12-2 [2019-11-28 02:58:34,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:34,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1278125010, now seen corresponding path program 15 times [2019-11-28 02:58:34,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:34,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767114534] [2019-11-28 02:58:34,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 322 proven. 120 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:34,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767114534] [2019-11-28 02:58:34,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122458236] [2019-11-28 02:58:34,655 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 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:34,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-11-28 02:58:34,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:34,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 02:58:34,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 322 proven. 226 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-28 02:58:34,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:34,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-28 02:58:34,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011780942] [2019-11-28 02:58:34,718 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:34,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:34,719 INFO L82 PathProgramCache]: Analyzing trace with hash -976981044, now seen corresponding path program 15 times [2019-11-28 02:58:34,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:34,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198347901] [2019-11-28 02:58:34,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:34,734 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:35,047 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 63 [2019-11-28 02:58:35,060 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:35,061 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:35,061 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:35,061 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:35,061 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:35,061 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,061 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:35,061 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:35,061 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration22_Loop [2019-11-28 02:58:35,061 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:35,062 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:35,062 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:35,069 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:35,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:35,072 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:35,125 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:35,125 INFO L404 LassoAnalysis]: Checking for nontermination... 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:58:35,130 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:35,130 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:35,133 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:35,133 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 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:35,144 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:35,144 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,147 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:35,147 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_22=0} Honda state: {v_rep~unnamed0~0~false_22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:58:35,153 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:35,153 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:35,155 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:35,155 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_22=1} Honda state: {v_rep~unnamed0~0~true_22=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:58:35,161 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:35,161 INFO L160 nArgumentSynthesizer]: Using integer mode. 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:58:35,169 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:35,169 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:35,174 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:35,175 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:35,175 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:35,175 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:35,176 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:35,176 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:35,176 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,176 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:35,176 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:35,176 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration22_Loop [2019-11-28 02:58:35,176 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:35,176 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:35,177 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:35,184 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:35,186 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:35,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:35,239 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:35,239 INFO L489 LassoAnalysis]: Using template 'affine'. 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:58:35,244 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:58:35,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:35,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:35,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:35,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:35,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:35,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:35,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:35,249 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 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:58:35,255 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:58:35,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:35,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:35,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:35,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:35,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:35,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:35,260 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 129 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 129 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,267 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:58:35,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:35,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:35,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:35,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:35,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:35,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:35,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:35,271 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:35,273 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:35,274 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 130 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 130 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:35,278 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:35,278 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:35,278 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:35,278 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:58:35,280 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:35,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:35,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:35,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:35,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 02:58:35,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 02:58:35,407 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:58:35,407 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 212 states and 245 transitions. cyclomatic complexity: 39 Second operand 12 states. [2019-11-28 02:58:35,873 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 212 states and 245 transitions. cyclomatic complexity: 39. Second operand 12 states. Result 1146 states and 1366 transitions. Complement of second has 39 states. [2019-11-28 02:58:35,873 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:58:35,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 02:58:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 89 transitions. [2019-11-28 02:58:35,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 71 letters. Loop has 68 letters. [2019-11-28 02:58:35,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:35,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 139 letters. Loop has 68 letters. [2019-11-28 02:58:35,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:35,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 71 letters. Loop has 136 letters. [2019-11-28 02:58:35,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:35,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1146 states and 1366 transitions. [2019-11-28 02:58:35,883 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 72 [2019-11-28 02:58:35,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1146 states to 829 states and 976 transitions. [2019-11-28 02:58:35,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2019-11-28 02:58:35,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 158 [2019-11-28 02:58:35,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 829 states and 976 transitions. [2019-11-28 02:58:35,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:35,889 INFO L688 BuchiCegarLoop]: Abstraction has 829 states and 976 transitions. [2019-11-28 02:58:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states and 976 transitions. [2019-11-28 02:58:35,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 745. [2019-11-28 02:58:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-11-28 02:58:35,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 890 transitions. [2019-11-28 02:58:35,898 INFO L711 BuchiCegarLoop]: Abstraction has 745 states and 890 transitions. [2019-11-28 02:58:35,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:35,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:58:35,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:58:35,899 INFO L87 Difference]: Start difference. First operand 745 states and 890 transitions. Second operand 12 states. [2019-11-28 02:58:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:35,952 INFO L93 Difference]: Finished difference Result 295 states and 328 transitions. [2019-11-28 02:58:35,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:58:35,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 295 states and 328 transitions. [2019-11-28 02:58:35,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2019-11-28 02:58:35,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 295 states to 231 states and 264 transitions. [2019-11-28 02:58:35,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-11-28 02:58:35,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2019-11-28 02:58:35,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 231 states and 264 transitions. [2019-11-28 02:58:35,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:35,956 INFO L688 BuchiCegarLoop]: Abstraction has 231 states and 264 transitions. [2019-11-28 02:58:35,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 264 transitions. [2019-11-28 02:58:35,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2019-11-28 02:58:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-28 02:58:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 257 transitions. [2019-11-28 02:58:35,960 INFO L711 BuchiCegarLoop]: Abstraction has 224 states and 257 transitions. [2019-11-28 02:58:35,960 INFO L591 BuchiCegarLoop]: Abstraction has 224 states and 257 transitions. [2019-11-28 02:58:35,960 INFO L424 BuchiCegarLoop]: ======== Iteration 23============ [2019-11-28 02:58:35,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 224 states and 257 transitions. [2019-11-28 02:58:35,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2019-11-28 02:58:35,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:35,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:35,963 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [19, 17, 17, 9, 9, 2, 1, 1] [2019-11-28 02:58:35,963 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2019-11-28 02:58:35,963 INFO L794 eck$LassoCheckResult]: Stem: 19560#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; 19561#L18-1 assume !!(main_~i~0 > 0); 19610#L12 assume 1 == main_~i~0;main_~up~0 := 1; 19609#L12-2 assume !(10 == main_~i~0); 19608#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19607#L18-1 assume !!(main_~i~0 > 0); 19606#L12 assume !(1 == main_~i~0); 19605#L12-2 assume !(10 == main_~i~0); 19604#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19603#L18-1 assume !!(main_~i~0 > 0); 19602#L12 assume !(1 == main_~i~0); 19601#L12-2 assume !(10 == main_~i~0); 19600#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19599#L18-1 assume !!(main_~i~0 > 0); 19598#L12 assume !(1 == main_~i~0); 19597#L12-2 assume !(10 == main_~i~0); 19596#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19595#L18-1 assume !!(main_~i~0 > 0); 19594#L12 assume !(1 == main_~i~0); 19593#L12-2 assume !(10 == main_~i~0); 19592#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19591#L18-1 assume !!(main_~i~0 > 0); 19590#L12 assume !(1 == main_~i~0); 19589#L12-2 assume !(10 == main_~i~0); 19588#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19587#L18-1 assume !!(main_~i~0 > 0); 19586#L12 assume !(1 == main_~i~0); 19585#L12-2 assume !(10 == main_~i~0); 19584#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19583#L18-1 assume !!(main_~i~0 > 0); 19582#L12 assume !(1 == main_~i~0); 19581#L12-2 assume !(10 == main_~i~0); 19580#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19579#L18-1 assume !!(main_~i~0 > 0); 19576#L12 assume !(1 == main_~i~0); 19578#L12-2 assume !(10 == main_~i~0); 19577#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19575#L18-1 assume !!(main_~i~0 > 0); 19574#L12 assume !(1 == main_~i~0); 19573#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 19568#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19569#L18-1 assume !!(main_~i~0 > 0); 19751#L12 assume !(1 == main_~i~0); 19750#L12-2 assume !(10 == main_~i~0); 19749#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19748#L18-1 assume !!(main_~i~0 > 0); 19746#L12 assume !(1 == main_~i~0); 19743#L12-2 assume !(10 == main_~i~0); 19740#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19737#L18-1 assume !!(main_~i~0 > 0); 19734#L12 assume !(1 == main_~i~0); 19731#L12-2 assume !(10 == main_~i~0); 19728#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19725#L18-1 assume !!(main_~i~0 > 0); 19722#L12 assume !(1 == main_~i~0); 19719#L12-2 assume !(10 == main_~i~0); 19716#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19713#L18-1 assume !!(main_~i~0 > 0); 19710#L12 assume !(1 == main_~i~0); 19707#L12-2 assume !(10 == main_~i~0); 19704#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19701#L18-1 assume !!(main_~i~0 > 0); 19698#L12 assume !(1 == main_~i~0); 19695#L12-2 assume !(10 == main_~i~0); 19692#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19689#L18-1 assume !!(main_~i~0 > 0); 19686#L12 assume !(1 == main_~i~0); 19683#L12-2 assume !(10 == main_~i~0); 19680#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19677#L18-1 assume !!(main_~i~0 > 0); 19674#L12 assume !(1 == main_~i~0); 19663#L12-2 assume !(10 == main_~i~0); 19670#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19667#L18-1 assume !!(main_~i~0 > 0); 19662#L12 assume 1 == main_~i~0;main_~up~0 := 1; 19556#L12-2 [2019-11-28 02:58:35,964 INFO L796 eck$LassoCheckResult]: Loop: 19556#L12-2 assume !(10 == main_~i~0); 19557#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19657#L18-1 assume !!(main_~i~0 > 0); 19656#L12 assume !(1 == main_~i~0); 19655#L12-2 assume !(10 == main_~i~0); 19654#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19653#L18-1 assume !!(main_~i~0 > 0); 19652#L12 assume !(1 == main_~i~0); 19651#L12-2 assume !(10 == main_~i~0); 19650#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19649#L18-1 assume !!(main_~i~0 > 0); 19648#L12 assume !(1 == main_~i~0); 19647#L12-2 assume !(10 == main_~i~0); 19646#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19645#L18-1 assume !!(main_~i~0 > 0); 19644#L12 assume !(1 == main_~i~0); 19643#L12-2 assume !(10 == main_~i~0); 19642#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19641#L18-1 assume !!(main_~i~0 > 0); 19640#L12 assume !(1 == main_~i~0); 19639#L12-2 assume !(10 == main_~i~0); 19638#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19637#L18-1 assume !!(main_~i~0 > 0); 19636#L12 assume !(1 == main_~i~0); 19635#L12-2 assume !(10 == main_~i~0); 19634#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19633#L18-1 assume !!(main_~i~0 > 0); 19632#L12 assume !(1 == main_~i~0); 19631#L12-2 assume !(10 == main_~i~0); 19630#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19629#L18-1 assume !!(main_~i~0 > 0); 19628#L12 assume !(1 == main_~i~0); 19627#L12-2 assume !(10 == main_~i~0); 19625#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 19623#L18-1 assume !!(main_~i~0 > 0); 19618#L12 assume !(1 == main_~i~0); 19619#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 19571#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19572#L18-1 assume !!(main_~i~0 > 0); 19566#L12 assume !(1 == main_~i~0); 19567#L12-2 assume !(10 == main_~i~0); 19617#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19747#L18-1 assume !!(main_~i~0 > 0); 19745#L12 assume !(1 == main_~i~0); 19742#L12-2 assume !(10 == main_~i~0); 19739#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19736#L18-1 assume !!(main_~i~0 > 0); 19733#L12 assume !(1 == main_~i~0); 19730#L12-2 assume !(10 == main_~i~0); 19727#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19724#L18-1 assume !!(main_~i~0 > 0); 19721#L12 assume !(1 == main_~i~0); 19718#L12-2 assume !(10 == main_~i~0); 19715#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19712#L18-1 assume !!(main_~i~0 > 0); 19709#L12 assume !(1 == main_~i~0); 19706#L12-2 assume !(10 == main_~i~0); 19703#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19700#L18-1 assume !!(main_~i~0 > 0); 19697#L12 assume !(1 == main_~i~0); 19694#L12-2 assume !(10 == main_~i~0); 19691#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19688#L18-1 assume !!(main_~i~0 > 0); 19685#L12 assume !(1 == main_~i~0); 19682#L12-2 assume !(10 == main_~i~0); 19679#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19676#L18-1 assume !!(main_~i~0 > 0); 19673#L12 assume !(1 == main_~i~0); 19661#L12-2 assume !(10 == main_~i~0); 19669#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 19666#L18-1 assume !!(main_~i~0 > 0); 19660#L12 assume 1 == main_~i~0;main_~up~0 := 1; 19556#L12-2 [2019-11-28 02:58:35,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:35,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1439876841, now seen corresponding path program 16 times [2019-11-28 02:58:35,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:35,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048576836] [2019-11-28 02:58:35,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:35,979 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:35,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:35,979 INFO L82 PathProgramCache]: Analyzing trace with hash -680570443, now seen corresponding path program 16 times [2019-11-28 02:58:35,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:35,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206215425] [2019-11-28 02:58:35,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:35,993 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:35,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:35,994 INFO L82 PathProgramCache]: Analyzing trace with hash -569285429, now seen corresponding path program 17 times [2019-11-28 02:58:35,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:35,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668017246] [2019-11-28 02:58:35,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:36,020 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:36,331 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 66 [2019-11-28 02:58:36,692 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 69 [2019-11-28 02:58:36,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 02:58:36 BoogieIcfgContainer [2019-11-28 02:58:36,729 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 02:58:36,729 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:58:36,729 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:58:36,730 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:58:36,730 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:21" (3/4) ... [2019-11-28 02:58:36,733 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 02:58:36,803 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:58:36,803 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:58:36,805 INFO L168 Benchmark]: Toolchain (without parser) took 15430.60 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 378.5 MB). Free memory was 957.7 MB in the beginning and 960.4 MB in the end (delta: -2.8 MB). Peak memory consumption was 375.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:58:36,805 INFO L168 Benchmark]: CDTParser took 0.19 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:58:36,806 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.62 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:58:36,806 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.69 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:58:36,806 INFO L168 Benchmark]: Boogie Preprocessor took 71.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:58:36,807 INFO L168 Benchmark]: RCFGBuilder took 193.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:58:36,807 INFO L168 Benchmark]: BuchiAutomizer took 14809.96 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 260.6 MB). Free memory was 1.1 GB in the beginning and 960.4 MB in the end (delta: 135.9 MB). Peak memory consumption was 396.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:58:36,807 INFO L168 Benchmark]: Witness Printer took 74.26 ms. Allocated memory is still 1.4 GB. Free memory is still 960.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:58:36,809 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.19 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 242.62 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.69 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 193.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14809.96 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 260.6 MB). Free memory was 1.1 GB in the beginning and 960.4 MB in the end (delta: 135.9 MB). Peak memory consumption was 396.4 MB. Max. memory is 11.5 GB. * Witness Printer took 74.26 ms. Allocated memory is still 1.4 GB. Free memory is still 960.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 31 terminating modules (20 trivial, 11 deterministic, 0 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 + 3 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 21 and consists of 5 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 14 locations. One deterministic module has affine ranking function i and consists of 10 locations. One deterministic module has affine ranking function i and consists of 12 locations. One deterministic module has affine ranking function i and consists of 14 locations. One deterministic module has affine ranking function i and consists of 16 locations. One deterministic module has affine ranking function i and consists of 18 locations. One deterministic module has affine ranking function i and consists of 20 locations. 20 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 224 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.7s and 23 iterations. TraceHistogramMax:19. Analysis of lassos took 9.7s. Construction of modules took 1.5s. Büchi inclusion checks took 2.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 29. Automata minimization 0.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 585 StatesRemovedByMinimization, 28 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 224 states and ocurred in iteration 22. Nontrivial modules had stage [11, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 952/2604 HoareTripleCheckerStatistics: 204 SDtfs, 627 SDslu, 6 SDs, 0 SdLazy, 1859 SolverSat, 210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT1 conc0 concLT1 SILN0 SILU0 SILI9 SILT8 lasso1 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax180 hnf100 lsp35 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq198 hnf89 smp97 dnf110 smp98 tf111 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 93ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 32 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 11 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - 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=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a0b05c9=0, \result=0, i=1} - 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 i > 0 [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 Loop: [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...