./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Narrowing.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/Narrowing.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 30c1dcaa423edd95f50127b236ab2e09f14129f4 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:35:44,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:35:44,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:35:44,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:35:44,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:35:44,571 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:35:44,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:35:44,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:35:44,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:35:44,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:35:44,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:35:44,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:35:44,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:35:44,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:35:44,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:35:44,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:35:44,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:35:44,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:35:44,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:35:44,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:35:44,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:35:44,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:35:44,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:35:44,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:35:44,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:35:44,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:35:44,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:35:44,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:35:44,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:35:44,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:35:44,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:35:44,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:35:44,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:35:44,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:35:44,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:35:44,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:35:44,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:35:44,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:35:44,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:35:44,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:35:44,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:35:44,656 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:35:44,681 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:35:44,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:35:44,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:35:44,683 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:35:44,683 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:35:44,684 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:35:44,684 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:35:44,684 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:35:44,684 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:35:44,685 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:35:44,685 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:35:44,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:35:44,686 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:35:44,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:35:44,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:35:44,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:35:44,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:35:44,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:35:44,687 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:35:44,687 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:35:44,687 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:35:44,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:35:44,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:35:44,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:35:44,688 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:35:44,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:35:44,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:35:44,689 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:35:44,689 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:35:44,690 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:35:44,691 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 -> 30c1dcaa423edd95f50127b236ab2e09f14129f4 [2020-10-20 06:35:44,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:35:44,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:35:44,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:35:44,916 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:35:44,917 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:35:44,918 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Narrowing.c [2020-10-20 06:35:45,001 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d0aaea0/48d56ab0f37a49d4a42b0d8df58d6ee8/FLAGb1f3addca [2020-10-20 06:35:45,541 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:35:45,541 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2020-10-20 06:35:45,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d0aaea0/48d56ab0f37a49d4a42b0d8df58d6ee8/FLAGb1f3addca [2020-10-20 06:35:45,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d0aaea0/48d56ab0f37a49d4a42b0d8df58d6ee8 [2020-10-20 06:35:45,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:35:45,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:35:45,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:35:45,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:35:45,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:35:45,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:35:45" (1/1) ... [2020-10-20 06:35:45,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64005373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:35:45, skipping insertion in model container [2020-10-20 06:35:45,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:35:45" (1/1) ... [2020-10-20 06:35:45,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:35:45,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:35:46,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:35:46,066 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:35:46,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:35:46,106 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:35:46,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:35:46 WrapperNode [2020-10-20 06:35:46,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:35:46,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:35:46,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:35:46,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:35:46,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:35:46" (1/1) ... [2020-10-20 06:35:46,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:35:46" (1/1) ... [2020-10-20 06:35:46,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:35:46,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:35:46,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:35:46,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:35:46,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:35:46" (1/1) ... [2020-10-20 06:35:46,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:35:46" (1/1) ... [2020-10-20 06:35:46,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:35:46" (1/1) ... [2020-10-20 06:35:46,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:35:46" (1/1) ... [2020-10-20 06:35:46,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:35:46" (1/1) ... [2020-10-20 06:35:46,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:35:46" (1/1) ... [2020-10-20 06:35:46,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:35:46" (1/1) ... [2020-10-20 06:35:46,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:35:46,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:35:46,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:35:46,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:35:46,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:35:46" (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 [2020-10-20 06:35:46,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:35:46,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:35:46,390 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:35:46,391 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-10-20 06:35:46,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:35:46 BoogieIcfgContainer [2020-10-20 06:35:46,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:35:46,393 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:35:46,393 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:35:46,397 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:35:46,398 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:35:46,398 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:35:45" (1/3) ... [2020-10-20 06:35:46,399 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@725e1f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:35:46, skipping insertion in model container [2020-10-20 06:35:46,400 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:35:46,400 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:35:46" (2/3) ... [2020-10-20 06:35:46,400 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@725e1f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:35:46, skipping insertion in model container [2020-10-20 06:35:46,400 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:35:46,400 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:35:46" (3/3) ... [2020-10-20 06:35:46,402 INFO L373 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2020-10-20 06:35:46,462 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:35:46,463 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:35:46,463 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:35:46,463 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:35:46,463 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:35:46,463 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:35:46,463 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:35:46,463 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:35:46,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-10-20 06:35:46,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-20 06:35:46,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:46,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:46,511 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-10-20 06:35:46,511 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:35:46,511 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:35:46,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-10-20 06:35:46,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-20 06:35:46,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:46,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:46,513 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-10-20 06:35:46,513 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:35:46,522 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 13#L26-1true [2020-10-20 06:35:46,523 INFO L796 eck$LassoCheckResult]: Loop: 13#L26-1true assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12#L14true assume 0 == main_~i~0;main_~up~0 := 1; 8#L14-2true assume main_~i~0 == main_~range~0;main_~up~0 := 0; 5#L17-1true assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11#L20-1true assume !(0 == main_~up~0); 7#L23-1true assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13#L26-1true [2020-10-20 06:35:46,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:46,530 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-10-20 06:35:46,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:46,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506949965] [2020-10-20 06:35:46,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:46,618 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:46,623 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:46,642 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:46,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:46,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1186392078, now seen corresponding path program 1 times [2020-10-20 06:35:46,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:46,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994806845] [2020-10-20 06:35:46,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:46,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994806845] [2020-10-20 06:35:46,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:35:46,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:35:46,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156031790] [2020-10-20 06:35:46,728 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:35:46,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:46,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:35:46,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:35:46,750 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2020-10-20 06:35:46,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:46,791 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2020-10-20 06:35:46,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:35:46,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2020-10-20 06:35:46,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-20 06:35:46,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 13 states and 22 transitions. [2020-10-20 06:35:46,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 06:35:46,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 06:35:46,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 22 transitions. [2020-10-20 06:35:46,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:35:46,813 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 22 transitions. [2020-10-20 06:35:46,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 22 transitions. [2020-10-20 06:35:46,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-20 06:35:46,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-20 06:35:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 22 transitions. [2020-10-20 06:35:46,856 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 22 transitions. [2020-10-20 06:35:46,856 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 22 transitions. [2020-10-20 06:35:46,857 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:35:46,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 22 transitions. [2020-10-20 06:35:46,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-20 06:35:46,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:46,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:46,860 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-10-20 06:35:46,860 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:35:46,860 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 42#L26-1 [2020-10-20 06:35:46,861 INFO L796 eck$LassoCheckResult]: Loop: 42#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 47#L14 assume 0 == main_~i~0;main_~up~0 := 1; 48#L14-2 assume !(main_~i~0 == main_~range~0); 49#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 50#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 45#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 42#L26-1 [2020-10-20 06:35:46,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:46,861 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2020-10-20 06:35:46,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:46,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105094873] [2020-10-20 06:35:46,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:46,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:46,872 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:46,873 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:46,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:46,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1186451598, now seen corresponding path program 1 times [2020-10-20 06:35:46,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:46,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894934340] [2020-10-20 06:35:46,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:46,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894934340] [2020-10-20 06:35:46,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:35:46,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:35:46,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82653844] [2020-10-20 06:35:46,909 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:35:46,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:46,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:35:46,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:35:46,910 INFO L87 Difference]: Start difference. First operand 13 states and 22 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-10-20 06:35:46,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:46,972 INFO L93 Difference]: Finished difference Result 13 states and 21 transitions. [2020-10-20 06:35:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:35:46,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 21 transitions. [2020-10-20 06:35:46,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-20 06:35:46,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 21 transitions. [2020-10-20 06:35:46,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 06:35:46,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 06:35:46,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 21 transitions. [2020-10-20 06:35:46,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:35:46,977 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 21 transitions. [2020-10-20 06:35:46,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 21 transitions. [2020-10-20 06:35:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-20 06:35:46,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-20 06:35:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2020-10-20 06:35:46,980 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 21 transitions. [2020-10-20 06:35:46,980 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 21 transitions. [2020-10-20 06:35:46,981 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:35:46,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 21 transitions. [2020-10-20 06:35:46,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-20 06:35:46,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:46,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:46,982 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-10-20 06:35:46,982 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:35:46,983 INFO L794 eck$LassoCheckResult]: Stem: 75#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 76#L26-1 [2020-10-20 06:35:46,983 INFO L796 eck$LassoCheckResult]: Loop: 76#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79#L14 assume 0 == main_~i~0;main_~up~0 := 1; 80#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 73#L17-1 assume !(1 == main_~up~0); 74#L20-1 assume !(0 == main_~up~0); 77#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 76#L26-1 [2020-10-20 06:35:46,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:46,983 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2020-10-20 06:35:46,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:46,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315138382] [2020-10-20 06:35:46,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:46,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:46,991 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:46,992 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:46,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:46,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1186394000, now seen corresponding path program 1 times [2020-10-20 06:35:46,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:46,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568907374] [2020-10-20 06:35:46,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:47,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:47,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568907374] [2020-10-20 06:35:47,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:35:47,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:35:47,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647348372] [2020-10-20 06:35:47,014 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:35:47,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:47,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:35:47,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:35:47,015 INFO L87 Difference]: Start difference. First operand 13 states and 21 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-10-20 06:35:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:47,045 INFO L93 Difference]: Finished difference Result 13 states and 20 transitions. [2020-10-20 06:35:47,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:35:47,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 20 transitions. [2020-10-20 06:35:47,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-20 06:35:47,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 20 transitions. [2020-10-20 06:35:47,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 06:35:47,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 06:35:47,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 20 transitions. [2020-10-20 06:35:47,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:35:47,051 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2020-10-20 06:35:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 20 transitions. [2020-10-20 06:35:47,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-20 06:35:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-20 06:35:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2020-10-20 06:35:47,056 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2020-10-20 06:35:47,056 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2020-10-20 06:35:47,056 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:35:47,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2020-10-20 06:35:47,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-20 06:35:47,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:47,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:47,057 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-10-20 06:35:47,058 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:35:47,058 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 108#L26-1 [2020-10-20 06:35:47,060 INFO L796 eck$LassoCheckResult]: Loop: 108#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 111#L14 assume 0 == main_~i~0;main_~up~0 := 1; 112#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 105#L17-1 assume !(1 == main_~up~0); 106#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 109#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 108#L26-1 [2020-10-20 06:35:47,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:47,061 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2020-10-20 06:35:47,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:47,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123202654] [2020-10-20 06:35:47,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:47,076 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:47,082 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:47,084 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:47,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:47,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1186393938, now seen corresponding path program 1 times [2020-10-20 06:35:47,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:47,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868570111] [2020-10-20 06:35:47,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:47,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868570111] [2020-10-20 06:35:47,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:35:47,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:35:47,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592547909] [2020-10-20 06:35:47,136 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:35:47,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:47,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:35:47,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:35:47,137 INFO L87 Difference]: Start difference. First operand 13 states and 20 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-20 06:35:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:47,220 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2020-10-20 06:35:47,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:35:47,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 48 transitions. [2020-10-20 06:35:47,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2020-10-20 06:35:47,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 48 transitions. [2020-10-20 06:35:47,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-10-20 06:35:47,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-10-20 06:35:47,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2020-10-20 06:35:47,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:35:47,227 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 48 transitions. [2020-10-20 06:35:47,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2020-10-20 06:35:47,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2020-10-20 06:35:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-20 06:35:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2020-10-20 06:35:47,231 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2020-10-20 06:35:47,232 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2020-10-20 06:35:47,232 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:35:47,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2020-10-20 06:35:47,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-20 06:35:47,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:47,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:47,234 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-10-20 06:35:47,234 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:35:47,234 INFO L794 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 161#L26-1 [2020-10-20 06:35:47,234 INFO L796 eck$LassoCheckResult]: Loop: 161#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 174#L14 assume !(0 == main_~i~0); 175#L14-2 assume !(main_~i~0 == main_~range~0); 178#L17-1 assume !(1 == main_~up~0); 171#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 167#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 161#L26-1 [2020-10-20 06:35:47,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:47,235 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2020-10-20 06:35:47,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:47,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775764177] [2020-10-20 06:35:47,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:47,240 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:47,242 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:47,243 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:47,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:47,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1188300564, now seen corresponding path program 1 times [2020-10-20 06:35:47,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:47,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332094836] [2020-10-20 06:35:47,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:47,250 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:47,254 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:47,256 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:47,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:47,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1363856397, now seen corresponding path program 1 times [2020-10-20 06:35:47,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:47,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418364062] [2020-10-20 06:35:47,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:47,263 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:47,268 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:47,270 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:47,400 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:35:47,401 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:35:47,402 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:35:47,402 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:35:47,402 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:35:47,402 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:47,402 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:35:47,403 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:35:47,403 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration5_Loop [2020-10-20 06:35:47,403 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:35:47,403 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:35:47,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:47,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:47,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:47,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:47,597 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:35:47,598 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 [2020-10-20 06:35:47,605 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:35:47,607 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:35:47,617 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:35:47,617 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 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 [2020-10-20 06:35:47,642 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:35:47,642 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:35:47,646 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:35:47,646 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 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 [2020-10-20 06:35:47,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:35:47,669 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:35:47,672 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:35:47,673 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:47,698 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:35:47,698 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:47,725 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:35:47,725 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:35:47,754 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:35:47,756 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:35:47,756 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:35:47,757 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:35:47,757 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:35:47,757 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:35:47,757 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:47,757 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:35:47,758 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:35:47,758 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration5_Loop [2020-10-20 06:35:47,758 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:35:47,758 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:35:47,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:47,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:47,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:47,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:47,886 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:35:47,892 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) [2020-10-20 06:35:47,910 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 [2020-10-20 06:35:47,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:47,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:47,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:47,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:47,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:47,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:35:47,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:47,920 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 [2020-10-20 06:35:47,950 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 [2020-10-20 06:35:47,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:47,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:47,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:47,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:47,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:35:47,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:35:47,964 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 [2020-10-20 06:35:48,000 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 [2020-10-20 06:35:48,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:48,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:48,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:48,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:48,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:35:48,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:35:48,017 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) [2020-10-20 06:35:48,064 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:48,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:48,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:48,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:48,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:48,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:48,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:35:48,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:48,077 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:35:48,100 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:35:48,100 INFO L444 ModelExtractionUtils]: 1 out of 4 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) [2020-10-20 06:35:48,107 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:35:48,108 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:35:48,108 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:35:48,109 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:48,138 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:35:48,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:48,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:35:48,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:48,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:35:48,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:48,247 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 [2020-10-20 06:35:48,248 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 35 transitions. cyclomatic complexity: 12 Second operand 4 states. [2020-10-20 06:35:48,336 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 35 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 70 states and 103 transitions. Complement of second has 7 states. [2020-10-20 06:35:48,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:35:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:35:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-10-20 06:35:48,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 1 letters. Loop has 6 letters. [2020-10-20 06:35:48,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:48,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2020-10-20 06:35:48,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:48,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 1 letters. Loop has 12 letters. [2020-10-20 06:35:48,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:48,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 103 transitions. [2020-10-20 06:35:48,348 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2020-10-20 06:35:48,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 65 states and 94 transitions. [2020-10-20 06:35:48,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2020-10-20 06:35:48,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2020-10-20 06:35:48,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 94 transitions. [2020-10-20 06:35:48,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:48,352 INFO L691 BuchiCegarLoop]: Abstraction has 65 states and 94 transitions. [2020-10-20 06:35:48,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 94 transitions. [2020-10-20 06:35:48,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2020-10-20 06:35:48,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-20 06:35:48,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2020-10-20 06:35:48,360 INFO L714 BuchiCegarLoop]: Abstraction has 64 states and 93 transitions. [2020-10-20 06:35:48,360 INFO L594 BuchiCegarLoop]: Abstraction has 64 states and 93 transitions. [2020-10-20 06:35:48,361 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:35:48,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 93 transitions. [2020-10-20 06:35:48,363 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2020-10-20 06:35:48,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:48,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:48,364 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 06:35:48,364 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:35:48,364 INFO L794 eck$LassoCheckResult]: Stem: 301#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 302#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 315#L14 assume 0 == main_~i~0;main_~up~0 := 1; 316#L14-2 [2020-10-20 06:35:48,365 INFO L796 eck$LassoCheckResult]: Loop: 316#L14-2 assume !(main_~i~0 == main_~range~0); 345#L17-1 assume !(1 == main_~up~0); 343#L20-1 assume !(0 == main_~up~0); 340#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 341#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 337#L14 assume 0 == main_~i~0;main_~up~0 := 1; 316#L14-2 [2020-10-20 06:35:48,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:48,365 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2020-10-20 06:35:48,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:48,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529909942] [2020-10-20 06:35:48,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:48,371 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:48,375 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:48,376 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:48,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:48,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1514671824, now seen corresponding path program 1 times [2020-10-20 06:35:48,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:48,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373357444] [2020-10-20 06:35:48,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:48,383 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:48,386 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:48,388 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:48,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:48,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1819047602, now seen corresponding path program 1 times [2020-10-20 06:35:48,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:48,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735571973] [2020-10-20 06:35:48,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:48,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735571973] [2020-10-20 06:35:48,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:35:48,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:35:48,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778563113] [2020-10-20 06:35:48,454 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:35:48,455 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:35:48,455 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:35:48,455 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:35:48,455 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:35:48,455 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:48,455 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:35:48,455 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:35:48,456 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration6_Loop [2020-10-20 06:35:48,456 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:35:48,456 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:35:48,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:48,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:48,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:48,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:48,664 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:35:48,664 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) [2020-10-20 06:35:48,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:35:48,676 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 [2020-10-20 06:35:48,682 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:35:48,683 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) [2020-10-20 06:35:48,738 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:35:48,738 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 [2020-10-20 06:35:48,742 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:35:48,742 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) [2020-10-20 06:35:48,788 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:35:48,788 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 [2020-10-20 06:35:48,795 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:35:48,795 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~range~0=1, ULTIMATE.start_main_~i~0=0} Honda state: {ULTIMATE.start_main_~range~0=1, ULTIMATE.start_main_~i~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:35:48,857 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:35:48,857 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) [2020-10-20 06:35:48,911 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:35:48,911 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:48,964 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:35:48,966 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:35:48,966 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:35:48,966 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:35:48,966 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:35:48,966 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:35:48,967 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:48,967 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:35:48,967 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:35:48,967 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration6_Loop [2020-10-20 06:35:48,967 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:35:48,967 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:35:48,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:48,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:48,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:48,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:49,164 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:35:49,165 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) [2020-10-20 06:35:49,179 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 [2020-10-20 06:35:49,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:49,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:49,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:49,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:49,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:35:49,185 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 [2020-10-20 06:35:49,192 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) [2020-10-20 06:35:49,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:35:49,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:49,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:49,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:49,244 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:49,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:49,246 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 06:35:49,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:49,251 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) [2020-10-20 06:35:49,299 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 [2020-10-20 06:35:49,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:49,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:49,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:49,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:49,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:35:49,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:49,310 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:35:49,356 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:49,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:49,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:49,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:49,359 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:49,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:49,360 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 06:35:49,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:49,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-10-20 06:35:49,395 INFO L489 LassoAnalysis]: Using template '2-nested'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:49,405 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 [2020-10-20 06:35:49,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:49,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:49,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:49,407 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-10-20 06:35:49,410 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-10-20 06:35:49,410 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-10-20 06:35:49,414 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:35:49,457 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 [2020-10-20 06:35:49,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:49,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:49,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:49,459 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:49,460 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-10-20 06:35:49,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:35:49,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:49,467 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 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 [2020-10-20 06:35:49,491 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 [2020-10-20 06:35:49,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:49,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:49,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:49,493 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-10-20 06:35:49,497 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-10-20 06:35:49,497 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-10-20 06:35:49,503 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:35:49,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 [2020-10-20 06:35:49,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:49,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:49,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:49,543 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:49,543 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-10-20 06:35:49,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:35:49,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:49,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-10-20 06:35:49,585 INFO L489 LassoAnalysis]: Using template '3-nested'. 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) [2020-10-20 06:35:49,588 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 [2020-10-20 06:35:49,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:49,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:49,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:49,591 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2020-10-20 06:35:49,595 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-10-20 06:35:49,596 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:49,604 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:35:49,644 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 [2020-10-20 06:35:49,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:49,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:49,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:49,647 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:49,648 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2020-10-20 06:35:49,672 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-20 06:35:49,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:49,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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:35:49,713 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 [2020-10-20 06:35:49,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:49,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:49,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:49,715 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2020-10-20 06:35:49,720 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-10-20 06:35:49,720 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:49,727 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:35:49,751 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 [2020-10-20 06:35:49,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:49,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:49,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:49,754 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:49,754 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2020-10-20 06:35:49,757 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-20 06:35:49,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:49,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-10-20 06:35:49,787 INFO L489 LassoAnalysis]: Using template '4-nested'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:49,789 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 [2020-10-20 06:35:49,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:49,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:49,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:49,792 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2020-10-20 06:35:49,795 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-10-20 06:35:49,796 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-10-20 06:35:49,803 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 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 [2020-10-20 06:35:49,831 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 [2020-10-20 06:35:49,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:49,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:49,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:49,833 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:49,833 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2020-10-20 06:35:49,836 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2020-10-20 06:35:49,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:49,843 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:49,874 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 [2020-10-20 06:35:49,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:49,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:49,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:49,877 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2020-10-20 06:35:49,880 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-10-20 06:35:49,881 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-10-20 06:35:49,888 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:35:49,929 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:49,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:49,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:49,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:49,931 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:49,932 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2020-10-20 06:35:49,934 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2020-10-20 06:35:49,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:49,940 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-10-20 06:35:49,962 INFO L489 LassoAnalysis]: Using template '2-phase'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:49,966 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 [2020-10-20 06:35:49,968 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:49,968 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2020-10-20 06:35:49,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:49,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:49,969 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-10-20 06:35:49,971 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-10-20 06:35:49,971 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-10-20 06:35:49,987 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) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:50,009 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 [2020-10-20 06:35:50,011 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,011 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2020-10-20 06:35:50,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:50,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,011 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:50,012 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-10-20 06:35:50,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:35:50,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:50,022 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) [2020-10-20 06:35:50,059 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 [2020-10-20 06:35:50,061 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,061 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2020-10-20 06:35:50,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:50,061 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-10-20 06:35:50,066 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-10-20 06:35:50,066 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:50,073 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) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:50,098 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 [2020-10-20 06:35:50,100 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,100 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2020-10-20 06:35:50,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:50,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,101 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:50,101 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-10-20 06:35:50,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:35:50,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:50,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-10-20 06:35:50,158 INFO L489 LassoAnalysis]: Using template '3-phase'. 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) [2020-10-20 06:35:50,162 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 [2020-10-20 06:35:50,164 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,164 INFO L338 nArgumentSynthesizer]: Template has degree 2. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:50,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:50,164 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2020-10-20 06:35:50,168 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-10-20 06:35:50,168 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-20 06:35:50,176 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:50,198 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 [2020-10-20 06:35:50,200 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,200 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2020-10-20 06:35:50,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:50,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,201 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:50,201 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2020-10-20 06:35:50,207 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-20 06:35:50,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:50,223 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:35:50,264 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 [2020-10-20 06:35:50,269 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,269 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2020-10-20 06:35:50,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:50,269 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2020-10-20 06:35:50,275 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-10-20 06:35:50,276 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:50,290 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:35:50,325 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:50,328 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,328 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2020-10-20 06:35:50,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:50,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,328 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:50,328 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2020-10-20 06:35:50,331 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-20 06:35:50,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:50,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-10-20 06:35:50,373 INFO L489 LassoAnalysis]: Using template '4-phase'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:50,385 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 [2020-10-20 06:35:50,387 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,387 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2020-10-20 06:35:50,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:50,388 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2020-10-20 06:35:50,391 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-10-20 06:35:50,392 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-10-20 06:35:50,402 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:35:50,424 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:50,428 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,428 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2020-10-20 06:35:50,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:50,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,428 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:50,428 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2020-10-20 06:35:50,433 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2020-10-20 06:35:50,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:50,453 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 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 [2020-10-20 06:35:50,479 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 [2020-10-20 06:35:50,481 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,482 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2020-10-20 06:35:50,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:50,482 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2020-10-20 06:35:50,486 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-10-20 06:35:50,486 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-10-20 06:35:50,508 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) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:50,529 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 [2020-10-20 06:35:50,531 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,531 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2020-10-20 06:35:50,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:50,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,531 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:50,532 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2020-10-20 06:35:50,536 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2020-10-20 06:35:50,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:50,552 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-10-20 06:35:50,581 INFO L489 LassoAnalysis]: Using template '2-lex'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:50,583 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 [2020-10-20 06:35:50,584 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,584 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2020-10-20 06:35:50,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:50,585 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2020-10-20 06:35:50,587 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-10-20 06:35:50,587 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-20 06:35:50,594 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) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:50,617 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 [2020-10-20 06:35:50,618 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,618 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2020-10-20 06:35:50,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:50,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,619 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:50,619 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2020-10-20 06:35:50,621 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-20 06:35:50,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:50,628 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 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:50,650 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 [2020-10-20 06:35:50,652 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,652 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2020-10-20 06:35:50,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:50,653 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2020-10-20 06:35:50,656 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-10-20 06:35:50,656 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-20 06:35:50,663 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:35:50,699 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 [2020-10-20 06:35:50,702 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,702 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2020-10-20 06:35:50,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:50,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,702 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:50,702 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2020-10-20 06:35:50,705 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-20 06:35:50,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:50,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-10-20 06:35:50,751 INFO L489 LassoAnalysis]: Using template '3-lex'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:35:50,755 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 [2020-10-20 06:35:50,757 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,757 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2020-10-20 06:35:50,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:50,758 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2020-10-20 06:35:50,763 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-10-20 06:35:50,763 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:50,774 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:35:50,811 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 [2020-10-20 06:35:50,815 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,815 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2020-10-20 06:35:50,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:50,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,815 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:50,816 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2020-10-20 06:35:50,819 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-10-20 06:35:50,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:50,829 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:50,855 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 [2020-10-20 06:35:50,857 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,857 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2020-10-20 06:35:50,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:50,858 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2020-10-20 06:35:50,861 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-10-20 06:35:50,862 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-10-20 06:35:50,871 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:50,894 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 [2020-10-20 06:35:50,905 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-10-20 06:35:50,906 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2020-10-20 06:35:50,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:50,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:50,906 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:50,907 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2020-10-20 06:35:50,909 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-10-20 06:35:50,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:50,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-10-20 06:35:50,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:50,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:35:50,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:35:50,943 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. cyclomatic complexity: 33 Second operand 3 states. [2020-10-20 06:35:50,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:50,960 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2020-10-20 06:35:50,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:35:50,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 65 transitions. [2020-10-20 06:35:50,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-20 06:35:50,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 46 states and 63 transitions. [2020-10-20 06:35:50,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-10-20 06:35:50,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-10-20 06:35:50,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 63 transitions. [2020-10-20 06:35:50,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:50,966 INFO L691 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2020-10-20 06:35:50,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 63 transitions. [2020-10-20 06:35:50,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2020-10-20 06:35:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-20 06:35:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2020-10-20 06:35:50,971 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 57 transitions. [2020-10-20 06:35:50,971 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 57 transitions. [2020-10-20 06:35:50,972 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:35:50,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 57 transitions. [2020-10-20 06:35:50,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-20 06:35:50,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:50,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:50,974 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:35:50,975 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:35:50,975 INFO L794 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 422#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 439#L14 assume 0 == main_~i~0;main_~up~0 := 1; 428#L14-2 assume !(main_~i~0 == main_~range~0); 417#L17-1 [2020-10-20 06:35:50,975 INFO L796 eck$LassoCheckResult]: Loop: 417#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 418#L20-1 assume !(0 == main_~up~0); 442#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 438#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 434#L14 assume 0 == main_~i~0;main_~up~0 := 1; 435#L14-2 assume !(main_~i~0 == main_~range~0); 417#L17-1 [2020-10-20 06:35:50,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:50,976 INFO L82 PathProgramCache]: Analyzing trace with hash 963346, now seen corresponding path program 1 times [2020-10-20 06:35:50,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:50,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112465446] [2020-10-20 06:35:50,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:50,981 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:50,987 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:50,988 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:50,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:50,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1634880532, now seen corresponding path program 1 times [2020-10-20 06:35:50,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:50,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279559159] [2020-10-20 06:35:50,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:51,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:51,012 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:51,014 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:51,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:51,016 INFO L82 PathProgramCache]: Analyzing trace with hash 498642533, now seen corresponding path program 1 times [2020-10-20 06:35:51,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:51,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740717309] [2020-10-20 06:35:51,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:51,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740717309] [2020-10-20 06:35:51,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:35:51,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 06:35:51,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287350190] [2020-10-20 06:35:51,110 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:35:51,110 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:35:51,110 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:35:51,110 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:35:51,111 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:35:51,111 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:51,111 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:35:51,111 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:35:51,111 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2020-10-20 06:35:51,111 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:35:51,111 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:35:51,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:51,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:51,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:51,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:51,274 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:35:51,275 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:51,279 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:35:51,279 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:35:51,283 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:35:51,283 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:51,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:35:51,306 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:35:51,309 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:35:51,309 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:51,334 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:35:51,334 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:35:51,337 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:35:51,337 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:51,360 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:35:51,360 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:51,386 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:35:51,386 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:35:51,554 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:35:51,556 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:35:51,556 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:35:51,556 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:35:51,556 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:35:51,556 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:35:51,556 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:51,556 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:35:51,556 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:35:51,557 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2020-10-20 06:35:51,557 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:35:51,557 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:35:51,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:51,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:51,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:51,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:51,714 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:35:51,714 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:51,721 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 [2020-10-20 06:35:51,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:51,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:51,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:51,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:51,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:35:51,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:35:51,738 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:35:51,778 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 [2020-10-20 06:35:51,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:51,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:51,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:51,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:51,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:51,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:35:51,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:51,788 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:51,823 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 [2020-10-20 06:35:51,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:51,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:51,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:51,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:51,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:35:51,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:35:51,829 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:51,852 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 [2020-10-20 06:35:51,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:51,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:51,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:51,854 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:51,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:51,855 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 06:35:51,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:51,859 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:35:51,864 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:35:51,864 INFO L444 ModelExtractionUtils]: 1 out of 4 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:51,866 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:35:51,867 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:35:51,867 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:35:51,867 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-20 06:35:51,887 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:35:51,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:51,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:35:51,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:51,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:35:51,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:51,940 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 [2020-10-20 06:35:51,940 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 57 transitions. cyclomatic complexity: 18 Second operand 4 states. [2020-10-20 06:35:52,027 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 57 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 114 states and 153 transitions. Complement of second has 7 states. [2020-10-20 06:35:52,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:35:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:35:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2020-10-20 06:35:52,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 6 letters. [2020-10-20 06:35:52,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:52,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 10 letters. Loop has 6 letters. [2020-10-20 06:35:52,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:52,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 12 letters. [2020-10-20 06:35:52,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:52,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 153 transitions. [2020-10-20 06:35:52,034 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 42 [2020-10-20 06:35:52,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 108 states and 144 transitions. [2020-10-20 06:35:52,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2020-10-20 06:35:52,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2020-10-20 06:35:52,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 144 transitions. [2020-10-20 06:35:52,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:52,038 INFO L691 BuchiCegarLoop]: Abstraction has 108 states and 144 transitions. [2020-10-20 06:35:52,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 144 transitions. [2020-10-20 06:35:52,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 93. [2020-10-20 06:35:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-20 06:35:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2020-10-20 06:35:52,051 INFO L714 BuchiCegarLoop]: Abstraction has 93 states and 128 transitions. [2020-10-20 06:35:52,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:52,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:35:52,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:35:52,052 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand 4 states. [2020-10-20 06:35:52,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:52,092 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2020-10-20 06:35:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:35:52,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 142 transitions. [2020-10-20 06:35:52,098 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 50 [2020-10-20 06:35:52,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 92 states and 118 transitions. [2020-10-20 06:35:52,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2020-10-20 06:35:52,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2020-10-20 06:35:52,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 118 transitions. [2020-10-20 06:35:52,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:52,104 INFO L691 BuchiCegarLoop]: Abstraction has 92 states and 118 transitions. [2020-10-20 06:35:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 118 transitions. [2020-10-20 06:35:52,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 41. [2020-10-20 06:35:52,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-20 06:35:52,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2020-10-20 06:35:52,109 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 55 transitions. [2020-10-20 06:35:52,109 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 55 transitions. [2020-10-20 06:35:52,109 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:35:52,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 55 transitions. [2020-10-20 06:35:52,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-20 06:35:52,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:52,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:52,111 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:35:52,111 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:35:52,112 INFO L794 eck$LassoCheckResult]: Stem: 837#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 838#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 853#L14 assume 0 == main_~i~0;main_~up~0 := 1; 862#L14-2 assume !(main_~i~0 == main_~range~0); 857#L17-1 [2020-10-20 06:35:52,112 INFO L796 eck$LassoCheckResult]: Loop: 857#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 858#L20-1 assume !(0 == main_~up~0); 859#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 868#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 873#L14 assume !(0 == main_~i~0); 870#L14-2 assume !(main_~i~0 == main_~range~0); 857#L17-1 [2020-10-20 06:35:52,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:52,112 INFO L82 PathProgramCache]: Analyzing trace with hash 963346, now seen corresponding path program 2 times [2020-10-20 06:35:52,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:52,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988793418] [2020-10-20 06:35:52,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:52,116 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:52,119 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:52,121 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:52,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:52,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1634880594, now seen corresponding path program 1 times [2020-10-20 06:35:52,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:52,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531239366] [2020-10-20 06:35:52,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:52,127 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:52,130 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:52,131 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:52,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:52,132 INFO L82 PathProgramCache]: Analyzing trace with hash 498642595, now seen corresponding path program 1 times [2020-10-20 06:35:52,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:52,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946734270] [2020-10-20 06:35:52,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:52,138 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:52,143 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:52,145 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:52,199 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:35:52,199 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:35:52,199 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:35:52,200 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:35:52,200 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:35:52,200 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:52,200 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:35:52,200 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:35:52,200 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2020-10-20 06:35:52,200 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:35:52,200 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:35:52,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:52,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:52,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:52,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:52,354 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:35:52,355 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) [2020-10-20 06:35:52,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:35:52,363 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 63 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 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 [2020-10-20 06:35:52,393 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:35:52,394 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:35:52,633 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:35:52,635 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:35:52,635 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:35:52,635 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:35:52,635 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:35:52,635 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:35:52,635 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:52,636 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:35:52,636 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:35:52,636 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2020-10-20 06:35:52,636 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:35:52,636 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:35:52,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:52,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:52,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:52,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:52,798 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:35:52,799 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-20 06:35:52,806 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 [2020-10-20 06:35:52,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:52,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:52,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:52,808 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:52,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:52,810 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 06:35:52,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:52,814 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:35:52,819 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-10-20 06:35:52,820 INFO L444 ModelExtractionUtils]: 0 out of 4 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:35:52,825 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:35:52,825 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:35:52,826 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:35:52,826 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~range~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:52,859 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:35:52,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:52,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:35:52,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:52,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:35:52,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:52,909 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 [2020-10-20 06:35:52,909 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 55 transitions. cyclomatic complexity: 16 Second operand 4 states. [2020-10-20 06:35:52,955 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 55 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 90 states and 115 transitions. Complement of second has 7 states. [2020-10-20 06:35:52,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:35:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:35:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2020-10-20 06:35:52,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 6 letters. [2020-10-20 06:35:52,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:52,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 10 letters. Loop has 6 letters. [2020-10-20 06:35:52,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:52,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 12 letters. [2020-10-20 06:35:52,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:52,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 115 transitions. [2020-10-20 06:35:52,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-20 06:35:52,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 77 states and 98 transitions. [2020-10-20 06:35:52,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-10-20 06:35:52,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-10-20 06:35:52,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 98 transitions. [2020-10-20 06:35:52,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:52,961 INFO L691 BuchiCegarLoop]: Abstraction has 77 states and 98 transitions. [2020-10-20 06:35:52,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 98 transitions. [2020-10-20 06:35:52,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2020-10-20 06:35:52,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-20 06:35:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2020-10-20 06:35:52,967 INFO L714 BuchiCegarLoop]: Abstraction has 71 states and 92 transitions. [2020-10-20 06:35:52,967 INFO L594 BuchiCegarLoop]: Abstraction has 71 states and 92 transitions. [2020-10-20 06:35:52,967 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:35:52,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 92 transitions. [2020-10-20 06:35:52,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-20 06:35:52,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:52,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:52,969 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-10-20 06:35:52,970 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:35:52,970 INFO L794 eck$LassoCheckResult]: Stem: 1019#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 1020#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1076#L14 assume !(0 == main_~i~0); 1077#L14-2 assume !(main_~i~0 == main_~range~0); 1023#L17-1 assume !(1 == main_~up~0); 1024#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 1069#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 1070#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1082#L14 assume 0 == main_~i~0;main_~up~0 := 1; 1081#L14-2 assume !(main_~i~0 == main_~range~0); 1045#L17-1 [2020-10-20 06:35:52,970 INFO L796 eck$LassoCheckResult]: Loop: 1045#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1046#L20-1 assume !(0 == main_~up~0); 1025#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 1026#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1056#L14 assume !(0 == main_~i~0); 1054#L14-2 assume !(main_~i~0 == main_~range~0); 1045#L17-1 [2020-10-20 06:35:52,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:52,970 INFO L82 PathProgramCache]: Analyzing trace with hash -255352415, now seen corresponding path program 1 times [2020-10-20 06:35:52,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:52,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093812161] [2020-10-20 06:35:52,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:52,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093812161] [2020-10-20 06:35:52,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565768547] [2020-10-20 06:35:52,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:35:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:53,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 06:35:53,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:53,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:35:53,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-10-20 06:35:53,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594395429] [2020-10-20 06:35:53,039 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:35:53,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:53,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1634880594, now seen corresponding path program 2 times [2020-10-20 06:35:53,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:53,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712944886] [2020-10-20 06:35:53,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:53,044 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:53,047 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:53,049 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:53,085 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:35:53,085 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:35:53,085 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:35:53,086 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:35:53,086 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:35:53,086 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:53,086 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:35:53,086 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:35:53,086 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration9_Loop [2020-10-20 06:35:53,086 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:35:53,086 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:35:53,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:53,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:53,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:53,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:53,269 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:35:53,269 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:53,271 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:35:53,271 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:35:53,274 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:35:53,274 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 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 [2020-10-20 06:35:53,297 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:35:53,298 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:35:53,301 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:35:53,301 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:53,324 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:35:53,324 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:35:53,328 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:35:53,328 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2020-10-20 06:35:53,349 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:35:53,349 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:53,374 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:35:53,375 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:35:53,613 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:35:53,615 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:35:53,615 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:35:53,615 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:35:53,616 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:35:53,616 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:35:53,616 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:53,616 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:35:53,616 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:35:53,616 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration9_Loop [2020-10-20 06:35:53,616 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:35:53,617 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:35:53,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:53,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:53,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:53,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:35:53,759 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:35:53,759 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:53,766 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 [2020-10-20 06:35:53,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:53,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:53,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:53,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:53,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:35:53,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:35:53,772 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 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 [2020-10-20 06:35:53,796 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 [2020-10-20 06:35:53,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:53,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:53,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:53,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:53,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:53,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:35:53,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:53,810 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:53,841 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 [2020-10-20 06:35:53,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:53,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:53,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:53,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:53,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:35:53,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:35:53,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:53,872 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 [2020-10-20 06:35:53,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:53,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:53,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:53,873 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:35:53,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:53,875 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 06:35:53,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:53,878 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:35:53,882 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:35:53,882 INFO L444 ModelExtractionUtils]: 1 out of 4 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:53,884 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:35:53,884 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:35:53,885 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:35:53,885 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~range~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~range~0 Supporting invariants [] [2020-10-20 06:35:53,913 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:35:53,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:53,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:35:53,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:53,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:35:53,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:53,968 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 [2020-10-20 06:35:53,968 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26 Second operand 4 states. [2020-10-20 06:35:54,008 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26. Second operand 4 states. Result 95 states and 121 transitions. Complement of second has 7 states. [2020-10-20 06:35:54,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:35:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:35:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2020-10-20 06:35:54,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 10 letters. Loop has 6 letters. [2020-10-20 06:35:54,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:54,010 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:35:54,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:54,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:35:54,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:54,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:35:54,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:54,072 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:35:54,072 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26 Second operand 4 states. [2020-10-20 06:35:54,141 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26. Second operand 4 states. Result 124 states and 157 transitions. Complement of second has 9 states. [2020-10-20 06:35:54,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 06:35:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:35:54,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2020-10-20 06:35:54,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 10 letters. Loop has 6 letters. [2020-10-20 06:35:54,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:54,144 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:35:54,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:54,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:35:54,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:54,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:35:54,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:54,191 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:35:54,191 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26 Second operand 4 states. [2020-10-20 06:35:54,232 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26. Second operand 4 states. Result 112 states and 146 transitions. Complement of second has 8 states. [2020-10-20 06:35:54,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:35:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:35:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2020-10-20 06:35:54,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 10 letters. Loop has 6 letters. [2020-10-20 06:35:54,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:54,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 16 letters. Loop has 6 letters. [2020-10-20 06:35:54,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:54,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 10 letters. Loop has 12 letters. [2020-10-20 06:35:54,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:54,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 146 transitions. [2020-10-20 06:35:54,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2020-10-20 06:35:54,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 84 states and 108 transitions. [2020-10-20 06:35:54,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-10-20 06:35:54,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2020-10-20 06:35:54,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 108 transitions. [2020-10-20 06:35:54,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:54,242 INFO L691 BuchiCegarLoop]: Abstraction has 84 states and 108 transitions. [2020-10-20 06:35:54,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 108 transitions. [2020-10-20 06:35:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 49. [2020-10-20 06:35:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-20 06:35:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2020-10-20 06:35:54,246 INFO L714 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2020-10-20 06:35:54,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:54,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:35:54,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:35:54,247 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand 4 states. [2020-10-20 06:35:54,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:54,293 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2020-10-20 06:35:54,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:35:54,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 154 transitions. [2020-10-20 06:35:54,296 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2020-10-20 06:35:54,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 117 states and 152 transitions. [2020-10-20 06:35:54,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2020-10-20 06:35:54,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2020-10-20 06:35:54,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 152 transitions. [2020-10-20 06:35:54,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:54,299 INFO L691 BuchiCegarLoop]: Abstraction has 117 states and 152 transitions. [2020-10-20 06:35:54,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 152 transitions. [2020-10-20 06:35:54,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 97. [2020-10-20 06:35:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-20 06:35:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2020-10-20 06:35:54,304 INFO L714 BuchiCegarLoop]: Abstraction has 97 states and 128 transitions. [2020-10-20 06:35:54,304 INFO L594 BuchiCegarLoop]: Abstraction has 97 states and 128 transitions. [2020-10-20 06:35:54,304 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 06:35:54,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 128 transitions. [2020-10-20 06:35:54,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2020-10-20 06:35:54,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:54,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:54,306 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:35:54,306 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2020-10-20 06:35:54,307 INFO L794 eck$LassoCheckResult]: Stem: 1815#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 1816#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1828#L14 assume 0 == main_~i~0;main_~up~0 := 1; 1896#L14-2 assume !(main_~i~0 == main_~range~0); 1854#L17-1 [2020-10-20 06:35:54,307 INFO L796 eck$LassoCheckResult]: Loop: 1854#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1867#L20-1 assume !(0 == main_~up~0); 1870#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 1871#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1856#L14 assume !(0 == main_~i~0); 1855#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 1846#L17-1 assume !(1 == main_~up~0); 1852#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 1851#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 1849#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1847#L14 assume !(0 == main_~i~0); 1845#L14-2 assume !(main_~i~0 == main_~range~0); 1844#L17-1 assume !(1 == main_~up~0); 1843#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 1841#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 1842#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1881#L14 assume 0 == main_~i~0;main_~up~0 := 1; 1853#L14-2 assume !(main_~i~0 == main_~range~0); 1854#L17-1 [2020-10-20 06:35:54,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:54,308 INFO L82 PathProgramCache]: Analyzing trace with hash 963346, now seen corresponding path program 3 times [2020-10-20 06:35:54,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:54,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001405459] [2020-10-20 06:35:54,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:54,312 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:54,314 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:54,316 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:54,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:54,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1416950548, now seen corresponding path program 1 times [2020-10-20 06:35:54,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:54,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127877433] [2020-10-20 06:35:54,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:54,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127877433] [2020-10-20 06:35:54,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589333172] [2020-10-20 06:35:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:35:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:54,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:35:54,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:54,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:35:54,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2020-10-20 06:35:54,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231591913] [2020-10-20 06:35:54,494 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:35:54,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:54,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:35:54,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:35:54,495 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. cyclomatic complexity: 35 Second operand 11 states. [2020-10-20 06:35:54,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:54,793 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2020-10-20 06:35:54,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 06:35:54,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 112 transitions. [2020-10-20 06:35:54,795 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2020-10-20 06:35:54,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 94 states and 105 transitions. [2020-10-20 06:35:54,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2020-10-20 06:35:54,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2020-10-20 06:35:54,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 105 transitions. [2020-10-20 06:35:54,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:54,799 INFO L691 BuchiCegarLoop]: Abstraction has 94 states and 105 transitions. [2020-10-20 06:35:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 105 transitions. [2020-10-20 06:35:54,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2020-10-20 06:35:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-20 06:35:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2020-10-20 06:35:54,809 INFO L714 BuchiCegarLoop]: Abstraction has 84 states and 95 transitions. [2020-10-20 06:35:54,809 INFO L594 BuchiCegarLoop]: Abstraction has 84 states and 95 transitions. [2020-10-20 06:35:54,809 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 06:35:54,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 95 transitions. [2020-10-20 06:35:54,810 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2020-10-20 06:35:54,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:54,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:54,811 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:35:54,811 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:35:54,815 INFO L794 eck$LassoCheckResult]: Stem: 2093#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 2094#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2116#L14 assume 0 == main_~i~0;main_~up~0 := 1; 2113#L14-2 assume !(main_~i~0 == main_~range~0); 2111#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2108#L20-1 assume !(0 == main_~up~0); 2109#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2117#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2114#L14 assume !(0 == main_~i~0); 2115#L14-2 [2020-10-20 06:35:54,815 INFO L796 eck$LassoCheckResult]: Loop: 2115#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2166#L17-1 assume !(1 == main_~up~0); 2164#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2162#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2160#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2143#L14 assume 0 == main_~i~0;main_~up~0 := 1; 2137#L14-2 assume !(main_~i~0 == main_~range~0); 2138#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2171#L20-1 assume !(0 == main_~up~0); 2170#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2169#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2168#L14 assume !(0 == main_~i~0); 2115#L14-2 [2020-10-20 06:35:54,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:54,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1817200562, now seen corresponding path program 2 times [2020-10-20 06:35:54,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:54,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073838050] [2020-10-20 06:35:54,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:54,826 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:54,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:54,841 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:54,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:54,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1139092067, now seen corresponding path program 2 times [2020-10-20 06:35:54,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:54,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025372409] [2020-10-20 06:35:54,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:54,854 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:54,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:54,868 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:54,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:54,871 INFO L82 PathProgramCache]: Analyzing trace with hash -140873580, now seen corresponding path program 1 times [2020-10-20 06:35:54,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:54,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208100577] [2020-10-20 06:35:54,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:54,926 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 06:35:54,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208100577] [2020-10-20 06:35:54,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421966071] [2020-10-20 06:35:54,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:35:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:54,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:35:54,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 06:35:54,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:35:54,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-10-20 06:35:54,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893722725] [2020-10-20 06:35:55,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:55,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 06:35:55,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:35:55,034 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. cyclomatic complexity: 16 Second operand 7 states. [2020-10-20 06:35:55,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:55,104 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2020-10-20 06:35:55,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:35:55,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 101 transitions. [2020-10-20 06:35:55,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:55,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 81 states and 89 transitions. [2020-10-20 06:35:55,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2020-10-20 06:35:55,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2020-10-20 06:35:55,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 89 transitions. [2020-10-20 06:35:55,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:55,108 INFO L691 BuchiCegarLoop]: Abstraction has 81 states and 89 transitions. [2020-10-20 06:35:55,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 89 transitions. [2020-10-20 06:35:55,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2020-10-20 06:35:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-20 06:35:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2020-10-20 06:35:55,117 INFO L714 BuchiCegarLoop]: Abstraction has 79 states and 87 transitions. [2020-10-20 06:35:55,118 INFO L594 BuchiCegarLoop]: Abstraction has 79 states and 87 transitions. [2020-10-20 06:35:55,118 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 06:35:55,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 87 transitions. [2020-10-20 06:35:55,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:55,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:55,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:55,119 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1] [2020-10-20 06:35:55,120 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:35:55,120 INFO L794 eck$LassoCheckResult]: Stem: 2340#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 2341#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2358#L14 assume !(0 == main_~i~0); 2366#L14-2 assume !(main_~i~0 == main_~range~0); 2365#L17-1 assume !(1 == main_~up~0); 2364#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2361#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 2360#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2390#L14 assume !(0 == main_~i~0); 2389#L14-2 assume !(main_~i~0 == main_~range~0); 2388#L17-1 assume !(1 == main_~up~0); 2387#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2384#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 2382#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2377#L14 assume 0 == main_~i~0;main_~up~0 := 1; 2378#L14-2 [2020-10-20 06:35:55,120 INFO L796 eck$LassoCheckResult]: Loop: 2378#L14-2 assume !(main_~i~0 == main_~range~0); 2410#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2407#L20-1 assume !(0 == main_~up~0); 2404#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2401#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2398#L14 assume !(0 == main_~i~0); 2396#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2394#L17-1 assume !(1 == main_~up~0); 2393#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2386#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2383#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2380#L14 assume 0 == main_~i~0;main_~up~0 := 1; 2378#L14-2 [2020-10-20 06:35:55,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:55,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1377251387, now seen corresponding path program 2 times [2020-10-20 06:35:55,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:55,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077503383] [2020-10-20 06:35:55,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:55,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077503383] [2020-10-20 06:35:55,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251484620] [2020-10-20 06:35:55,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:35:55,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:35:55,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:35:55,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:35:55,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:55,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:35:55,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-10-20 06:35:55,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838987057] [2020-10-20 06:35:55,192 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:35:55,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:55,193 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 3 times [2020-10-20 06:35:55,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:55,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573398957] [2020-10-20 06:35:55,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:55,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:55,201 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:55,202 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:55,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:55,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:35:55,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:35:55,257 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-20 06:35:55,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:55,325 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2020-10-20 06:35:55,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 06:35:55,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 111 transitions. [2020-10-20 06:35:55,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:55,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 101 states and 109 transitions. [2020-10-20 06:35:55,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2020-10-20 06:35:55,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2020-10-20 06:35:55,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 109 transitions. [2020-10-20 06:35:55,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:55,329 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 109 transitions. [2020-10-20 06:35:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 109 transitions. [2020-10-20 06:35:55,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2020-10-20 06:35:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-20 06:35:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2020-10-20 06:35:55,332 INFO L714 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2020-10-20 06:35:55,332 INFO L594 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2020-10-20 06:35:55,333 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 06:35:55,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 99 transitions. [2020-10-20 06:35:55,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:55,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:55,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:55,335 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 1, 1] [2020-10-20 06:35:55,335 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:35:55,335 INFO L794 eck$LassoCheckResult]: Stem: 2576#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 2577#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2611#L14 assume !(0 == main_~i~0); 2609#L14-2 assume !(main_~i~0 == main_~range~0); 2608#L17-1 assume !(1 == main_~up~0); 2607#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2604#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 2605#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2588#L14 assume !(0 == main_~i~0); 2589#L14-2 assume !(main_~i~0 == main_~range~0); 2643#L17-1 assume !(1 == main_~up~0); 2614#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2615#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 2591#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2592#L14 assume !(0 == main_~i~0); 2583#L14-2 assume !(main_~i~0 == main_~range~0); 2574#L17-1 assume !(1 == main_~up~0); 2575#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2629#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 2630#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2621#L14 assume 0 == main_~i~0;main_~up~0 := 1; 2622#L14-2 [2020-10-20 06:35:55,335 INFO L796 eck$LassoCheckResult]: Loop: 2622#L14-2 assume !(main_~i~0 == main_~range~0); 2617#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2618#L20-1 assume !(0 == main_~up~0); 2638#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2637#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2636#L14 assume !(0 == main_~i~0); 2635#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2634#L17-1 assume !(1 == main_~up~0); 2633#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2631#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2626#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2627#L14 assume 0 == main_~i~0;main_~up~0 := 1; 2622#L14-2 [2020-10-20 06:35:55,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:55,336 INFO L82 PathProgramCache]: Analyzing trace with hash 237666774, now seen corresponding path program 3 times [2020-10-20 06:35:55,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:55,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097777251] [2020-10-20 06:35:55,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:55,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097777251] [2020-10-20 06:35:55,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762692343] [2020-10-20 06:35:55,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-10-20 06:35:55,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-20 06:35:55,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:35:55,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:35:55,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:55,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:35:55,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-20 06:35:55,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294388476] [2020-10-20 06:35:55,415 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:35:55,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:55,415 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 4 times [2020-10-20 06:35:55,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:55,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36009027] [2020-10-20 06:35:55,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:55,420 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:55,424 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:55,425 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:55,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:55,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 06:35:55,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:35:55,507 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-10-20 06:35:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:55,621 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2020-10-20 06:35:55,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 06:35:55,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 129 transitions. [2020-10-20 06:35:55,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:55,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 119 states and 127 transitions. [2020-10-20 06:35:55,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2020-10-20 06:35:55,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2020-10-20 06:35:55,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 127 transitions. [2020-10-20 06:35:55,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:55,624 INFO L691 BuchiCegarLoop]: Abstraction has 119 states and 127 transitions. [2020-10-20 06:35:55,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 127 transitions. [2020-10-20 06:35:55,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 103. [2020-10-20 06:35:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-20 06:35:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2020-10-20 06:35:55,628 INFO L714 BuchiCegarLoop]: Abstraction has 103 states and 111 transitions. [2020-10-20 06:35:55,628 INFO L594 BuchiCegarLoop]: Abstraction has 103 states and 111 transitions. [2020-10-20 06:35:55,628 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-20 06:35:55,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 111 transitions. [2020-10-20 06:35:55,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:55,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:55,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:55,630 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 1, 1] [2020-10-20 06:35:55,630 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:35:55,630 INFO L794 eck$LassoCheckResult]: Stem: 2870#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 2871#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2903#L14 assume !(0 == main_~i~0); 2901#L14-2 assume !(main_~i~0 == main_~range~0); 2900#L17-1 assume !(1 == main_~up~0); 2899#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2896#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 2897#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2882#L14 assume !(0 == main_~i~0); 2877#L14-2 assume !(main_~i~0 == main_~range~0); 2868#L17-1 assume !(1 == main_~up~0); 2869#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2906#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 2952#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2951#L14 assume !(0 == main_~i~0); 2950#L14-2 assume !(main_~i~0 == main_~range~0); 2949#L17-1 assume !(1 == main_~up~0); 2948#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2947#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 2923#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2944#L14 assume !(0 == main_~i~0); 2936#L14-2 assume !(main_~i~0 == main_~range~0); 2934#L17-1 assume !(1 == main_~up~0); 2926#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2921#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 2922#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2913#L14 assume 0 == main_~i~0;main_~up~0 := 1; 2914#L14-2 [2020-10-20 06:35:55,631 INFO L796 eck$LassoCheckResult]: Loop: 2914#L14-2 assume !(main_~i~0 == main_~range~0); 2909#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2910#L20-1 assume !(0 == main_~up~0); 2932#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2931#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2930#L14 assume !(0 == main_~i~0); 2929#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2928#L17-1 assume !(1 == main_~up~0); 2927#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2924#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2918#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2919#L14 assume 0 == main_~i~0;main_~up~0 := 1; 2914#L14-2 [2020-10-20 06:35:55,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:55,631 INFO L82 PathProgramCache]: Analyzing trace with hash 304653095, now seen corresponding path program 4 times [2020-10-20 06:35:55,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:55,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311756259] [2020-10-20 06:35:55,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:55,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311756259] [2020-10-20 06:35:55,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731094024] [2020-10-20 06:35:55,671 INFO L93 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:35:55,695 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 06:35:55,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:35:55,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:35:55,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:55,723 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:55,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:35:55,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 06:35:55,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434291237] [2020-10-20 06:35:55,724 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:35:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:55,725 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 5 times [2020-10-20 06:35:55,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:55,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643539272] [2020-10-20 06:35:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:55,729 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:55,732 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:55,733 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:55,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:55,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 06:35:55,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:35:55,784 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. cyclomatic complexity: 12 Second operand 8 states. [2020-10-20 06:35:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:55,901 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2020-10-20 06:35:55,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 06:35:55,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 139 transitions. [2020-10-20 06:35:55,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:55,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 129 states and 137 transitions. [2020-10-20 06:35:55,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2020-10-20 06:35:55,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2020-10-20 06:35:55,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 137 transitions. [2020-10-20 06:35:55,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:55,906 INFO L691 BuchiCegarLoop]: Abstraction has 129 states and 137 transitions. [2020-10-20 06:35:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 137 transitions. [2020-10-20 06:35:55,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 115. [2020-10-20 06:35:55,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-10-20 06:35:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2020-10-20 06:35:55,910 INFO L714 BuchiCegarLoop]: Abstraction has 115 states and 123 transitions. [2020-10-20 06:35:55,910 INFO L594 BuchiCegarLoop]: Abstraction has 115 states and 123 transitions. [2020-10-20 06:35:55,910 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-20 06:35:55,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 123 transitions. [2020-10-20 06:35:55,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:55,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:55,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:55,912 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 1, 1] [2020-10-20 06:35:55,912 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:35:55,913 INFO L794 eck$LassoCheckResult]: Stem: 3205#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 3206#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3238#L14 assume !(0 == main_~i~0); 3236#L14-2 assume !(main_~i~0 == main_~range~0); 3235#L17-1 assume !(1 == main_~up~0); 3234#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 3232#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 3219#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3218#L14 assume !(0 == main_~i~0); 3213#L14-2 assume !(main_~i~0 == main_~range~0); 3214#L17-1 assume !(1 == main_~up~0); 3242#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 3243#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 3263#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3262#L14 assume !(0 == main_~i~0); 3261#L14-2 assume !(main_~i~0 == main_~range~0); 3260#L17-1 assume !(1 == main_~up~0); 3259#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 3258#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 3257#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3256#L14 assume !(0 == main_~i~0); 3255#L14-2 assume !(main_~i~0 == main_~range~0); 3254#L17-1 assume !(1 == main_~up~0); 3253#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 3252#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 3246#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3251#L14 assume !(0 == main_~i~0); 3250#L14-2 assume !(main_~i~0 == main_~range~0); 3249#L17-1 assume !(1 == main_~up~0); 3248#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 3244#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 3245#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3274#L14 assume 0 == main_~i~0;main_~up~0 := 1; 3275#L14-2 [2020-10-20 06:35:55,913 INFO L796 eck$LassoCheckResult]: Loop: 3275#L14-2 assume !(main_~i~0 == main_~range~0); 3270#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3271#L20-1 assume !(0 == main_~up~0); 3287#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 3286#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3285#L14 assume !(0 == main_~i~0); 3284#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 3283#L17-1 assume !(1 == main_~up~0); 3282#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 3280#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 3277#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3278#L14 assume 0 == main_~i~0;main_~up~0 := 1; 3275#L14-2 [2020-10-20 06:35:55,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:55,913 INFO L82 PathProgramCache]: Analyzing trace with hash 170050488, now seen corresponding path program 5 times [2020-10-20 06:35:55,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:55,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027633276] [2020-10-20 06:35:55,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:55,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027633276] [2020-10-20 06:35:55,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882031957] [2020-10-20 06:35:55,964 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:35:55,995 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-20 06:35:55,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:35:55,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:35:55,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:56,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:35:56,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-20 06:35:56,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723024191] [2020-10-20 06:35:56,031 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:35:56,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:56,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 6 times [2020-10-20 06:35:56,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:56,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981918808] [2020-10-20 06:35:56,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:56,035 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:56,038 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:56,039 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:56,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:56,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:35:56,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:35:56,091 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. cyclomatic complexity: 12 Second operand 9 states. [2020-10-20 06:35:56,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:56,222 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2020-10-20 06:35:56,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 06:35:56,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 151 transitions. [2020-10-20 06:35:56,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:56,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 141 states and 149 transitions. [2020-10-20 06:35:56,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2020-10-20 06:35:56,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2020-10-20 06:35:56,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 149 transitions. [2020-10-20 06:35:56,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:56,226 INFO L691 BuchiCegarLoop]: Abstraction has 141 states and 149 transitions. [2020-10-20 06:35:56,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 149 transitions. [2020-10-20 06:35:56,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 127. [2020-10-20 06:35:56,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-20 06:35:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2020-10-20 06:35:56,229 INFO L714 BuchiCegarLoop]: Abstraction has 127 states and 135 transitions. [2020-10-20 06:35:56,229 INFO L594 BuchiCegarLoop]: Abstraction has 127 states and 135 transitions. [2020-10-20 06:35:56,229 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-10-20 06:35:56,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 135 transitions. [2020-10-20 06:35:56,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:56,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:56,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:56,231 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 1, 1] [2020-10-20 06:35:56,231 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:35:56,232 INFO L794 eck$LassoCheckResult]: Stem: 3579#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 3580#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3615#L14 assume !(0 == main_~i~0); 3613#L14-2 assume !(main_~i~0 == main_~range~0); 3612#L17-1 assume !(1 == main_~up~0); 3611#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 3609#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 3596#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3594#L14 assume !(0 == main_~i~0); 3595#L14-2 assume !(main_~i~0 == main_~range~0); 3648#L17-1 assume !(1 == main_~up~0); 3647#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 3646#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 3645#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3644#L14 assume !(0 == main_~i~0); 3643#L14-2 assume !(main_~i~0 == main_~range~0); 3642#L17-1 assume !(1 == main_~up~0); 3641#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 3640#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 3639#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3638#L14 assume !(0 == main_~i~0); 3637#L14-2 assume !(main_~i~0 == main_~range~0); 3636#L17-1 assume !(1 == main_~up~0); 3635#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 3634#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 3633#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3632#L14 assume !(0 == main_~i~0); 3631#L14-2 assume !(main_~i~0 == main_~range~0); 3630#L17-1 assume !(1 == main_~up~0); 3629#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 3628#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 3622#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3627#L14 assume !(0 == main_~i~0); 3626#L14-2 assume !(main_~i~0 == main_~range~0); 3625#L17-1 assume !(1 == main_~up~0); 3624#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 3620#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 3621#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3658#L14 assume 0 == main_~i~0;main_~up~0 := 1; 3659#L14-2 [2020-10-20 06:35:56,232 INFO L796 eck$LassoCheckResult]: Loop: 3659#L14-2 assume !(main_~i~0 == main_~range~0); 3654#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3655#L20-1 assume !(0 == main_~up~0); 3671#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 3670#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3669#L14 assume !(0 == main_~i~0); 3668#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 3667#L17-1 assume !(1 == main_~up~0); 3666#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 3664#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 3661#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3662#L14 assume 0 == main_~i~0;main_~up~0 := 1; 3659#L14-2 [2020-10-20 06:35:56,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:56,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1550611337, now seen corresponding path program 6 times [2020-10-20 06:35:56,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:56,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418330706] [2020-10-20 06:35:56,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:56,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418330706] [2020-10-20 06:35:56,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777690140] [2020-10-20 06:35:56,306 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:35:56,333 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-10-20 06:35:56,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:35:56,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:35:56,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:56,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:35:56,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-20 06:35:56,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450839510] [2020-10-20 06:35:56,357 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:35:56,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:56,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 7 times [2020-10-20 06:35:56,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:56,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948681424] [2020-10-20 06:35:56,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:56,361 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:56,363 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:56,364 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:56,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:56,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 06:35:56,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:35:56,434 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. cyclomatic complexity: 12 Second operand 10 states. [2020-10-20 06:35:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:56,597 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2020-10-20 06:35:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 06:35:56,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 163 transitions. [2020-10-20 06:35:56,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:56,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 153 states and 161 transitions. [2020-10-20 06:35:56,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2020-10-20 06:35:56,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2020-10-20 06:35:56,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 161 transitions. [2020-10-20 06:35:56,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:56,601 INFO L691 BuchiCegarLoop]: Abstraction has 153 states and 161 transitions. [2020-10-20 06:35:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 161 transitions. [2020-10-20 06:35:56,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 139. [2020-10-20 06:35:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-10-20 06:35:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2020-10-20 06:35:56,604 INFO L714 BuchiCegarLoop]: Abstraction has 139 states and 147 transitions. [2020-10-20 06:35:56,605 INFO L594 BuchiCegarLoop]: Abstraction has 139 states and 147 transitions. [2020-10-20 06:35:56,605 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-10-20 06:35:56,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 147 transitions. [2020-10-20 06:35:56,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:56,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:56,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:56,607 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 1, 1] [2020-10-20 06:35:56,608 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:35:56,608 INFO L794 eck$LassoCheckResult]: Stem: 4004#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 4005#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4038#L14 assume !(0 == main_~i~0); 4036#L14-2 assume !(main_~i~0 == main_~range~0); 4035#L17-1 assume !(1 == main_~up~0); 4034#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4032#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4018#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4019#L14 assume !(0 == main_~i~0); 4011#L14-2 assume !(main_~i~0 == main_~range~0); 4012#L17-1 assume !(1 == main_~up~0); 4076#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4075#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4074#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4073#L14 assume !(0 == main_~i~0); 4072#L14-2 assume !(main_~i~0 == main_~range~0); 4071#L17-1 assume !(1 == main_~up~0); 4070#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4069#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4068#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4067#L14 assume !(0 == main_~i~0); 4066#L14-2 assume !(main_~i~0 == main_~range~0); 4065#L17-1 assume !(1 == main_~up~0); 4064#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4063#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4062#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4061#L14 assume !(0 == main_~i~0); 4060#L14-2 assume !(main_~i~0 == main_~range~0); 4059#L17-1 assume !(1 == main_~up~0); 4058#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4057#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4056#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4055#L14 assume !(0 == main_~i~0); 4054#L14-2 assume !(main_~i~0 == main_~range~0); 4053#L17-1 assume !(1 == main_~up~0); 4052#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4051#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4045#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4050#L14 assume !(0 == main_~i~0); 4049#L14-2 assume !(main_~i~0 == main_~range~0); 4048#L17-1 assume !(1 == main_~up~0); 4047#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4043#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4044#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4085#L14 assume 0 == main_~i~0;main_~up~0 := 1; 4086#L14-2 [2020-10-20 06:35:56,608 INFO L796 eck$LassoCheckResult]: Loop: 4086#L14-2 assume !(main_~i~0 == main_~range~0); 4081#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4082#L20-1 assume !(0 == main_~up~0); 4098#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4097#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4096#L14 assume !(0 == main_~i~0); 4095#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 4094#L17-1 assume !(1 == main_~up~0); 4093#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4091#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4088#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4089#L14 assume 0 == main_~i~0;main_~up~0 := 1; 4086#L14-2 [2020-10-20 06:35:56,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:56,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1502788966, now seen corresponding path program 7 times [2020-10-20 06:35:56,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:56,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193936929] [2020-10-20 06:35:56,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:56,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193936929] [2020-10-20 06:35:56,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157648632] [2020-10-20 06:35:56,704 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:35:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:56,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 06:35:56,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:56,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:35:56,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-20 06:35:56,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531853539] [2020-10-20 06:35:56,772 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:35:56,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:56,772 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 8 times [2020-10-20 06:35:56,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:56,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617727585] [2020-10-20 06:35:56,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:56,776 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:56,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:56,780 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:56,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:56,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:35:56,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:35:56,832 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. cyclomatic complexity: 12 Second operand 11 states. [2020-10-20 06:35:57,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:57,012 INFO L93 Difference]: Finished difference Result 167 states and 175 transitions. [2020-10-20 06:35:57,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 06:35:57,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 175 transitions. [2020-10-20 06:35:57,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:57,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 165 states and 173 transitions. [2020-10-20 06:35:57,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2020-10-20 06:35:57,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2020-10-20 06:35:57,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 165 states and 173 transitions. [2020-10-20 06:35:57,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:57,020 INFO L691 BuchiCegarLoop]: Abstraction has 165 states and 173 transitions. [2020-10-20 06:35:57,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states and 173 transitions. [2020-10-20 06:35:57,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2020-10-20 06:35:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-10-20 06:35:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2020-10-20 06:35:57,026 INFO L714 BuchiCegarLoop]: Abstraction has 151 states and 159 transitions. [2020-10-20 06:35:57,026 INFO L594 BuchiCegarLoop]: Abstraction has 151 states and 159 transitions. [2020-10-20 06:35:57,026 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-10-20 06:35:57,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 159 transitions. [2020-10-20 06:35:57,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:57,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:57,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:57,034 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 1, 1] [2020-10-20 06:35:57,034 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:35:57,035 INFO L794 eck$LassoCheckResult]: Stem: 4468#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 4469#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4503#L14 assume !(0 == main_~i~0); 4501#L14-2 assume !(main_~i~0 == main_~range~0); 4500#L17-1 assume !(1 == main_~up~0); 4499#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4497#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4483#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4484#L14 assume !(0 == main_~i~0); 4476#L14-2 assume !(main_~i~0 == main_~range~0); 4477#L17-1 assume !(1 == main_~up~0); 4546#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4545#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4544#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4543#L14 assume !(0 == main_~i~0); 4542#L14-2 assume !(main_~i~0 == main_~range~0); 4541#L17-1 assume !(1 == main_~up~0); 4540#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4539#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4538#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4537#L14 assume !(0 == main_~i~0); 4536#L14-2 assume !(main_~i~0 == main_~range~0); 4535#L17-1 assume !(1 == main_~up~0); 4534#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4533#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4532#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4531#L14 assume !(0 == main_~i~0); 4530#L14-2 assume !(main_~i~0 == main_~range~0); 4529#L17-1 assume !(1 == main_~up~0); 4528#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4527#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4526#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4525#L14 assume !(0 == main_~i~0); 4524#L14-2 assume !(main_~i~0 == main_~range~0); 4523#L17-1 assume !(1 == main_~up~0); 4522#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4521#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4520#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4519#L14 assume !(0 == main_~i~0); 4518#L14-2 assume !(main_~i~0 == main_~range~0); 4517#L17-1 assume !(1 == main_~up~0); 4516#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4515#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4509#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4514#L14 assume !(0 == main_~i~0); 4513#L14-2 assume !(main_~i~0 == main_~range~0); 4512#L17-1 assume !(1 == main_~up~0); 4511#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4507#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4508#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4555#L14 assume 0 == main_~i~0;main_~up~0 := 1; 4556#L14-2 [2020-10-20 06:35:57,036 INFO L796 eck$LassoCheckResult]: Loop: 4556#L14-2 assume !(main_~i~0 == main_~range~0); 4551#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4552#L20-1 assume !(0 == main_~up~0); 4568#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4567#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4566#L14 assume !(0 == main_~i~0); 4565#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 4564#L17-1 assume !(1 == main_~up~0); 4563#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4561#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4558#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4559#L14 assume 0 == main_~i~0;main_~up~0 := 1; 4556#L14-2 [2020-10-20 06:35:57,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:57,036 INFO L82 PathProgramCache]: Analyzing trace with hash 497074411, now seen corresponding path program 8 times [2020-10-20 06:35:57,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:57,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180462994] [2020-10-20 06:35:57,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:57,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180462994] [2020-10-20 06:35:57,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985241308] [2020-10-20 06:35:57,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:35:57,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:35:57,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:35:57,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:35:57,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:57,340 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:57,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:35:57,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-10-20 06:35:57,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064845968] [2020-10-20 06:35:57,342 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:35:57,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:57,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 9 times [2020-10-20 06:35:57,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:57,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564906646] [2020-10-20 06:35:57,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:57,346 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:57,348 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:57,349 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:57,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:57,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 06:35:57,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:35:57,415 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. cyclomatic complexity: 12 Second operand 12 states. [2020-10-20 06:35:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:57,552 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2020-10-20 06:35:57,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 06:35:57,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 187 transitions. [2020-10-20 06:35:57,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:57,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 177 states and 185 transitions. [2020-10-20 06:35:57,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2020-10-20 06:35:57,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2020-10-20 06:35:57,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 185 transitions. [2020-10-20 06:35:57,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:57,556 INFO L691 BuchiCegarLoop]: Abstraction has 177 states and 185 transitions. [2020-10-20 06:35:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 185 transitions. [2020-10-20 06:35:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 163. [2020-10-20 06:35:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-20 06:35:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 171 transitions. [2020-10-20 06:35:57,560 INFO L714 BuchiCegarLoop]: Abstraction has 163 states and 171 transitions. [2020-10-20 06:35:57,561 INFO L594 BuchiCegarLoop]: Abstraction has 163 states and 171 transitions. [2020-10-20 06:35:57,561 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-10-20 06:35:57,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 171 transitions. [2020-10-20 06:35:57,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:57,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:57,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:57,564 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 9, 1, 1] [2020-10-20 06:35:57,564 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:35:57,564 INFO L794 eck$LassoCheckResult]: Stem: 4975#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 4976#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5010#L14 assume !(0 == main_~i~0); 5008#L14-2 assume !(main_~i~0 == main_~range~0); 5007#L17-1 assume !(1 == main_~up~0); 5006#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5004#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4990#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4991#L14 assume !(0 == main_~i~0); 4983#L14-2 assume !(main_~i~0 == main_~range~0); 4984#L17-1 assume !(1 == main_~up~0); 5059#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5058#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5057#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5056#L14 assume !(0 == main_~i~0); 5055#L14-2 assume !(main_~i~0 == main_~range~0); 5054#L17-1 assume !(1 == main_~up~0); 5053#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5052#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5051#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5050#L14 assume !(0 == main_~i~0); 5049#L14-2 assume !(main_~i~0 == main_~range~0); 5048#L17-1 assume !(1 == main_~up~0); 5047#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5046#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5045#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5044#L14 assume !(0 == main_~i~0); 5043#L14-2 assume !(main_~i~0 == main_~range~0); 5042#L17-1 assume !(1 == main_~up~0); 5041#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5040#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5039#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5038#L14 assume !(0 == main_~i~0); 5037#L14-2 assume !(main_~i~0 == main_~range~0); 5036#L17-1 assume !(1 == main_~up~0); 5035#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5034#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5033#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5032#L14 assume !(0 == main_~i~0); 5031#L14-2 assume !(main_~i~0 == main_~range~0); 5030#L17-1 assume !(1 == main_~up~0); 5029#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5028#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5027#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5026#L14 assume !(0 == main_~i~0); 5025#L14-2 assume !(main_~i~0 == main_~range~0); 5024#L17-1 assume !(1 == main_~up~0); 5023#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5022#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5016#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5021#L14 assume !(0 == main_~i~0); 5020#L14-2 assume !(main_~i~0 == main_~range~0); 5019#L17-1 assume !(1 == main_~up~0); 5018#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5014#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5015#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5068#L14 assume 0 == main_~i~0;main_~up~0 := 1; 5069#L14-2 [2020-10-20 06:35:57,564 INFO L796 eck$LassoCheckResult]: Loop: 5069#L14-2 assume !(main_~i~0 == main_~range~0); 5064#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5065#L20-1 assume !(0 == main_~up~0); 5081#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 5080#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5079#L14 assume !(0 == main_~i~0); 5078#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 5077#L17-1 assume !(1 == main_~up~0); 5076#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5074#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 5071#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5072#L14 assume 0 == main_~i~0;main_~up~0 := 1; 5069#L14-2 [2020-10-20 06:35:57,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:57,565 INFO L82 PathProgramCache]: Analyzing trace with hash 815169148, now seen corresponding path program 9 times [2020-10-20 06:35:57,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:57,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148229838] [2020-10-20 06:35:57,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:57,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148229838] [2020-10-20 06:35:57,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832249162] [2020-10-20 06:35:57,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:35:57,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-10-20 06:35:57,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:35:57,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:35:57,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:57,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:35:57,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-10-20 06:35:57,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952747583] [2020-10-20 06:35:57,738 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:35:57,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:57,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 10 times [2020-10-20 06:35:57,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:57,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041315777] [2020-10-20 06:35:57,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:57,743 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:57,745 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:57,746 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:57,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:57,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 06:35:57,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2020-10-20 06:35:57,796 INFO L87 Difference]: Start difference. First operand 163 states and 171 transitions. cyclomatic complexity: 12 Second operand 13 states. [2020-10-20 06:35:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:58,007 INFO L93 Difference]: Finished difference Result 191 states and 199 transitions. [2020-10-20 06:35:58,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-20 06:35:58,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 199 transitions. [2020-10-20 06:35:58,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:58,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 189 states and 197 transitions. [2020-10-20 06:35:58,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2020-10-20 06:35:58,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2020-10-20 06:35:58,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 197 transitions. [2020-10-20 06:35:58,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:58,014 INFO L691 BuchiCegarLoop]: Abstraction has 189 states and 197 transitions. [2020-10-20 06:35:58,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 197 transitions. [2020-10-20 06:35:58,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 175. [2020-10-20 06:35:58,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-10-20 06:35:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 183 transitions. [2020-10-20 06:35:58,021 INFO L714 BuchiCegarLoop]: Abstraction has 175 states and 183 transitions. [2020-10-20 06:35:58,021 INFO L594 BuchiCegarLoop]: Abstraction has 175 states and 183 transitions. [2020-10-20 06:35:58,021 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-10-20 06:35:58,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 183 transitions. [2020-10-20 06:35:58,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:58,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:58,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:58,024 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 1, 1] [2020-10-20 06:35:58,025 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:35:58,025 INFO L794 eck$LassoCheckResult]: Stem: 5525#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 5526#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5560#L14 assume !(0 == main_~i~0); 5558#L14-2 assume !(main_~i~0 == main_~range~0); 5557#L17-1 assume !(1 == main_~up~0); 5556#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5554#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5540#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5541#L14 assume !(0 == main_~i~0); 5533#L14-2 assume !(main_~i~0 == main_~range~0); 5534#L17-1 assume !(1 == main_~up~0); 5615#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5614#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5613#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5612#L14 assume !(0 == main_~i~0); 5611#L14-2 assume !(main_~i~0 == main_~range~0); 5610#L17-1 assume !(1 == main_~up~0); 5609#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5608#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5607#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5606#L14 assume !(0 == main_~i~0); 5605#L14-2 assume !(main_~i~0 == main_~range~0); 5604#L17-1 assume !(1 == main_~up~0); 5603#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5602#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5601#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5600#L14 assume !(0 == main_~i~0); 5599#L14-2 assume !(main_~i~0 == main_~range~0); 5598#L17-1 assume !(1 == main_~up~0); 5597#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5596#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5595#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5594#L14 assume !(0 == main_~i~0); 5593#L14-2 assume !(main_~i~0 == main_~range~0); 5592#L17-1 assume !(1 == main_~up~0); 5591#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5590#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5589#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5588#L14 assume !(0 == main_~i~0); 5587#L14-2 assume !(main_~i~0 == main_~range~0); 5586#L17-1 assume !(1 == main_~up~0); 5585#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5584#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5583#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5582#L14 assume !(0 == main_~i~0); 5581#L14-2 assume !(main_~i~0 == main_~range~0); 5580#L17-1 assume !(1 == main_~up~0); 5579#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5578#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5577#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5576#L14 assume !(0 == main_~i~0); 5575#L14-2 assume !(main_~i~0 == main_~range~0); 5574#L17-1 assume !(1 == main_~up~0); 5573#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5572#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5566#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5571#L14 assume !(0 == main_~i~0); 5570#L14-2 assume !(main_~i~0 == main_~range~0); 5569#L17-1 assume !(1 == main_~up~0); 5568#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5564#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5565#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5624#L14 assume 0 == main_~i~0;main_~up~0 := 1; 5625#L14-2 [2020-10-20 06:35:58,025 INFO L796 eck$LassoCheckResult]: Loop: 5625#L14-2 assume !(main_~i~0 == main_~range~0); 5620#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5621#L20-1 assume !(0 == main_~up~0); 5637#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 5636#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5635#L14 assume !(0 == main_~i~0); 5634#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 5633#L17-1 assume !(1 == main_~up~0); 5632#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5630#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 5627#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5628#L14 assume 0 == main_~i~0;main_~up~0 := 1; 5625#L14-2 [2020-10-20 06:35:58,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:58,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1743915853, now seen corresponding path program 10 times [2020-10-20 06:35:58,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:58,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504265022] [2020-10-20 06:35:58,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:58,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504265022] [2020-10-20 06:35:58,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852711486] [2020-10-20 06:35:58,165 INFO L93 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 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 [2020-10-20 06:35:58,213 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 06:35:58,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:35:58,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 06:35:58,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:58,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:35:58,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-10-20 06:35:58,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612916463] [2020-10-20 06:35:58,285 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:35:58,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:58,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 11 times [2020-10-20 06:35:58,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:58,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358569372] [2020-10-20 06:35:58,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:58,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:58,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:58,293 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:58,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:58,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 06:35:58,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2020-10-20 06:35:58,344 INFO L87 Difference]: Start difference. First operand 175 states and 183 transitions. cyclomatic complexity: 12 Second operand 14 states. [2020-10-20 06:35:58,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:58,543 INFO L93 Difference]: Finished difference Result 203 states and 211 transitions. [2020-10-20 06:35:58,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-20 06:35:58,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 203 states and 211 transitions. [2020-10-20 06:35:58,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:58,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 203 states to 201 states and 209 transitions. [2020-10-20 06:35:58,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2020-10-20 06:35:58,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2020-10-20 06:35:58,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 209 transitions. [2020-10-20 06:35:58,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:58,549 INFO L691 BuchiCegarLoop]: Abstraction has 201 states and 209 transitions. [2020-10-20 06:35:58,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states and 209 transitions. [2020-10-20 06:35:58,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 187. [2020-10-20 06:35:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-10-20 06:35:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 195 transitions. [2020-10-20 06:35:58,554 INFO L714 BuchiCegarLoop]: Abstraction has 187 states and 195 transitions. [2020-10-20 06:35:58,554 INFO L594 BuchiCegarLoop]: Abstraction has 187 states and 195 transitions. [2020-10-20 06:35:58,554 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-10-20 06:35:58,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 187 states and 195 transitions. [2020-10-20 06:35:58,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:58,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:58,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:58,557 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 11, 11, 11, 11, 1, 1] [2020-10-20 06:35:58,557 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:35:58,558 INFO L794 eck$LassoCheckResult]: Stem: 6114#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 6115#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6152#L14 assume !(0 == main_~i~0); 6150#L14-2 assume !(main_~i~0 == main_~range~0); 6149#L17-1 assume !(1 == main_~up~0); 6148#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6146#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6132#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6133#L14 assume !(0 == main_~i~0); 6125#L14-2 assume !(main_~i~0 == main_~range~0); 6126#L17-1 assume !(1 == main_~up~0); 6214#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6213#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6212#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6211#L14 assume !(0 == main_~i~0); 6210#L14-2 assume !(main_~i~0 == main_~range~0); 6209#L17-1 assume !(1 == main_~up~0); 6208#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6207#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6206#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6205#L14 assume !(0 == main_~i~0); 6204#L14-2 assume !(main_~i~0 == main_~range~0); 6203#L17-1 assume !(1 == main_~up~0); 6202#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6201#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6200#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6199#L14 assume !(0 == main_~i~0); 6198#L14-2 assume !(main_~i~0 == main_~range~0); 6197#L17-1 assume !(1 == main_~up~0); 6196#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6195#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6194#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6193#L14 assume !(0 == main_~i~0); 6192#L14-2 assume !(main_~i~0 == main_~range~0); 6191#L17-1 assume !(1 == main_~up~0); 6190#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6189#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6188#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6187#L14 assume !(0 == main_~i~0); 6186#L14-2 assume !(main_~i~0 == main_~range~0); 6185#L17-1 assume !(1 == main_~up~0); 6184#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6183#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6182#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6181#L14 assume !(0 == main_~i~0); 6180#L14-2 assume !(main_~i~0 == main_~range~0); 6179#L17-1 assume !(1 == main_~up~0); 6178#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6177#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6176#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6175#L14 assume !(0 == main_~i~0); 6174#L14-2 assume !(main_~i~0 == main_~range~0); 6173#L17-1 assume !(1 == main_~up~0); 6172#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6171#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6170#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6169#L14 assume !(0 == main_~i~0); 6168#L14-2 assume !(main_~i~0 == main_~range~0); 6167#L17-1 assume !(1 == main_~up~0); 6166#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6165#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6160#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6164#L14 assume !(0 == main_~i~0); 6163#L14-2 assume !(main_~i~0 == main_~range~0); 6162#L17-1 assume !(1 == main_~up~0); 6161#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6158#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6159#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6223#L14 assume 0 == main_~i~0;main_~up~0 := 1; 6224#L14-2 [2020-10-20 06:35:58,558 INFO L796 eck$LassoCheckResult]: Loop: 6224#L14-2 assume !(main_~i~0 == main_~range~0); 6219#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6220#L20-1 assume !(0 == main_~up~0); 6236#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 6235#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6234#L14 assume !(0 == main_~i~0); 6233#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 6232#L17-1 assume !(1 == main_~up~0); 6231#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6229#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 6226#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6227#L14 assume 0 == main_~i~0;main_~up~0 := 1; 6224#L14-2 [2020-10-20 06:35:58,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:58,558 INFO L82 PathProgramCache]: Analyzing trace with hash -2023032994, now seen corresponding path program 11 times [2020-10-20 06:35:58,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:58,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686077441] [2020-10-20 06:35:58,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:58,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686077441] [2020-10-20 06:35:58,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068433716] [2020-10-20 06:35:58,678 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:35:58,738 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2020-10-20 06:35:58,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:35:58,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-20 06:35:58,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:58,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:35:58,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2020-10-20 06:35:58,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107096286] [2020-10-20 06:35:58,870 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:35:58,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:58,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 12 times [2020-10-20 06:35:58,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:58,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475824615] [2020-10-20 06:35:58,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:58,874 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:58,877 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:58,878 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:58,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:58,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-20 06:35:58,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2020-10-20 06:35:58,922 INFO L87 Difference]: Start difference. First operand 187 states and 195 transitions. cyclomatic complexity: 12 Second operand 21 states. [2020-10-20 06:35:59,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:35:59,328 INFO L93 Difference]: Finished difference Result 215 states and 223 transitions. [2020-10-20 06:35:59,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-20 06:35:59,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 215 states and 223 transitions. [2020-10-20 06:35:59,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:59,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 215 states to 213 states and 221 transitions. [2020-10-20 06:35:59,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2020-10-20 06:35:59,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2020-10-20 06:35:59,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 213 states and 221 transitions. [2020-10-20 06:35:59,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:35:59,334 INFO L691 BuchiCegarLoop]: Abstraction has 213 states and 221 transitions. [2020-10-20 06:35:59,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states and 221 transitions. [2020-10-20 06:35:59,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 199. [2020-10-20 06:35:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-10-20 06:35:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 207 transitions. [2020-10-20 06:35:59,339 INFO L714 BuchiCegarLoop]: Abstraction has 199 states and 207 transitions. [2020-10-20 06:35:59,339 INFO L594 BuchiCegarLoop]: Abstraction has 199 states and 207 transitions. [2020-10-20 06:35:59,340 INFO L427 BuchiCegarLoop]: ======== Iteration 22============ [2020-10-20 06:35:59,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 199 states and 207 transitions. [2020-10-20 06:35:59,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:35:59,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:35:59,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:35:59,343 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 12, 12, 12, 12, 1, 1] [2020-10-20 06:35:59,343 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:35:59,344 INFO L794 eck$LassoCheckResult]: Stem: 6784#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 6785#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6818#L14 assume !(0 == main_~i~0); 6816#L14-2 assume !(main_~i~0 == main_~range~0); 6815#L17-1 assume !(1 == main_~up~0); 6814#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6812#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6798#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6799#L14 assume !(0 == main_~i~0); 6791#L14-2 assume !(main_~i~0 == main_~range~0); 6792#L17-1 assume !(1 == main_~up~0); 6886#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6885#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6884#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6883#L14 assume !(0 == main_~i~0); 6882#L14-2 assume !(main_~i~0 == main_~range~0); 6881#L17-1 assume !(1 == main_~up~0); 6880#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6879#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6878#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6877#L14 assume !(0 == main_~i~0); 6876#L14-2 assume !(main_~i~0 == main_~range~0); 6875#L17-1 assume !(1 == main_~up~0); 6874#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6873#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6872#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6871#L14 assume !(0 == main_~i~0); 6870#L14-2 assume !(main_~i~0 == main_~range~0); 6869#L17-1 assume !(1 == main_~up~0); 6868#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6867#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6866#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6865#L14 assume !(0 == main_~i~0); 6864#L14-2 assume !(main_~i~0 == main_~range~0); 6863#L17-1 assume !(1 == main_~up~0); 6862#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6861#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6860#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6859#L14 assume !(0 == main_~i~0); 6858#L14-2 assume !(main_~i~0 == main_~range~0); 6857#L17-1 assume !(1 == main_~up~0); 6856#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6855#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6854#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6853#L14 assume !(0 == main_~i~0); 6852#L14-2 assume !(main_~i~0 == main_~range~0); 6851#L17-1 assume !(1 == main_~up~0); 6850#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6849#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6848#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6847#L14 assume !(0 == main_~i~0); 6846#L14-2 assume !(main_~i~0 == main_~range~0); 6845#L17-1 assume !(1 == main_~up~0); 6844#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6843#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6842#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6841#L14 assume !(0 == main_~i~0); 6840#L14-2 assume !(main_~i~0 == main_~range~0); 6839#L17-1 assume !(1 == main_~up~0); 6838#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6837#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6836#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6835#L14 assume !(0 == main_~i~0); 6834#L14-2 assume !(main_~i~0 == main_~range~0); 6833#L17-1 assume !(1 == main_~up~0); 6832#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6831#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6825#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6830#L14 assume !(0 == main_~i~0); 6829#L14-2 assume !(main_~i~0 == main_~range~0); 6828#L17-1 assume !(1 == main_~up~0); 6827#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6824#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6826#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6895#L14 assume 0 == main_~i~0;main_~up~0 := 1; 6896#L14-2 [2020-10-20 06:35:59,344 INFO L796 eck$LassoCheckResult]: Loop: 6896#L14-2 assume !(main_~i~0 == main_~range~0); 6891#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6892#L20-1 assume !(0 == main_~up~0); 6908#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 6907#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6906#L14 assume !(0 == main_~i~0); 6905#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 6904#L17-1 assume !(1 == main_~up~0); 6903#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6901#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 6898#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6899#L14 assume 0 == main_~i~0;main_~up~0 := 1; 6896#L14-2 [2020-10-20 06:35:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash -288566609, now seen corresponding path program 12 times [2020-10-20 06:35:59,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:59,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861613220] [2020-10-20 06:35:59,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:59,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861613220] [2020-10-20 06:35:59,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972080702] [2020-10-20 06:35:59,514 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:35:59,565 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2020-10-20 06:35:59,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:35:59,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 06:35:59,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:59,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:35:59,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 20 [2020-10-20 06:35:59,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298617203] [2020-10-20 06:35:59,721 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:35:59,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:59,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 13 times [2020-10-20 06:35:59,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:35:59,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111097034] [2020-10-20 06:35:59,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:35:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:59,730 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:35:59,732 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:35:59,733 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:35:59,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:35:59,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-20 06:35:59,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2020-10-20 06:35:59,785 INFO L87 Difference]: Start difference. First operand 199 states and 207 transitions. cyclomatic complexity: 12 Second operand 22 states. [2020-10-20 06:36:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:00,223 INFO L93 Difference]: Finished difference Result 227 states and 235 transitions. [2020-10-20 06:36:00,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-20 06:36:00,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 227 states and 235 transitions. [2020-10-20 06:36:00,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:36:00,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 227 states to 225 states and 233 transitions. [2020-10-20 06:36:00,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2020-10-20 06:36:00,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2020-10-20 06:36:00,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 225 states and 233 transitions. [2020-10-20 06:36:00,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:00,229 INFO L691 BuchiCegarLoop]: Abstraction has 225 states and 233 transitions. [2020-10-20 06:36:00,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states and 233 transitions. [2020-10-20 06:36:00,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 211. [2020-10-20 06:36:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-10-20 06:36:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 219 transitions. [2020-10-20 06:36:00,234 INFO L714 BuchiCegarLoop]: Abstraction has 211 states and 219 transitions. [2020-10-20 06:36:00,234 INFO L594 BuchiCegarLoop]: Abstraction has 211 states and 219 transitions. [2020-10-20 06:36:00,234 INFO L427 BuchiCegarLoop]: ======== Iteration 23============ [2020-10-20 06:36:00,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 219 transitions. [2020-10-20 06:36:00,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:36:00,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:00,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:00,237 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [14, 13, 13, 13, 13, 13, 1, 1] [2020-10-20 06:36:00,237 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:36:00,238 INFO L794 eck$LassoCheckResult]: Stem: 7489#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 7490#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7527#L14 assume !(0 == main_~i~0); 7525#L14-2 assume !(main_~i~0 == main_~range~0); 7524#L17-1 assume !(1 == main_~up~0); 7523#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7521#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7507#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7508#L14 assume !(0 == main_~i~0); 7500#L14-2 assume !(main_~i~0 == main_~range~0); 7501#L17-1 assume !(1 == main_~up~0); 7601#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7600#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7599#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7598#L14 assume !(0 == main_~i~0); 7597#L14-2 assume !(main_~i~0 == main_~range~0); 7596#L17-1 assume !(1 == main_~up~0); 7595#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7594#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7593#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7592#L14 assume !(0 == main_~i~0); 7591#L14-2 assume !(main_~i~0 == main_~range~0); 7590#L17-1 assume !(1 == main_~up~0); 7589#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7588#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7587#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7586#L14 assume !(0 == main_~i~0); 7585#L14-2 assume !(main_~i~0 == main_~range~0); 7584#L17-1 assume !(1 == main_~up~0); 7583#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7582#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7581#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7580#L14 assume !(0 == main_~i~0); 7579#L14-2 assume !(main_~i~0 == main_~range~0); 7578#L17-1 assume !(1 == main_~up~0); 7577#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7576#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7575#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7574#L14 assume !(0 == main_~i~0); 7573#L14-2 assume !(main_~i~0 == main_~range~0); 7572#L17-1 assume !(1 == main_~up~0); 7571#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7570#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7569#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7568#L14 assume !(0 == main_~i~0); 7567#L14-2 assume !(main_~i~0 == main_~range~0); 7566#L17-1 assume !(1 == main_~up~0); 7565#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7564#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7563#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7562#L14 assume !(0 == main_~i~0); 7561#L14-2 assume !(main_~i~0 == main_~range~0); 7560#L17-1 assume !(1 == main_~up~0); 7559#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7558#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7557#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7556#L14 assume !(0 == main_~i~0); 7555#L14-2 assume !(main_~i~0 == main_~range~0); 7554#L17-1 assume !(1 == main_~up~0); 7553#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7552#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7551#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7550#L14 assume !(0 == main_~i~0); 7549#L14-2 assume !(main_~i~0 == main_~range~0); 7548#L17-1 assume !(1 == main_~up~0); 7547#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7546#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7545#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7544#L14 assume !(0 == main_~i~0); 7543#L14-2 assume !(main_~i~0 == main_~range~0); 7542#L17-1 assume !(1 == main_~up~0); 7541#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7540#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7534#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7539#L14 assume !(0 == main_~i~0); 7538#L14-2 assume !(main_~i~0 == main_~range~0); 7537#L17-1 assume !(1 == main_~up~0); 7536#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7533#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7535#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7610#L14 assume 0 == main_~i~0;main_~up~0 := 1; 7611#L14-2 [2020-10-20 06:36:00,238 INFO L796 eck$LassoCheckResult]: Loop: 7611#L14-2 assume !(main_~i~0 == main_~range~0); 7606#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7607#L20-1 assume !(0 == main_~up~0); 7623#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 7622#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7621#L14 assume !(0 == main_~i~0); 7620#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 7619#L17-1 assume !(1 == main_~up~0); 7618#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7616#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 7613#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7614#L14 assume 0 == main_~i~0;main_~up~0 := 1; 7611#L14-2 [2020-10-20 06:36:00,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:00,238 INFO L82 PathProgramCache]: Analyzing trace with hash 989277504, now seen corresponding path program 13 times [2020-10-20 06:36:00,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:00,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602316115] [2020-10-20 06:36:00,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:00,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602316115] [2020-10-20 06:36:00,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92415309] [2020-10-20 06:36:00,385 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:00,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-20 06:36:00,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:00,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:00,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2020-10-20 06:36:00,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306827373] [2020-10-20 06:36:00,468 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:00,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:00,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 14 times [2020-10-20 06:36:00,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:00,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169723149] [2020-10-20 06:36:00,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:00,473 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:00,475 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:00,476 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:00,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:00,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-20 06:36:00,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2020-10-20 06:36:00,522 INFO L87 Difference]: Start difference. First operand 211 states and 219 transitions. cyclomatic complexity: 12 Second operand 17 states. [2020-10-20 06:36:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:00,689 INFO L93 Difference]: Finished difference Result 239 states and 247 transitions. [2020-10-20 06:36:00,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-20 06:36:00,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 239 states and 247 transitions. [2020-10-20 06:36:00,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:36:00,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 239 states to 237 states and 245 transitions. [2020-10-20 06:36:00,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2020-10-20 06:36:00,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2020-10-20 06:36:00,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 237 states and 245 transitions. [2020-10-20 06:36:00,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:00,694 INFO L691 BuchiCegarLoop]: Abstraction has 237 states and 245 transitions. [2020-10-20 06:36:00,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states and 245 transitions. [2020-10-20 06:36:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 223. [2020-10-20 06:36:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-10-20 06:36:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 231 transitions. [2020-10-20 06:36:00,699 INFO L714 BuchiCegarLoop]: Abstraction has 223 states and 231 transitions. [2020-10-20 06:36:00,699 INFO L594 BuchiCegarLoop]: Abstraction has 223 states and 231 transitions. [2020-10-20 06:36:00,699 INFO L427 BuchiCegarLoop]: ======== Iteration 24============ [2020-10-20 06:36:00,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 223 states and 231 transitions. [2020-10-20 06:36:00,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:36:00,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:00,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:00,702 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [15, 14, 14, 14, 14, 14, 1, 1] [2020-10-20 06:36:00,702 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:36:00,703 INFO L794 eck$LassoCheckResult]: Stem: 8215#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 8216#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8249#L14 assume !(0 == main_~i~0); 8247#L14-2 assume !(main_~i~0 == main_~range~0); 8246#L17-1 assume !(1 == main_~up~0); 8245#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8243#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8229#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8230#L14 assume !(0 == main_~i~0); 8222#L14-2 assume !(main_~i~0 == main_~range~0); 8223#L17-1 assume !(1 == main_~up~0); 8329#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8328#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8327#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8326#L14 assume !(0 == main_~i~0); 8325#L14-2 assume !(main_~i~0 == main_~range~0); 8324#L17-1 assume !(1 == main_~up~0); 8323#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8322#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8321#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8320#L14 assume !(0 == main_~i~0); 8319#L14-2 assume !(main_~i~0 == main_~range~0); 8318#L17-1 assume !(1 == main_~up~0); 8317#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8316#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8315#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8314#L14 assume !(0 == main_~i~0); 8313#L14-2 assume !(main_~i~0 == main_~range~0); 8312#L17-1 assume !(1 == main_~up~0); 8311#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8310#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8309#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8308#L14 assume !(0 == main_~i~0); 8307#L14-2 assume !(main_~i~0 == main_~range~0); 8306#L17-1 assume !(1 == main_~up~0); 8305#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8304#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8303#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8302#L14 assume !(0 == main_~i~0); 8301#L14-2 assume !(main_~i~0 == main_~range~0); 8300#L17-1 assume !(1 == main_~up~0); 8299#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8298#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8297#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8296#L14 assume !(0 == main_~i~0); 8295#L14-2 assume !(main_~i~0 == main_~range~0); 8294#L17-1 assume !(1 == main_~up~0); 8293#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8292#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8291#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8290#L14 assume !(0 == main_~i~0); 8289#L14-2 assume !(main_~i~0 == main_~range~0); 8288#L17-1 assume !(1 == main_~up~0); 8287#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8286#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8285#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8284#L14 assume !(0 == main_~i~0); 8283#L14-2 assume !(main_~i~0 == main_~range~0); 8282#L17-1 assume !(1 == main_~up~0); 8281#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8280#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8279#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8278#L14 assume !(0 == main_~i~0); 8277#L14-2 assume !(main_~i~0 == main_~range~0); 8276#L17-1 assume !(1 == main_~up~0); 8275#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8274#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8273#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8272#L14 assume !(0 == main_~i~0); 8271#L14-2 assume !(main_~i~0 == main_~range~0); 8270#L17-1 assume !(1 == main_~up~0); 8269#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8268#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8267#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8266#L14 assume !(0 == main_~i~0); 8265#L14-2 assume !(main_~i~0 == main_~range~0); 8264#L17-1 assume !(1 == main_~up~0); 8263#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8262#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8256#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8261#L14 assume !(0 == main_~i~0); 8260#L14-2 assume !(main_~i~0 == main_~range~0); 8259#L17-1 assume !(1 == main_~up~0); 8258#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8255#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8257#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8338#L14 assume 0 == main_~i~0;main_~up~0 := 1; 8339#L14-2 [2020-10-20 06:36:00,703 INFO L796 eck$LassoCheckResult]: Loop: 8339#L14-2 assume !(main_~i~0 == main_~range~0); 8334#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8335#L20-1 assume !(0 == main_~up~0); 8351#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 8350#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8349#L14 assume !(0 == main_~i~0); 8348#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 8347#L17-1 assume !(1 == main_~up~0); 8346#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8344#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 8341#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8342#L14 assume 0 == main_~i~0;main_~up~0 := 1; 8339#L14-2 [2020-10-20 06:36:00,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:00,704 INFO L82 PathProgramCache]: Analyzing trace with hash 652056337, now seen corresponding path program 14 times [2020-10-20 06:36:00,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:00,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395795067] [2020-10-20 06:36:00,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:00,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395795067] [2020-10-20 06:36:00,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099902391] [2020-10-20 06:36:00,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:00,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:36:00,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:00,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 06:36:00,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:00,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:00,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2020-10-20 06:36:00,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426407137] [2020-10-20 06:36:00,961 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:00,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:00,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 15 times [2020-10-20 06:36:00,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:00,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433155999] [2020-10-20 06:36:00,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:00,966 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:00,968 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:00,970 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:01,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:01,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-20 06:36:01,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2020-10-20 06:36:01,022 INFO L87 Difference]: Start difference. First operand 223 states and 231 transitions. cyclomatic complexity: 12 Second operand 18 states. [2020-10-20 06:36:01,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:01,229 INFO L93 Difference]: Finished difference Result 251 states and 259 transitions. [2020-10-20 06:36:01,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-20 06:36:01,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 251 states and 259 transitions. [2020-10-20 06:36:01,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:36:01,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 251 states to 249 states and 257 transitions. [2020-10-20 06:36:01,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2020-10-20 06:36:01,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2020-10-20 06:36:01,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 249 states and 257 transitions. [2020-10-20 06:36:01,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:01,234 INFO L691 BuchiCegarLoop]: Abstraction has 249 states and 257 transitions. [2020-10-20 06:36:01,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states and 257 transitions. [2020-10-20 06:36:01,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 235. [2020-10-20 06:36:01,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2020-10-20 06:36:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 243 transitions. [2020-10-20 06:36:01,240 INFO L714 BuchiCegarLoop]: Abstraction has 235 states and 243 transitions. [2020-10-20 06:36:01,240 INFO L594 BuchiCegarLoop]: Abstraction has 235 states and 243 transitions. [2020-10-20 06:36:01,240 INFO L427 BuchiCegarLoop]: ======== Iteration 25============ [2020-10-20 06:36:01,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 235 states and 243 transitions. [2020-10-20 06:36:01,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:36:01,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:01,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:01,243 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [16, 15, 15, 15, 15, 15, 1, 1] [2020-10-20 06:36:01,243 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:36:01,243 INFO L794 eck$LassoCheckResult]: Stem: 8976#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 8977#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9015#L14 assume !(0 == main_~i~0); 9013#L14-2 assume !(main_~i~0 == main_~range~0); 9012#L17-1 assume !(1 == main_~up~0); 9011#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9009#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8995#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8996#L14 assume !(0 == main_~i~0); 8988#L14-2 assume !(main_~i~0 == main_~range~0); 8989#L17-1 assume !(1 == main_~up~0); 9100#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9099#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9098#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9097#L14 assume !(0 == main_~i~0); 9096#L14-2 assume !(main_~i~0 == main_~range~0); 9095#L17-1 assume !(1 == main_~up~0); 9094#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9093#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9092#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9091#L14 assume !(0 == main_~i~0); 9090#L14-2 assume !(main_~i~0 == main_~range~0); 9089#L17-1 assume !(1 == main_~up~0); 9088#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9087#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9086#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9085#L14 assume !(0 == main_~i~0); 9084#L14-2 assume !(main_~i~0 == main_~range~0); 9083#L17-1 assume !(1 == main_~up~0); 9082#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9081#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9080#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9079#L14 assume !(0 == main_~i~0); 9078#L14-2 assume !(main_~i~0 == main_~range~0); 9077#L17-1 assume !(1 == main_~up~0); 9076#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9075#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9074#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9073#L14 assume !(0 == main_~i~0); 9072#L14-2 assume !(main_~i~0 == main_~range~0); 9071#L17-1 assume !(1 == main_~up~0); 9070#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9069#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9068#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9067#L14 assume !(0 == main_~i~0); 9066#L14-2 assume !(main_~i~0 == main_~range~0); 9065#L17-1 assume !(1 == main_~up~0); 9064#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9063#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9062#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9061#L14 assume !(0 == main_~i~0); 9060#L14-2 assume !(main_~i~0 == main_~range~0); 9059#L17-1 assume !(1 == main_~up~0); 9058#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9057#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9056#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9055#L14 assume !(0 == main_~i~0); 9054#L14-2 assume !(main_~i~0 == main_~range~0); 9053#L17-1 assume !(1 == main_~up~0); 9052#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9051#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9050#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9049#L14 assume !(0 == main_~i~0); 9048#L14-2 assume !(main_~i~0 == main_~range~0); 9047#L17-1 assume !(1 == main_~up~0); 9046#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9045#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9044#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9043#L14 assume !(0 == main_~i~0); 9042#L14-2 assume !(main_~i~0 == main_~range~0); 9041#L17-1 assume !(1 == main_~up~0); 9040#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9039#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9038#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9037#L14 assume !(0 == main_~i~0); 9036#L14-2 assume !(main_~i~0 == main_~range~0); 9035#L17-1 assume !(1 == main_~up~0); 9034#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9033#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9032#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9031#L14 assume !(0 == main_~i~0); 9030#L14-2 assume !(main_~i~0 == main_~range~0); 9029#L17-1 assume !(1 == main_~up~0); 9028#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9027#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9020#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9026#L14 assume !(0 == main_~i~0); 9025#L14-2 assume !(main_~i~0 == main_~range~0); 9024#L17-1 assume !(1 == main_~up~0); 9023#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9019#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9021#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9109#L14 assume 0 == main_~i~0;main_~up~0 := 1; 9110#L14-2 [2020-10-20 06:36:01,244 INFO L796 eck$LassoCheckResult]: Loop: 9110#L14-2 assume !(main_~i~0 == main_~range~0); 9105#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9106#L20-1 assume !(0 == main_~up~0); 9122#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 9121#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9120#L14 assume !(0 == main_~i~0); 9119#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 9118#L17-1 assume !(1 == main_~up~0); 9117#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9115#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 9112#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9113#L14 assume 0 == main_~i~0;main_~up~0 := 1; 9110#L14-2 [2020-10-20 06:36:01,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:01,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1400397790, now seen corresponding path program 15 times [2020-10-20 06:36:01,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:01,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725488527] [2020-10-20 06:36:01,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:01,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725488527] [2020-10-20 06:36:01,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405871151] [2020-10-20 06:36:01,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:01,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2020-10-20 06:36:01,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:01,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-20 06:36:01,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:01,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:01,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2020-10-20 06:36:01,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684920432] [2020-10-20 06:36:01,543 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:01,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:01,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 16 times [2020-10-20 06:36:01,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:01,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331474415] [2020-10-20 06:36:01,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:01,547 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:01,549 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:01,550 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:01,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:01,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-20 06:36:01,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2020-10-20 06:36:01,602 INFO L87 Difference]: Start difference. First operand 235 states and 243 transitions. cyclomatic complexity: 12 Second operand 19 states. [2020-10-20 06:36:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:01,853 INFO L93 Difference]: Finished difference Result 263 states and 271 transitions. [2020-10-20 06:36:01,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-20 06:36:01,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 271 transitions. [2020-10-20 06:36:01,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:36:01,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 261 states and 269 transitions. [2020-10-20 06:36:01,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2020-10-20 06:36:01,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2020-10-20 06:36:01,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 261 states and 269 transitions. [2020-10-20 06:36:01,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:01,859 INFO L691 BuchiCegarLoop]: Abstraction has 261 states and 269 transitions. [2020-10-20 06:36:01,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states and 269 transitions. [2020-10-20 06:36:01,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 247. [2020-10-20 06:36:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-10-20 06:36:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 255 transitions. [2020-10-20 06:36:01,863 INFO L714 BuchiCegarLoop]: Abstraction has 247 states and 255 transitions. [2020-10-20 06:36:01,864 INFO L594 BuchiCegarLoop]: Abstraction has 247 states and 255 transitions. [2020-10-20 06:36:01,864 INFO L427 BuchiCegarLoop]: ======== Iteration 26============ [2020-10-20 06:36:01,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 247 states and 255 transitions. [2020-10-20 06:36:01,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:36:01,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:01,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:01,866 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [17, 16, 16, 16, 16, 16, 1, 1] [2020-10-20 06:36:01,867 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:36:01,867 INFO L794 eck$LassoCheckResult]: Stem: 9788#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 9789#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9822#L14 assume !(0 == main_~i~0); 9820#L14-2 assume !(main_~i~0 == main_~range~0); 9819#L17-1 assume !(1 == main_~up~0); 9818#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9816#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9802#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9803#L14 assume !(0 == main_~i~0); 9795#L14-2 assume !(main_~i~0 == main_~range~0); 9796#L17-1 assume !(1 == main_~up~0); 9914#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9913#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9912#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9911#L14 assume !(0 == main_~i~0); 9910#L14-2 assume !(main_~i~0 == main_~range~0); 9909#L17-1 assume !(1 == main_~up~0); 9908#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9907#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9906#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9905#L14 assume !(0 == main_~i~0); 9904#L14-2 assume !(main_~i~0 == main_~range~0); 9903#L17-1 assume !(1 == main_~up~0); 9902#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9901#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9900#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9899#L14 assume !(0 == main_~i~0); 9898#L14-2 assume !(main_~i~0 == main_~range~0); 9897#L17-1 assume !(1 == main_~up~0); 9896#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9895#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9894#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9893#L14 assume !(0 == main_~i~0); 9892#L14-2 assume !(main_~i~0 == main_~range~0); 9891#L17-1 assume !(1 == main_~up~0); 9890#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9889#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9888#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9887#L14 assume !(0 == main_~i~0); 9886#L14-2 assume !(main_~i~0 == main_~range~0); 9885#L17-1 assume !(1 == main_~up~0); 9884#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9883#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9882#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9881#L14 assume !(0 == main_~i~0); 9880#L14-2 assume !(main_~i~0 == main_~range~0); 9879#L17-1 assume !(1 == main_~up~0); 9878#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9877#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9876#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9875#L14 assume !(0 == main_~i~0); 9874#L14-2 assume !(main_~i~0 == main_~range~0); 9873#L17-1 assume !(1 == main_~up~0); 9872#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9871#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9870#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9869#L14 assume !(0 == main_~i~0); 9868#L14-2 assume !(main_~i~0 == main_~range~0); 9867#L17-1 assume !(1 == main_~up~0); 9866#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9865#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9864#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9863#L14 assume !(0 == main_~i~0); 9862#L14-2 assume !(main_~i~0 == main_~range~0); 9861#L17-1 assume !(1 == main_~up~0); 9860#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9859#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9858#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9857#L14 assume !(0 == main_~i~0); 9856#L14-2 assume !(main_~i~0 == main_~range~0); 9855#L17-1 assume !(1 == main_~up~0); 9854#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9853#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9852#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9851#L14 assume !(0 == main_~i~0); 9850#L14-2 assume !(main_~i~0 == main_~range~0); 9849#L17-1 assume !(1 == main_~up~0); 9848#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9847#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9846#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9845#L14 assume !(0 == main_~i~0); 9844#L14-2 assume !(main_~i~0 == main_~range~0); 9843#L17-1 assume !(1 == main_~up~0); 9842#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9841#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9840#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9839#L14 assume !(0 == main_~i~0); 9838#L14-2 assume !(main_~i~0 == main_~range~0); 9837#L17-1 assume !(1 == main_~up~0); 9836#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9835#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9828#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9834#L14 assume !(0 == main_~i~0); 9833#L14-2 assume !(main_~i~0 == main_~range~0); 9832#L17-1 assume !(1 == main_~up~0); 9831#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9827#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9829#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9923#L14 assume 0 == main_~i~0;main_~up~0 := 1; 9924#L14-2 [2020-10-20 06:36:01,867 INFO L796 eck$LassoCheckResult]: Loop: 9924#L14-2 assume !(main_~i~0 == main_~range~0); 9919#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9920#L20-1 assume !(0 == main_~up~0); 9936#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 9935#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9934#L14 assume !(0 == main_~i~0); 9933#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 9932#L17-1 assume !(1 == main_~up~0); 9931#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9929#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 9926#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9927#L14 assume 0 == main_~i~0;main_~up~0 := 1; 9924#L14-2 [2020-10-20 06:36:01,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:01,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1712380019, now seen corresponding path program 16 times [2020-10-20 06:36:01,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:01,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865398158] [2020-10-20 06:36:01,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:02,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865398158] [2020-10-20 06:36:02,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321345324] [2020-10-20 06:36:02,066 INFO L93 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:02,103 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 06:36:02,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:02,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-20 06:36:02,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:02,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:02,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2020-10-20 06:36:02,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911467592] [2020-10-20 06:36:02,161 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:02,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:02,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 17 times [2020-10-20 06:36:02,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:02,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144351246] [2020-10-20 06:36:02,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:02,165 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:02,167 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:02,168 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:02,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:02,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-20 06:36:02,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2020-10-20 06:36:02,226 INFO L87 Difference]: Start difference. First operand 247 states and 255 transitions. cyclomatic complexity: 12 Second operand 20 states. [2020-10-20 06:36:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:02,439 INFO L93 Difference]: Finished difference Result 275 states and 283 transitions. [2020-10-20 06:36:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-20 06:36:02,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 283 transitions. [2020-10-20 06:36:02,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:36:02,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 273 states and 281 transitions. [2020-10-20 06:36:02,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2020-10-20 06:36:02,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2020-10-20 06:36:02,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 273 states and 281 transitions. [2020-10-20 06:36:02,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:02,444 INFO L691 BuchiCegarLoop]: Abstraction has 273 states and 281 transitions. [2020-10-20 06:36:02,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states and 281 transitions. [2020-10-20 06:36:02,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 259. [2020-10-20 06:36:02,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2020-10-20 06:36:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 267 transitions. [2020-10-20 06:36:02,449 INFO L714 BuchiCegarLoop]: Abstraction has 259 states and 267 transitions. [2020-10-20 06:36:02,449 INFO L594 BuchiCegarLoop]: Abstraction has 259 states and 267 transitions. [2020-10-20 06:36:02,449 INFO L427 BuchiCegarLoop]: ======== Iteration 27============ [2020-10-20 06:36:02,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 259 states and 267 transitions. [2020-10-20 06:36:02,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:36:02,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:02,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:02,452 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [18, 17, 17, 17, 17, 17, 1, 1] [2020-10-20 06:36:02,452 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:36:02,453 INFO L794 eck$LassoCheckResult]: Stem: 10635#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 10636#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10673#L14 assume !(0 == main_~i~0); 10671#L14-2 assume !(main_~i~0 == main_~range~0); 10670#L17-1 assume !(1 == main_~up~0); 10669#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10667#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10653#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10654#L14 assume !(0 == main_~i~0); 10646#L14-2 assume !(main_~i~0 == main_~range~0); 10647#L17-1 assume !(1 == main_~up~0); 10771#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10770#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10769#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10768#L14 assume !(0 == main_~i~0); 10767#L14-2 assume !(main_~i~0 == main_~range~0); 10766#L17-1 assume !(1 == main_~up~0); 10765#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10764#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10763#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10762#L14 assume !(0 == main_~i~0); 10761#L14-2 assume !(main_~i~0 == main_~range~0); 10760#L17-1 assume !(1 == main_~up~0); 10759#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10758#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10757#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10756#L14 assume !(0 == main_~i~0); 10755#L14-2 assume !(main_~i~0 == main_~range~0); 10754#L17-1 assume !(1 == main_~up~0); 10753#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10752#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10751#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10750#L14 assume !(0 == main_~i~0); 10749#L14-2 assume !(main_~i~0 == main_~range~0); 10748#L17-1 assume !(1 == main_~up~0); 10747#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10746#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10745#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10744#L14 assume !(0 == main_~i~0); 10743#L14-2 assume !(main_~i~0 == main_~range~0); 10742#L17-1 assume !(1 == main_~up~0); 10741#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10740#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10739#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10738#L14 assume !(0 == main_~i~0); 10737#L14-2 assume !(main_~i~0 == main_~range~0); 10736#L17-1 assume !(1 == main_~up~0); 10735#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10734#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10733#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10732#L14 assume !(0 == main_~i~0); 10731#L14-2 assume !(main_~i~0 == main_~range~0); 10730#L17-1 assume !(1 == main_~up~0); 10729#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10728#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10727#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10726#L14 assume !(0 == main_~i~0); 10725#L14-2 assume !(main_~i~0 == main_~range~0); 10724#L17-1 assume !(1 == main_~up~0); 10723#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10722#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10721#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10720#L14 assume !(0 == main_~i~0); 10719#L14-2 assume !(main_~i~0 == main_~range~0); 10718#L17-1 assume !(1 == main_~up~0); 10717#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10716#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10715#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10714#L14 assume !(0 == main_~i~0); 10713#L14-2 assume !(main_~i~0 == main_~range~0); 10712#L17-1 assume !(1 == main_~up~0); 10711#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10710#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10709#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10708#L14 assume !(0 == main_~i~0); 10707#L14-2 assume !(main_~i~0 == main_~range~0); 10706#L17-1 assume !(1 == main_~up~0); 10705#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10704#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10703#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10702#L14 assume !(0 == main_~i~0); 10701#L14-2 assume !(main_~i~0 == main_~range~0); 10700#L17-1 assume !(1 == main_~up~0); 10699#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10698#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10697#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10696#L14 assume !(0 == main_~i~0); 10695#L14-2 assume !(main_~i~0 == main_~range~0); 10694#L17-1 assume !(1 == main_~up~0); 10693#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10692#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10691#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10690#L14 assume !(0 == main_~i~0); 10689#L14-2 assume !(main_~i~0 == main_~range~0); 10688#L17-1 assume !(1 == main_~up~0); 10687#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10686#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10679#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10685#L14 assume !(0 == main_~i~0); 10684#L14-2 assume !(main_~i~0 == main_~range~0); 10683#L17-1 assume !(1 == main_~up~0); 10682#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10678#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10680#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10780#L14 assume 0 == main_~i~0;main_~up~0 := 1; 10781#L14-2 [2020-10-20 06:36:02,453 INFO L796 eck$LassoCheckResult]: Loop: 10781#L14-2 assume !(main_~i~0 == main_~range~0); 10776#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10777#L20-1 assume !(0 == main_~up~0); 10793#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 10792#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10791#L14 assume !(0 == main_~i~0); 10790#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 10789#L17-1 assume !(1 == main_~up~0); 10788#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10786#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 10783#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10784#L14 assume 0 == main_~i~0;main_~up~0 := 1; 10781#L14-2 [2020-10-20 06:36:02,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:02,453 INFO L82 PathProgramCache]: Analyzing trace with hash 782815236, now seen corresponding path program 17 times [2020-10-20 06:36:02,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:02,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6085457] [2020-10-20 06:36:02,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:02,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6085457] [2020-10-20 06:36:02,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86870822] [2020-10-20 06:36:02,882 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:02,964 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2020-10-20 06:36:02,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:02,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-20 06:36:02,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:03,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:03,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 32 [2020-10-20 06:36:03,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804761095] [2020-10-20 06:36:03,306 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:03,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:03,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 18 times [2020-10-20 06:36:03,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:03,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793257942] [2020-10-20 06:36:03,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:03,310 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:03,314 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:03,316 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:03,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:03,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-10-20 06:36:03,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2020-10-20 06:36:03,361 INFO L87 Difference]: Start difference. First operand 259 states and 267 transitions. cyclomatic complexity: 12 Second operand 34 states. [2020-10-20 06:36:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:04,333 INFO L93 Difference]: Finished difference Result 287 states and 295 transitions. [2020-10-20 06:36:04,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-10-20 06:36:04,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 287 states and 295 transitions. [2020-10-20 06:36:04,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:36:04,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 287 states to 285 states and 293 transitions. [2020-10-20 06:36:04,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2020-10-20 06:36:04,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2020-10-20 06:36:04,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 293 transitions. [2020-10-20 06:36:04,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:04,341 INFO L691 BuchiCegarLoop]: Abstraction has 285 states and 293 transitions. [2020-10-20 06:36:04,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 293 transitions. [2020-10-20 06:36:04,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 271. [2020-10-20 06:36:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2020-10-20 06:36:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 279 transitions. [2020-10-20 06:36:04,348 INFO L714 BuchiCegarLoop]: Abstraction has 271 states and 279 transitions. [2020-10-20 06:36:04,348 INFO L594 BuchiCegarLoop]: Abstraction has 271 states and 279 transitions. [2020-10-20 06:36:04,348 INFO L427 BuchiCegarLoop]: ======== Iteration 28============ [2020-10-20 06:36:04,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 279 transitions. [2020-10-20 06:36:04,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:36:04,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:04,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:04,351 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [19, 18, 18, 18, 18, 18, 1, 1] [2020-10-20 06:36:04,352 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:36:04,352 INFO L794 eck$LassoCheckResult]: Stem: 11600#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 11601#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11635#L14 assume !(0 == main_~i~0); 11633#L14-2 assume !(main_~i~0 == main_~range~0); 11632#L17-1 assume !(1 == main_~up~0); 11631#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11629#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11615#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11616#L14 assume !(0 == main_~i~0); 11608#L14-2 assume !(main_~i~0 == main_~range~0); 11609#L17-1 assume !(1 == main_~up~0); 11738#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11737#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11736#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11735#L14 assume !(0 == main_~i~0); 11734#L14-2 assume !(main_~i~0 == main_~range~0); 11733#L17-1 assume !(1 == main_~up~0); 11732#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11731#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11730#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11729#L14 assume !(0 == main_~i~0); 11728#L14-2 assume !(main_~i~0 == main_~range~0); 11727#L17-1 assume !(1 == main_~up~0); 11726#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11725#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11724#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11723#L14 assume !(0 == main_~i~0); 11722#L14-2 assume !(main_~i~0 == main_~range~0); 11721#L17-1 assume !(1 == main_~up~0); 11720#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11719#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11718#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11717#L14 assume !(0 == main_~i~0); 11716#L14-2 assume !(main_~i~0 == main_~range~0); 11715#L17-1 assume !(1 == main_~up~0); 11714#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11713#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11712#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11711#L14 assume !(0 == main_~i~0); 11710#L14-2 assume !(main_~i~0 == main_~range~0); 11709#L17-1 assume !(1 == main_~up~0); 11708#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11707#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11706#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11705#L14 assume !(0 == main_~i~0); 11704#L14-2 assume !(main_~i~0 == main_~range~0); 11703#L17-1 assume !(1 == main_~up~0); 11702#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11701#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11700#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11699#L14 assume !(0 == main_~i~0); 11698#L14-2 assume !(main_~i~0 == main_~range~0); 11697#L17-1 assume !(1 == main_~up~0); 11696#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11695#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11694#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11693#L14 assume !(0 == main_~i~0); 11692#L14-2 assume !(main_~i~0 == main_~range~0); 11691#L17-1 assume !(1 == main_~up~0); 11690#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11689#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11688#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11687#L14 assume !(0 == main_~i~0); 11686#L14-2 assume !(main_~i~0 == main_~range~0); 11685#L17-1 assume !(1 == main_~up~0); 11684#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11683#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11682#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11681#L14 assume !(0 == main_~i~0); 11680#L14-2 assume !(main_~i~0 == main_~range~0); 11679#L17-1 assume !(1 == main_~up~0); 11678#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11677#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11676#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11675#L14 assume !(0 == main_~i~0); 11674#L14-2 assume !(main_~i~0 == main_~range~0); 11673#L17-1 assume !(1 == main_~up~0); 11672#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11671#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11670#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11669#L14 assume !(0 == main_~i~0); 11668#L14-2 assume !(main_~i~0 == main_~range~0); 11667#L17-1 assume !(1 == main_~up~0); 11666#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11665#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11664#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11663#L14 assume !(0 == main_~i~0); 11662#L14-2 assume !(main_~i~0 == main_~range~0); 11661#L17-1 assume !(1 == main_~up~0); 11660#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11659#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11658#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11657#L14 assume !(0 == main_~i~0); 11656#L14-2 assume !(main_~i~0 == main_~range~0); 11655#L17-1 assume !(1 == main_~up~0); 11654#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11653#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11652#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11651#L14 assume !(0 == main_~i~0); 11650#L14-2 assume !(main_~i~0 == main_~range~0); 11649#L17-1 assume !(1 == main_~up~0); 11648#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11647#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11640#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11646#L14 assume !(0 == main_~i~0); 11645#L14-2 assume !(main_~i~0 == main_~range~0); 11644#L17-1 assume !(1 == main_~up~0); 11643#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11639#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11641#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11747#L14 assume 0 == main_~i~0;main_~up~0 := 1; 11748#L14-2 [2020-10-20 06:36:04,352 INFO L796 eck$LassoCheckResult]: Loop: 11748#L14-2 assume !(main_~i~0 == main_~range~0); 11743#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11744#L20-1 assume !(0 == main_~up~0); 11760#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 11759#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11758#L14 assume !(0 == main_~i~0); 11757#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 11756#L17-1 assume !(1 == main_~up~0); 11755#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11753#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 11750#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11751#L14 assume 0 == main_~i~0;main_~up~0 := 1; 11748#L14-2 [2020-10-20 06:36:04,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:04,354 INFO L82 PathProgramCache]: Analyzing trace with hash 59971285, now seen corresponding path program 18 times [2020-10-20 06:36:04,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:04,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029813113] [2020-10-20 06:36:04,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:04,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029813113] [2020-10-20 06:36:04,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770841283] [2020-10-20 06:36:04,644 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:04,707 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2020-10-20 06:36:04,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:04,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-20 06:36:04,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:04,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:04,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 24 [2020-10-20 06:36:04,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219164344] [2020-10-20 06:36:04,856 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:04,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:04,857 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 19 times [2020-10-20 06:36:04,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:04,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783904911] [2020-10-20 06:36:04,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:04,860 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:04,862 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:04,863 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:04,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:04,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-20 06:36:04,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=444, Unknown=0, NotChecked=0, Total=650 [2020-10-20 06:36:04,911 INFO L87 Difference]: Start difference. First operand 271 states and 279 transitions. cyclomatic complexity: 12 Second operand 26 states. [2020-10-20 06:36:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:05,391 INFO L93 Difference]: Finished difference Result 299 states and 307 transitions. [2020-10-20 06:36:05,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-10-20 06:36:05,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 299 states and 307 transitions. [2020-10-20 06:36:05,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:36:05,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 299 states to 297 states and 305 transitions. [2020-10-20 06:36:05,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2020-10-20 06:36:05,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2020-10-20 06:36:05,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 297 states and 305 transitions. [2020-10-20 06:36:05,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:05,396 INFO L691 BuchiCegarLoop]: Abstraction has 297 states and 305 transitions. [2020-10-20 06:36:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states and 305 transitions. [2020-10-20 06:36:05,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 283. [2020-10-20 06:36:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2020-10-20 06:36:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 291 transitions. [2020-10-20 06:36:05,401 INFO L714 BuchiCegarLoop]: Abstraction has 283 states and 291 transitions. [2020-10-20 06:36:05,401 INFO L594 BuchiCegarLoop]: Abstraction has 283 states and 291 transitions. [2020-10-20 06:36:05,402 INFO L427 BuchiCegarLoop]: ======== Iteration 29============ [2020-10-20 06:36:05,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 283 states and 291 transitions. [2020-10-20 06:36:05,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:36:05,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:05,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:05,406 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [20, 19, 19, 19, 19, 19, 1, 1] [2020-10-20 06:36:05,406 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:36:05,407 INFO L794 eck$LassoCheckResult]: Stem: 12563#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 12564#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12598#L14 assume !(0 == main_~i~0); 12596#L14-2 assume !(main_~i~0 == main_~range~0); 12595#L17-1 assume !(1 == main_~up~0); 12594#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12592#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12578#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12579#L14 assume !(0 == main_~i~0); 12571#L14-2 assume !(main_~i~0 == main_~range~0); 12572#L17-1 assume !(1 == main_~up~0); 12707#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12706#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12705#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12704#L14 assume !(0 == main_~i~0); 12703#L14-2 assume !(main_~i~0 == main_~range~0); 12702#L17-1 assume !(1 == main_~up~0); 12701#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12700#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12699#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12698#L14 assume !(0 == main_~i~0); 12697#L14-2 assume !(main_~i~0 == main_~range~0); 12696#L17-1 assume !(1 == main_~up~0); 12695#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12694#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12693#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12692#L14 assume !(0 == main_~i~0); 12691#L14-2 assume !(main_~i~0 == main_~range~0); 12690#L17-1 assume !(1 == main_~up~0); 12689#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12688#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12687#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12686#L14 assume !(0 == main_~i~0); 12685#L14-2 assume !(main_~i~0 == main_~range~0); 12684#L17-1 assume !(1 == main_~up~0); 12683#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12682#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12681#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12680#L14 assume !(0 == main_~i~0); 12679#L14-2 assume !(main_~i~0 == main_~range~0); 12678#L17-1 assume !(1 == main_~up~0); 12677#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12676#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12675#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12674#L14 assume !(0 == main_~i~0); 12673#L14-2 assume !(main_~i~0 == main_~range~0); 12672#L17-1 assume !(1 == main_~up~0); 12671#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12670#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12669#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12668#L14 assume !(0 == main_~i~0); 12667#L14-2 assume !(main_~i~0 == main_~range~0); 12666#L17-1 assume !(1 == main_~up~0); 12665#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12664#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12663#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12662#L14 assume !(0 == main_~i~0); 12661#L14-2 assume !(main_~i~0 == main_~range~0); 12660#L17-1 assume !(1 == main_~up~0); 12659#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12658#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12657#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12656#L14 assume !(0 == main_~i~0); 12655#L14-2 assume !(main_~i~0 == main_~range~0); 12654#L17-1 assume !(1 == main_~up~0); 12653#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12652#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12651#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12650#L14 assume !(0 == main_~i~0); 12649#L14-2 assume !(main_~i~0 == main_~range~0); 12648#L17-1 assume !(1 == main_~up~0); 12647#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12646#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12645#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12644#L14 assume !(0 == main_~i~0); 12643#L14-2 assume !(main_~i~0 == main_~range~0); 12642#L17-1 assume !(1 == main_~up~0); 12641#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12640#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12639#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12638#L14 assume !(0 == main_~i~0); 12637#L14-2 assume !(main_~i~0 == main_~range~0); 12636#L17-1 assume !(1 == main_~up~0); 12635#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12634#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12633#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12632#L14 assume !(0 == main_~i~0); 12631#L14-2 assume !(main_~i~0 == main_~range~0); 12630#L17-1 assume !(1 == main_~up~0); 12629#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12628#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12627#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12626#L14 assume !(0 == main_~i~0); 12625#L14-2 assume !(main_~i~0 == main_~range~0); 12624#L17-1 assume !(1 == main_~up~0); 12623#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12622#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12621#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12620#L14 assume !(0 == main_~i~0); 12619#L14-2 assume !(main_~i~0 == main_~range~0); 12618#L17-1 assume !(1 == main_~up~0); 12617#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12616#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12615#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12614#L14 assume !(0 == main_~i~0); 12613#L14-2 assume !(main_~i~0 == main_~range~0); 12612#L17-1 assume !(1 == main_~up~0); 12611#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12610#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12603#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12609#L14 assume !(0 == main_~i~0); 12608#L14-2 assume !(main_~i~0 == main_~range~0); 12607#L17-1 assume !(1 == main_~up~0); 12606#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12602#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12604#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12716#L14 assume 0 == main_~i~0;main_~up~0 := 1; 12717#L14-2 [2020-10-20 06:36:05,407 INFO L796 eck$LassoCheckResult]: Loop: 12717#L14-2 assume !(main_~i~0 == main_~range~0); 12712#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 12713#L20-1 assume !(0 == main_~up~0); 12729#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 12728#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12727#L14 assume !(0 == main_~i~0); 12726#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 12725#L17-1 assume !(1 == main_~up~0); 12724#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12722#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 12719#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12720#L14 assume 0 == main_~i~0;main_~up~0 := 1; 12717#L14-2 [2020-10-20 06:36:05,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:05,407 INFO L82 PathProgramCache]: Analyzing trace with hash 623328486, now seen corresponding path program 19 times [2020-10-20 06:36:05,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:05,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816067135] [2020-10-20 06:36:05,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:05,429 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:05,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:05,466 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:05,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:05,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 20 times [2020-10-20 06:36:05,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:05,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845033127] [2020-10-20 06:36:05,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:05,476 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:05,478 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:05,480 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:05,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:05,480 INFO L82 PathProgramCache]: Analyzing trace with hash 737282760, now seen corresponding path program 1 times [2020-10-20 06:36:05,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:05,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381461378] [2020-10-20 06:36:05,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:05,500 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:05,517 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:05,524 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:06,496 WARN L193 SmtUtils]: Spent 916.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 130 [2020-10-20 06:36:06,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:36:06 BoogieIcfgContainer [2020-10-20 06:36:06,553 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:36:06,553 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:36:06,554 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:36:06,554 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:36:06,555 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:35:46" (3/4) ... [2020-10-20 06:36:06,558 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 06:36:06,625 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:36:06,626 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:36:06,627 INFO L168 Benchmark]: Toolchain (without parser) took 20788.65 ms. Allocated memory was 41.9 MB in the beginning and 134.7 MB in the end (delta: 92.8 MB). Free memory was 22.7 MB in the beginning and 58.0 MB in the end (delta: -35.3 MB). Peak memory consumption was 57.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:06,628 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 32.0 MB. Free memory was 9.7 MB in the beginning and 9.6 MB in the end (delta: 47.7 kB). Peak memory consumption was 47.7 kB. Max. memory is 14.3 GB. [2020-10-20 06:36:06,628 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.54 ms. Allocated memory was 41.9 MB in the beginning and 42.5 MB in the end (delta: 524.3 kB). Free memory was 21.8 MB in the beginning and 24.8 MB in the end (delta: -3.0 MB). Peak memory consumption was 12.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:06,629 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.84 ms. Allocated memory is still 42.5 MB. Free memory was 24.8 MB in the beginning and 23.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:06,629 INFO L168 Benchmark]: Boogie Preprocessor took 20.55 ms. Allocated memory is still 42.5 MB. Free memory was 23.3 MB in the beginning and 22.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:06,630 INFO L168 Benchmark]: RCFGBuilder took 233.28 ms. Allocated memory is still 42.5 MB. Free memory was 22.0 MB in the beginning and 12.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:06,631 INFO L168 Benchmark]: BuchiAutomizer took 20159.81 ms. Allocated memory was 42.5 MB in the beginning and 134.7 MB in the end (delta: 92.3 MB). Free memory was 12.2 MB in the beginning and 64.1 MB in the end (delta: -51.8 MB). Peak memory consumption was 92.0 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:06,631 INFO L168 Benchmark]: Witness Printer took 72.37 ms. Allocated memory is still 134.7 MB. Free memory was 64.1 MB in the beginning and 58.0 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:06,634 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 32.0 MB. Free memory was 9.7 MB in the beginning and 9.6 MB in the end (delta: 47.7 kB). Peak memory consumption was 47.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 263.54 ms. Allocated memory was 41.9 MB in the beginning and 42.5 MB in the end (delta: 524.3 kB). Free memory was 21.8 MB in the beginning and 24.8 MB in the end (delta: -3.0 MB). Peak memory consumption was 12.8 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 29.84 ms. Allocated memory is still 42.5 MB. Free memory was 24.8 MB in the beginning and 23.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 20.55 ms. Allocated memory is still 42.5 MB. Free memory was 23.3 MB in the beginning and 22.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 14.3 GB. * RCFGBuilder took 233.28 ms. Allocated memory is still 42.5 MB. Free memory was 22.0 MB in the beginning and 12.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 20159.81 ms. Allocated memory was 42.5 MB in the beginning and 134.7 MB in the end (delta: 92.3 MB). Free memory was 12.2 MB in the beginning and 64.1 MB in the end (delta: -51.8 MB). Peak memory consumption was 92.0 MB. Max. memory is 14.3 GB. * Witness Printer took 72.37 ms. Allocated memory is still 134.7 MB. Free memory was 64.1 MB in the beginning and 58.0 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 30 terminating modules (26 trivial, 3 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -1 * i and consists of 4 locations. One deterministic module has affine ranking function range + -1 * i and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + range and consists of 4 locations. 26 modules have a trivial ranking function, the largest among these consists of 34 locations. The remainder module has 283 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.0s and 29 iterations. TraceHistogramMax:20. Analysis of lassos took 13.5s. Construction of modules took 2.4s. Büchi inclusion checks took 3.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 26. Automata minimization 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 390 StatesRemovedByMinimization, 27 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 283 states and ocurred in iteration 28. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 278 SDtfs, 1198 SDslu, 642 SDs, 0 SdLazy, 3124 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time LassoAnalysisResults: nont1 unkn0 SFLI5 SFLT2 conc2 concLT1 SILN17 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital29 mio100 ax140 hnf100 lsp58 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq177 hnf97 smp69 dnf169 smp85 tf105 neg91 sie118 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 6 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 17]: 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, range=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@be06f1b=0, \result=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 13]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 Loop: [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...