./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/toy.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash a2cf465b3c46ffeaae0c4558b2b00688c0a746a8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-f470102 [2019-11-28 21:18:23,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:18:23,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:18:23,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:18:23,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:18:23,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:18:23,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:18:23,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:18:23,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:18:23,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:18:23,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:18:23,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:18:23,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:18:23,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:18:23,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:18:23,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:18:23,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:18:23,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:18:23,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:18:23,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:18:23,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:18:23,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:18:23,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:18:23,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:18:23,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:18:23,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:18:23,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:18:23,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:18:23,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:18:23,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:18:23,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:18:23,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:18:23,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:18:23,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:18:23,699 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:18:23,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:18:23,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:18:23,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:18:23,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:18:23,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:18:23,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:18:23,704 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:18:23,722 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:18:23,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:18:23,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:18:23,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:18:23,725 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:18:23,726 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:18:23,726 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:18:23,726 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:18:23,727 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:18:23,727 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:18:23,728 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:18:23,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:18:23,729 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:18:23,730 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:18:23,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:18:23,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:18:23,731 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:18:23,731 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:18:23,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:18:23,732 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:18:23,732 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:18:23,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:18:23,733 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:18:23,733 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:18:23,733 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:18:23,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:18:23,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:18:23,734 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:18:23,734 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:18:23,735 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:18:23,735 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:18:23,736 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:18:23,738 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:18:23,738 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2cf465b3c46ffeaae0c4558b2b00688c0a746a8 [2019-11-28 21:18:24,085 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:18:24,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:18:24,109 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:18:24,111 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:18:24,112 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:18:24,113 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy.cil.c [2019-11-28 21:18:24,199 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6115fbc/c786a400d20a4318aa9f78f5d89dbbbe/FLAGe57b8ceb8 [2019-11-28 21:18:24,741 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:18:24,742 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2019-11-28 21:18:24,764 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6115fbc/c786a400d20a4318aa9f78f5d89dbbbe/FLAGe57b8ceb8 [2019-11-28 21:18:25,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6115fbc/c786a400d20a4318aa9f78f5d89dbbbe [2019-11-28 21:18:25,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:18:25,050 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:18:25,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:18:25,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:18:25,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:18:25,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:18:25" (1/1) ... [2019-11-28 21:18:25,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ec0670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:18:25, skipping insertion in model container [2019-11-28 21:18:25,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:18:25" (1/1) ... [2019-11-28 21:18:25,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:18:25,103 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:18:25,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:18:25,368 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:18:25,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:18:25,518 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:18:25,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:18:25 WrapperNode [2019-11-28 21:18:25,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:18:25,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:18:25,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:18:25,522 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:18:25,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:18:25" (1/1) ... [2019-11-28 21:18:25,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:18:25" (1/1) ... [2019-11-28 21:18:25,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:18:25,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:18:25,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:18:25,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:18:25,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:18:25" (1/1) ... [2019-11-28 21:18:25,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:18:25" (1/1) ... [2019-11-28 21:18:25,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:18:25" (1/1) ... [2019-11-28 21:18:25,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:18:25" (1/1) ... [2019-11-28 21:18:25,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:18:25" (1/1) ... [2019-11-28 21:18:25,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:18:25" (1/1) ... [2019-11-28 21:18:25,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:18:25" (1/1) ... [2019-11-28 21:18:25,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:18:25,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:18:25,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:18:25,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:18:25,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:18:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:25,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:18:25,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:18:26,362 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:18:26,363 INFO L287 CfgBuilder]: Removed 26 assume(true) statements. [2019-11-28 21:18:26,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:18:26 BoogieIcfgContainer [2019-11-28 21:18:26,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:18:26,368 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:18:26,368 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:18:26,372 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:18:26,373 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:18:26,374 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:18:25" (1/3) ... [2019-11-28 21:18:26,375 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d8fb6df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:18:26, skipping insertion in model container [2019-11-28 21:18:26,376 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:18:26,376 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:18:25" (2/3) ... [2019-11-28 21:18:26,377 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d8fb6df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:18:26, skipping insertion in model container [2019-11-28 21:18:26,378 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:18:26,378 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:18:26" (3/3) ... [2019-11-28 21:18:26,380 INFO L371 chiAutomizerObserver]: Analyzing ICFG toy.cil.c [2019-11-28 21:18:26,439 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:18:26,439 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:18:26,439 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:18:26,441 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:18:26,442 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:18:26,442 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:18:26,442 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:18:26,442 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:18:26,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2019-11-28 21:18:26,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-11-28 21:18:26,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:18:26,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:18:26,514 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:26,514 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:26,514 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:18:26,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2019-11-28 21:18:26,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-11-28 21:18:26,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:18:26,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:18:26,525 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:26,525 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:26,532 INFO L794 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRYtrue ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 14#L-1true havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 4#L398true assume !(1 == ~c_req_up~0); 8#L398-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 7#L409-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 31#L414-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 52#L419-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 74#L424-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 100#L429-1true assume !(0 == ~e_f~0); 122#L434-1true assume !(0 == ~e_g~0); 28#L439-1true assume !(0 == ~e_e~0); 48#L444-1true assume !(0 == ~e_c~0); 71#L449-1true assume !(0 == ~e_wl~0); 94#L454-1true assume !(1 == ~wl_pc~0); 47#L466true assume !(2 == ~wl_pc~0); 120#L467true assume !(1 == ~c1_pc~0); 45#L477true assume !(1 == ~c2_pc~0); 19#L486true assume !(1 == ~wb_pc~0); 111#L495true assume !(1 == ~e_c~0); 68#L504-1true assume !(1 == ~e_e~0); 92#L509-1true assume !(1 == ~e_f~0); 117#L514-1true assume !(1 == ~e_g~0); 20#L519-1true assume !(1 == ~e_c~0); 42#L524-1true assume !(1 == ~e_wl~0); 79#L666-1true [2019-11-28 21:18:26,533 INFO L796 eck$LassoCheckResult]: Loop: 79#L666-1true assume !false; 114#L536true start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 107#L371true assume false; 6#L387true start_simulation_~kernel_st~0 := 2; 86#L542true assume !(1 == ~c_req_up~0); 93#L542-2true start_simulation_~kernel_st~0 := 3; 58#L554true assume 0 == ~e_f~0;~e_f~0 := 1; 44#L554-2true assume 0 == ~e_g~0;~e_g~0 := 1; 67#L559-1true assume !(0 == ~e_e~0); 88#L564-1true assume 0 == ~e_c~0;~e_c~0 := 1; 115#L569-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 18#L574-1true assume 1 == ~wl_pc~0; 112#L580true assume 1 == ~e_wl~0;~wl_st~0 := 0; 56#L587true assume !(1 == ~c1_pc~0); 103#L597true assume !(1 == ~c2_pc~0); 61#L606true assume !(1 == ~wb_pc~0); 33#L615true assume 1 == ~e_c~0;~r_st~0 := 0; 127#L624-1true assume 1 == ~e_e~0;~e_e~0 := 2; 16#L629-1true assume 1 == ~e_f~0;~e_f~0 := 2; 38#L634-1true assume !(1 == ~e_g~0); 62#L639-1true assume 1 == ~e_c~0;~e_c~0 := 2; 81#L644-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 110#L649-1true assume 0 == ~wl_st~0; 79#L666-1true [2019-11-28 21:18:26,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:26,540 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2019-11-28 21:18:26,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:26,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798818215] [2019-11-28 21:18:26,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:26,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798818215] [2019-11-28 21:18:26,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:26,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:18:26,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12787350] [2019-11-28 21:18:26,737 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:18:26,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:26,737 INFO L82 PathProgramCache]: Analyzing trace with hash 359392569, now seen corresponding path program 1 times [2019-11-28 21:18:26,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:26,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837699572] [2019-11-28 21:18:26,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:26,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837699572] [2019-11-28 21:18:26,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:26,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 21:18:26,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803299196] [2019-11-28 21:18:26,752 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:18:26,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:18:26,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 21:18:26,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 21:18:26,772 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 2 states. [2019-11-28 21:18:26,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:18:26,795 INFO L93 Difference]: Finished difference Result 125 states and 219 transitions. [2019-11-28 21:18:26,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 21:18:26,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 219 transitions. [2019-11-28 21:18:26,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 21:18:26,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 120 states and 214 transitions. [2019-11-28 21:18:26,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2019-11-28 21:18:26,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2019-11-28 21:18:26,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 214 transitions. [2019-11-28 21:18:26,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:18:26,824 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 214 transitions. [2019-11-28 21:18:26,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 214 transitions. [2019-11-28 21:18:26,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-28 21:18:26,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 21:18:26,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 214 transitions. [2019-11-28 21:18:26,862 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 214 transitions. [2019-11-28 21:18:26,862 INFO L591 BuchiCegarLoop]: Abstraction has 120 states and 214 transitions. [2019-11-28 21:18:26,862 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:18:26,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 214 transitions. [2019-11-28 21:18:26,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 21:18:26,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:18:26,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:18:26,867 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:26,867 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:26,867 INFO L794 eck$LassoCheckResult]: Stem: 368#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 281#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 259#L398 assume !(1 == ~c_req_up~0); 261#L398-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 267#L409-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 268#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 314#L419-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 346#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 363#L429-1 assume !(0 == ~e_f~0); 374#L434-1 assume !(0 == ~e_g~0); 309#L439-1 assume !(0 == ~e_e~0); 310#L444-1 assume !(0 == ~e_c~0); 342#L449-1 assume !(0 == ~e_wl~0); 361#L454-1 assume !(1 == ~wl_pc~0); 339#L466 assume !(2 == ~wl_pc~0); 340#L467 assume !(1 == ~c1_pc~0); 335#L477 assume !(1 == ~c2_pc~0); 291#L486 assume !(1 == ~wb_pc~0); 292#L495 assume !(1 == ~e_c~0); 357#L504-1 assume !(1 == ~e_e~0); 358#L509-1 assume !(1 == ~e_f~0); 371#L514-1 assume !(1 == ~e_g~0); 294#L519-1 assume !(1 == ~e_c~0); 295#L524-1 assume !(1 == ~e_wl~0); 331#L666-1 [2019-11-28 21:18:26,868 INFO L796 eck$LassoCheckResult]: Loop: 331#L666-1 assume !false; 364#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 270#L371 assume !false; 370#L289 assume !(0 == ~wl_st~0); 304#L293 assume !(0 == ~c1_st~0); 273#L296 assume !(0 == ~c2_st~0); 275#L299 assume !(0 == ~wb_st~0); 287#L302 assume !(0 == ~r_st~0); 265#L387 start_simulation_~kernel_st~0 := 2; 266#L542 assume !(1 == ~c_req_up~0); 338#L542-2 start_simulation_~kernel_st~0 := 3; 350#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 333#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 334#L559-1 assume !(0 == ~e_e~0); 356#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 369#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 288#L574-1 assume 1 == ~wl_pc~0; 289#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 272#L587 assume !(1 == ~c1_pc~0); 349#L597 assume !(1 == ~c2_pc~0); 313#L606 assume !(1 == ~wb_pc~0); 316#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 317#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 285#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 286#L634-1 assume !(1 == ~e_g~0); 326#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 354#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 365#L649-1 assume 0 == ~wl_st~0; 331#L666-1 [2019-11-28 21:18:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:26,868 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2019-11-28 21:18:26,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:26,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266216318] [2019-11-28 21:18:26,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:26,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266216318] [2019-11-28 21:18:26,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:26,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:18:26,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975039347] [2019-11-28 21:18:26,913 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:18:26,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:26,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1806372813, now seen corresponding path program 1 times [2019-11-28 21:18:26,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:26,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454165783] [2019-11-28 21:18:26,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:26,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454165783] [2019-11-28 21:18:26,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:26,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:18:26,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756818760] [2019-11-28 21:18:26,964 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:18:26,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:18:26,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:18:26,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:18:26,965 INFO L87 Difference]: Start difference. First operand 120 states and 214 transitions. cyclomatic complexity: 95 Second operand 3 states. [2019-11-28 21:18:27,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:18:27,009 INFO L93 Difference]: Finished difference Result 120 states and 213 transitions. [2019-11-28 21:18:27,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:18:27,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 213 transitions. [2019-11-28 21:18:27,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 21:18:27,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 213 transitions. [2019-11-28 21:18:27,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2019-11-28 21:18:27,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2019-11-28 21:18:27,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 213 transitions. [2019-11-28 21:18:27,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:18:27,023 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 213 transitions. [2019-11-28 21:18:27,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 213 transitions. [2019-11-28 21:18:27,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-28 21:18:27,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 21:18:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 213 transitions. [2019-11-28 21:18:27,036 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 213 transitions. [2019-11-28 21:18:27,036 INFO L591 BuchiCegarLoop]: Abstraction has 120 states and 213 transitions. [2019-11-28 21:18:27,037 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:18:27,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 213 transitions. [2019-11-28 21:18:27,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 21:18:27,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:18:27,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:18:27,040 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:27,041 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:27,041 INFO L794 eck$LassoCheckResult]: Stem: 615#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 528#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 506#L398 assume !(1 == ~c_req_up~0); 508#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 514#L409-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 515#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 561#L419-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 593#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 610#L429-1 assume !(0 == ~e_f~0); 621#L434-1 assume !(0 == ~e_g~0); 556#L439-1 assume !(0 == ~e_e~0); 557#L444-1 assume !(0 == ~e_c~0); 589#L449-1 assume !(0 == ~e_wl~0); 608#L454-1 assume !(1 == ~wl_pc~0); 586#L466 assume !(2 == ~wl_pc~0); 587#L467 assume !(1 == ~c1_pc~0); 582#L477 assume !(1 == ~c2_pc~0); 538#L486 assume !(1 == ~wb_pc~0); 539#L495 assume !(1 == ~e_c~0); 604#L504-1 assume !(1 == ~e_e~0); 605#L509-1 assume !(1 == ~e_f~0); 618#L514-1 assume !(1 == ~e_g~0); 541#L519-1 assume !(1 == ~e_c~0); 542#L524-1 assume !(1 == ~e_wl~0); 578#L666-1 [2019-11-28 21:18:27,042 INFO L796 eck$LassoCheckResult]: Loop: 578#L666-1 assume !false; 611#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 517#L371 assume !false; 617#L289 assume !(0 == ~wl_st~0); 551#L293 assume !(0 == ~c1_st~0); 520#L296 assume !(0 == ~c2_st~0); 522#L299 assume !(0 == ~wb_st~0); 534#L302 assume !(0 == ~r_st~0); 512#L387 start_simulation_~kernel_st~0 := 2; 513#L542 assume !(1 == ~c_req_up~0); 585#L542-2 start_simulation_~kernel_st~0 := 3; 597#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 580#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 581#L559-1 assume !(0 == ~e_e~0); 603#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 616#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 535#L574-1 assume 1 == ~wl_pc~0; 536#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 519#L587 assume !(1 == ~c1_pc~0); 596#L597 assume !(1 == ~c2_pc~0); 560#L606 assume !(1 == ~wb_pc~0); 563#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 564#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 532#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 533#L634-1 assume !(1 == ~e_g~0); 573#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 601#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 612#L649-1 assume 0 == ~wl_st~0; 578#L666-1 [2019-11-28 21:18:27,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:27,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2019-11-28 21:18:27,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:27,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257537746] [2019-11-28 21:18:27,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:27,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257537746] [2019-11-28 21:18:27,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:27,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:18:27,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587061752] [2019-11-28 21:18:27,084 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:18:27,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:27,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1806372813, now seen corresponding path program 2 times [2019-11-28 21:18:27,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:27,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578648982] [2019-11-28 21:18:27,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:27,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578648982] [2019-11-28 21:18:27,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:27,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:18:27,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608651203] [2019-11-28 21:18:27,119 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:18:27,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:18:27,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:18:27,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:18:27,120 INFO L87 Difference]: Start difference. First operand 120 states and 213 transitions. cyclomatic complexity: 94 Second operand 3 states. [2019-11-28 21:18:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:18:27,139 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2019-11-28 21:18:27,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:18:27,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 212 transitions. [2019-11-28 21:18:27,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 21:18:27,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 212 transitions. [2019-11-28 21:18:27,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2019-11-28 21:18:27,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2019-11-28 21:18:27,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 212 transitions. [2019-11-28 21:18:27,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:18:27,146 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 212 transitions. [2019-11-28 21:18:27,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 212 transitions. [2019-11-28 21:18:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-28 21:18:27,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 21:18:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 212 transitions. [2019-11-28 21:18:27,154 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 212 transitions. [2019-11-28 21:18:27,154 INFO L591 BuchiCegarLoop]: Abstraction has 120 states and 212 transitions. [2019-11-28 21:18:27,154 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:18:27,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 212 transitions. [2019-11-28 21:18:27,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 21:18:27,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:18:27,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:18:27,157 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:27,157 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:27,158 INFO L794 eck$LassoCheckResult]: Stem: 862#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 775#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 753#L398 assume !(1 == ~c_req_up~0); 755#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 761#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 762#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 808#L419-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 840#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 857#L429-1 assume !(0 == ~e_f~0); 868#L434-1 assume !(0 == ~e_g~0); 803#L439-1 assume !(0 == ~e_e~0); 804#L444-1 assume !(0 == ~e_c~0); 836#L449-1 assume !(0 == ~e_wl~0); 855#L454-1 assume !(1 == ~wl_pc~0); 833#L466 assume !(2 == ~wl_pc~0); 834#L467 assume !(1 == ~c1_pc~0); 829#L477 assume !(1 == ~c2_pc~0); 785#L486 assume !(1 == ~wb_pc~0); 786#L495 assume !(1 == ~e_c~0); 851#L504-1 assume !(1 == ~e_e~0); 852#L509-1 assume !(1 == ~e_f~0); 865#L514-1 assume !(1 == ~e_g~0); 788#L519-1 assume !(1 == ~e_c~0); 789#L524-1 assume !(1 == ~e_wl~0); 825#L666-1 [2019-11-28 21:18:27,158 INFO L796 eck$LassoCheckResult]: Loop: 825#L666-1 assume !false; 858#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 764#L371 assume !false; 864#L289 assume !(0 == ~wl_st~0); 798#L293 assume !(0 == ~c1_st~0); 767#L296 assume !(0 == ~c2_st~0); 769#L299 assume !(0 == ~wb_st~0); 781#L302 assume !(0 == ~r_st~0); 759#L387 start_simulation_~kernel_st~0 := 2; 760#L542 assume !(1 == ~c_req_up~0); 832#L542-2 start_simulation_~kernel_st~0 := 3; 844#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 827#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 828#L559-1 assume !(0 == ~e_e~0); 850#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 863#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 782#L574-1 assume !(1 == ~wl_pc~0); 784#L586 assume !(2 == ~wl_pc~0); 766#L587 assume !(1 == ~c1_pc~0); 843#L597 assume !(1 == ~c2_pc~0); 807#L606 assume !(1 == ~wb_pc~0); 810#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 811#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 779#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 780#L634-1 assume !(1 == ~e_g~0); 820#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 848#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 859#L649-1 assume 0 == ~wl_st~0; 825#L666-1 [2019-11-28 21:18:27,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:27,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2019-11-28 21:18:27,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:27,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507193614] [2019-11-28 21:18:27,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:27,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507193614] [2019-11-28 21:18:27,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:27,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:18:27,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141180965] [2019-11-28 21:18:27,208 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:18:27,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:27,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1257113092, now seen corresponding path program 1 times [2019-11-28 21:18:27,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:27,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885802096] [2019-11-28 21:18:27,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:27,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885802096] [2019-11-28 21:18:27,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:27,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:18:27,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494158770] [2019-11-28 21:18:27,262 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:18:27,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:18:27,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:18:27,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:18:27,263 INFO L87 Difference]: Start difference. First operand 120 states and 212 transitions. cyclomatic complexity: 93 Second operand 3 states. [2019-11-28 21:18:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:18:27,285 INFO L93 Difference]: Finished difference Result 120 states and 211 transitions. [2019-11-28 21:18:27,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:18:27,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 211 transitions. [2019-11-28 21:18:27,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 21:18:27,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 211 transitions. [2019-11-28 21:18:27,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2019-11-28 21:18:27,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2019-11-28 21:18:27,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 211 transitions. [2019-11-28 21:18:27,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:18:27,295 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 211 transitions. [2019-11-28 21:18:27,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 211 transitions. [2019-11-28 21:18:27,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-28 21:18:27,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 21:18:27,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 211 transitions. [2019-11-28 21:18:27,308 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 211 transitions. [2019-11-28 21:18:27,308 INFO L591 BuchiCegarLoop]: Abstraction has 120 states and 211 transitions. [2019-11-28 21:18:27,308 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 21:18:27,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 211 transitions. [2019-11-28 21:18:27,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 21:18:27,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:18:27,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:18:27,311 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:27,311 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:27,311 INFO L794 eck$LassoCheckResult]: Stem: 1109#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1022#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1000#L398 assume !(1 == ~c_req_up~0); 1002#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1008#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1009#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1055#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1087#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1104#L429-1 assume !(0 == ~e_f~0); 1115#L434-1 assume !(0 == ~e_g~0); 1050#L439-1 assume !(0 == ~e_e~0); 1051#L444-1 assume !(0 == ~e_c~0); 1083#L449-1 assume !(0 == ~e_wl~0); 1102#L454-1 assume !(1 == ~wl_pc~0); 1080#L466 assume !(2 == ~wl_pc~0); 1081#L467 assume !(1 == ~c1_pc~0); 1076#L477 assume !(1 == ~c2_pc~0); 1032#L486 assume !(1 == ~wb_pc~0); 1033#L495 assume !(1 == ~e_c~0); 1098#L504-1 assume !(1 == ~e_e~0); 1099#L509-1 assume !(1 == ~e_f~0); 1112#L514-1 assume !(1 == ~e_g~0); 1035#L519-1 assume !(1 == ~e_c~0); 1036#L524-1 assume !(1 == ~e_wl~0); 1072#L666-1 [2019-11-28 21:18:27,316 INFO L796 eck$LassoCheckResult]: Loop: 1072#L666-1 assume !false; 1105#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1011#L371 assume !false; 1111#L289 assume !(0 == ~wl_st~0); 1045#L293 assume !(0 == ~c1_st~0); 1014#L296 assume !(0 == ~c2_st~0); 1016#L299 assume !(0 == ~wb_st~0); 1028#L302 assume !(0 == ~r_st~0); 1006#L387 start_simulation_~kernel_st~0 := 2; 1007#L542 assume !(1 == ~c_req_up~0); 1079#L542-2 start_simulation_~kernel_st~0 := 3; 1091#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 1074#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1075#L559-1 assume !(0 == ~e_e~0); 1097#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1110#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1029#L574-1 assume 1 == ~wl_pc~0; 1030#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1013#L587 assume !(1 == ~c1_pc~0); 1090#L597 assume !(1 == ~c2_pc~0); 1054#L606 assume !(1 == ~wb_pc~0); 1057#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 1058#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1026#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1027#L634-1 assume !(1 == ~e_g~0); 1067#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1095#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1106#L649-1 assume 0 == ~wl_st~0; 1072#L666-1 [2019-11-28 21:18:27,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:27,317 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2019-11-28 21:18:27,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:27,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869630478] [2019-11-28 21:18:27,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:27,394 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:18:27,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:27,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1806372813, now seen corresponding path program 3 times [2019-11-28 21:18:27,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:27,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207265825] [2019-11-28 21:18:27,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:27,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207265825] [2019-11-28 21:18:27,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:27,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:18:27,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775619288] [2019-11-28 21:18:27,436 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:18:27,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:18:27,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:18:27,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:18:27,437 INFO L87 Difference]: Start difference. First operand 120 states and 211 transitions. cyclomatic complexity: 92 Second operand 3 states. [2019-11-28 21:18:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:18:27,508 INFO L93 Difference]: Finished difference Result 154 states and 273 transitions. [2019-11-28 21:18:27,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:18:27,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 273 transitions. [2019-11-28 21:18:27,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2019-11-28 21:18:27,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 273 transitions. [2019-11-28 21:18:27,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2019-11-28 21:18:27,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2019-11-28 21:18:27,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 273 transitions. [2019-11-28 21:18:27,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:18:27,520 INFO L688 BuchiCegarLoop]: Abstraction has 154 states and 273 transitions. [2019-11-28 21:18:27,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 273 transitions. [2019-11-28 21:18:27,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-28 21:18:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-28 21:18:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 273 transitions. [2019-11-28 21:18:27,532 INFO L711 BuchiCegarLoop]: Abstraction has 154 states and 273 transitions. [2019-11-28 21:18:27,533 INFO L591 BuchiCegarLoop]: Abstraction has 154 states and 273 transitions. [2019-11-28 21:18:27,533 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 21:18:27,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 273 transitions. [2019-11-28 21:18:27,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2019-11-28 21:18:27,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:18:27,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:18:27,537 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:27,539 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:27,539 INFO L794 eck$LassoCheckResult]: Stem: 1392#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1302#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1280#L398 assume !(1 == ~c_req_up~0); 1282#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1288#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1289#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1335#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1368#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1387#L429-1 assume !(0 == ~e_f~0); 1398#L434-1 assume 0 == ~e_g~0;~e_g~0 := 1; 1403#L439-1 assume !(0 == ~e_e~0); 1417#L444-1 assume !(0 == ~e_c~0); 1416#L449-1 assume !(0 == ~e_wl~0); 1415#L454-1 assume !(1 == ~wl_pc~0); 1413#L466 assume !(2 == ~wl_pc~0); 1411#L467 assume !(1 == ~c1_pc~0); 1409#L477 assume !(1 == ~c2_pc~0); 1407#L486 assume !(1 == ~wb_pc~0); 1379#L495 assume !(1 == ~e_c~0); 1381#L504-1 assume !(1 == ~e_e~0); 1382#L509-1 assume !(1 == ~e_f~0); 1395#L514-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1315#L519-1 assume !(1 == ~e_c~0); 1316#L524-1 assume !(1 == ~e_wl~0); 1352#L666-1 [2019-11-28 21:18:27,539 INFO L796 eck$LassoCheckResult]: Loop: 1352#L666-1 assume !false; 1388#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1291#L371 assume !false; 1394#L289 assume !(0 == ~wl_st~0); 1325#L293 assume !(0 == ~c1_st~0); 1294#L296 assume !(0 == ~c2_st~0); 1296#L299 assume !(0 == ~wb_st~0); 1308#L302 assume !(0 == ~r_st~0); 1286#L387 start_simulation_~kernel_st~0 := 2; 1287#L542 assume !(1 == ~c_req_up~0); 1360#L542-2 start_simulation_~kernel_st~0 := 3; 1372#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 1354#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1355#L559-1 assume !(0 == ~e_e~0); 1380#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1393#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1309#L574-1 assume 1 == ~wl_pc~0; 1310#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1293#L587 assume !(1 == ~c1_pc~0); 1371#L597 assume !(1 == ~c2_pc~0); 1334#L606 assume !(1 == ~wb_pc~0); 1337#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 1338#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1306#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1307#L634-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1347#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1376#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1389#L649-1 assume 0 == ~wl_st~0; 1352#L666-1 [2019-11-28 21:18:27,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:27,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1535466835, now seen corresponding path program 1 times [2019-11-28 21:18:27,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:27,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098821108] [2019-11-28 21:18:27,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:27,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:27,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098821108] [2019-11-28 21:18:27,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:27,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:18:27,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805946625] [2019-11-28 21:18:27,585 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:18:27,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:27,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1806432395, now seen corresponding path program 1 times [2019-11-28 21:18:27,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:27,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875224202] [2019-11-28 21:18:27,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:27,615 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:18:27,924 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-11-28 21:18:28,043 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:18:28,046 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:18:28,046 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:18:28,046 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:18:28,047 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:18:28,047 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:28,047 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:18:28,047 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:18:28,048 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2019-11-28 21:18:28,048 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:18:28,048 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:18:28,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,496 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:18:28,497 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:28,508 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:18:28,508 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:18:28,517 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:18:28,517 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} 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) [2019-11-28 21:18:28,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:18:28,525 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:28,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:18:28,541 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:18:28,551 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:18:28,554 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:18:28,554 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:18:28,554 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:18:28,554 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:18:28,554 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:18:28,555 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:28,555 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:18:28,555 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:18:28,555 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2019-11-28 21:18:28,555 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:18:28,555 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:18:28,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:28,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:29,069 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:18:29,076 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:29,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:18:29,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:18:29,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:18:29,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:18:29,112 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 21:18:29,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:18:29,115 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 21:18:29,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:18:29,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:29,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:18:29,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:18:29,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:18:29,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:18:29,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:18:29,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:18:29,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:18:29,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:18:29,135 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:18:29,144 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 21:18:29,144 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:18:29,160 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:18:29,160 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:18:29,160 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:18:29,161 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:29,174 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 21:18:29,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:29,276 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:18:29,282 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:18:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:29,329 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:18:29,333 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:18:29,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:29,387 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 21:18:29,388 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 154 states and 273 transitions. cyclomatic complexity: 120 Second operand 5 states. [2019-11-28 21:18:29,524 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 154 states and 273 transitions. cyclomatic complexity: 120. Second operand 5 states. Result 480 states and 845 transitions. Complement of second has 5 states. [2019-11-28 21:18:29,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:18:29,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 21:18:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2019-11-28 21:18:29,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 24 letters. Loop has 28 letters. [2019-11-28 21:18:29,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:18:29,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 52 letters. Loop has 28 letters. [2019-11-28 21:18:29,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:18:29,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 24 letters. Loop has 56 letters. [2019-11-28 21:18:29,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:18:29,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 480 states and 845 transitions. [2019-11-28 21:18:29,546 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 318 [2019-11-28 21:18:29,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 480 states to 480 states and 845 transitions. [2019-11-28 21:18:29,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2019-11-28 21:18:29,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 371 [2019-11-28 21:18:29,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 480 states and 845 transitions. [2019-11-28 21:18:29,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:18:29,552 INFO L688 BuchiCegarLoop]: Abstraction has 480 states and 845 transitions. [2019-11-28 21:18:29,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states and 845 transitions. [2019-11-28 21:18:29,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 370. [2019-11-28 21:18:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-11-28 21:18:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 653 transitions. [2019-11-28 21:18:29,578 INFO L711 BuchiCegarLoop]: Abstraction has 370 states and 653 transitions. [2019-11-28 21:18:29,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:18:29,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:18:29,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:18:29,581 INFO L87 Difference]: Start difference. First operand 370 states and 653 transitions. Second operand 4 states. [2019-11-28 21:18:29,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:18:29,709 INFO L93 Difference]: Finished difference Result 570 states and 982 transitions. [2019-11-28 21:18:29,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 21:18:29,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 570 states and 982 transitions. [2019-11-28 21:18:29,717 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 332 [2019-11-28 21:18:29,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 570 states to 570 states and 982 transitions. [2019-11-28 21:18:29,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 391 [2019-11-28 21:18:29,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 391 [2019-11-28 21:18:29,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 570 states and 982 transitions. [2019-11-28 21:18:29,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:18:29,727 INFO L688 BuchiCegarLoop]: Abstraction has 570 states and 982 transitions. [2019-11-28 21:18:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states and 982 transitions. [2019-11-28 21:18:29,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 542. [2019-11-28 21:18:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-11-28 21:18:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 942 transitions. [2019-11-28 21:18:29,742 INFO L711 BuchiCegarLoop]: Abstraction has 542 states and 942 transitions. [2019-11-28 21:18:29,743 INFO L591 BuchiCegarLoop]: Abstraction has 542 states and 942 transitions. [2019-11-28 21:18:29,743 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 21:18:29,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 542 states and 942 transitions. [2019-11-28 21:18:29,747 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 332 [2019-11-28 21:18:29,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:18:29,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:18:29,751 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:29,751 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:29,751 INFO L794 eck$LassoCheckResult]: Stem: 3246#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 3073#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 3034#L398 assume !(1 == ~c_req_up~0); 3036#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3047#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3048#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3132#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3193#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3231#L429-1 assume !(0 == ~e_f~0); 3264#L434-1 assume !(0 == ~e_g~0); 3124#L439-1 assume !(0 == ~e_e~0); 3125#L444-1 assume !(0 == ~e_c~0); 3185#L449-1 assume !(0 == ~e_wl~0); 3228#L454-1 assume !(1 == ~wl_pc~0); 3182#L466 assume !(2 == ~wl_pc~0); 3183#L467 assume !(1 == ~c1_pc~0); 3176#L477 assume !(1 == ~c2_pc~0); 3092#L486 assume !(1 == ~wb_pc~0); 3093#L495 assume !(1 == ~e_c~0); 3316#L504-1 assume !(1 == ~e_e~0); 3314#L509-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3313#L514-1 assume !(1 == ~e_g~0); 3280#L519-1 assume !(1 == ~e_c~0); 3312#L524-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3232#L666-1 [2019-11-28 21:18:29,752 INFO L796 eck$LassoCheckResult]: Loop: 3232#L666-1 assume !false; 3233#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 3050#L371 assume !false; 3251#L289 assume !(0 == ~wl_st~0); 3114#L293 assume !(0 == ~c1_st~0); 3057#L296 assume !(0 == ~c2_st~0); 3059#L299 assume !(0 == ~wb_st~0); 3084#L302 assume !(0 == ~r_st~0); 3043#L387 start_simulation_~kernel_st~0 := 2; 3044#L542 assume !(1 == ~c_req_up~0); 3179#L542-2 start_simulation_~kernel_st~0 := 3; 3256#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 3350#L554-2 assume !(0 == ~e_g~0); 3352#L559-1 assume !(0 == ~e_e~0); 3351#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 3278#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3086#L574-1 assume !(1 == ~wl_pc~0); 3088#L586 assume !(2 == ~wl_pc~0); 3054#L587 assume !(1 == ~c1_pc~0); 3198#L597 assume !(1 == ~c2_pc~0); 3129#L606 assume !(1 == ~wb_pc~0); 3210#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 3559#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3558#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3499#L634-1 assume !(1 == ~e_g~0); 3155#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3214#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3238#L649-1 assume 0 == ~wl_st~0; 3232#L666-1 [2019-11-28 21:18:29,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:29,752 INFO L82 PathProgramCache]: Analyzing trace with hash 255545495, now seen corresponding path program 1 times [2019-11-28 21:18:29,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:29,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980125226] [2019-11-28 21:18:29,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:29,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980125226] [2019-11-28 21:18:29,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:29,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:18:29,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896879819] [2019-11-28 21:18:29,824 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:18:29,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:29,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2016785850, now seen corresponding path program 1 times [2019-11-28 21:18:29,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:29,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869824165] [2019-11-28 21:18:29,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:29,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869824165] [2019-11-28 21:18:29,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:29,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 21:18:29,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63456054] [2019-11-28 21:18:29,854 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:18:29,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:18:29,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:18:29,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:18:29,855 INFO L87 Difference]: Start difference. First operand 542 states and 942 transitions. cyclomatic complexity: 406 Second operand 4 states. [2019-11-28 21:18:29,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:18:29,970 INFO L93 Difference]: Finished difference Result 1129 states and 1896 transitions. [2019-11-28 21:18:29,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:18:29,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1129 states and 1896 transitions. [2019-11-28 21:18:29,983 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 690 [2019-11-28 21:18:29,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1129 states to 1129 states and 1896 transitions. [2019-11-28 21:18:29,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 774 [2019-11-28 21:18:29,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 774 [2019-11-28 21:18:29,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1129 states and 1896 transitions. [2019-11-28 21:18:29,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:18:29,997 INFO L688 BuchiCegarLoop]: Abstraction has 1129 states and 1896 transitions. [2019-11-28 21:18:29,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states and 1896 transitions. [2019-11-28 21:18:30,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1111. [2019-11-28 21:18:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-11-28 21:18:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1875 transitions. [2019-11-28 21:18:30,025 INFO L711 BuchiCegarLoop]: Abstraction has 1111 states and 1875 transitions. [2019-11-28 21:18:30,026 INFO L591 BuchiCegarLoop]: Abstraction has 1111 states and 1875 transitions. [2019-11-28 21:18:30,026 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 21:18:30,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1111 states and 1875 transitions. [2019-11-28 21:18:30,033 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 688 [2019-11-28 21:18:30,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:18:30,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:18:30,037 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:30,038 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:30,038 INFO L794 eck$LassoCheckResult]: Stem: 4965#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 4768#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 4722#L398 assume !(1 == ~c_req_up~0); 4724#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4739#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4826#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4827#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4940#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4941#L429-1 assume !(0 == ~e_f~0); 5013#L434-1 assume !(0 == ~e_g~0); 5014#L439-1 assume !(0 == ~e_e~0); 4882#L444-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4883#L449-1 assume !(0 == ~e_wl~0); 4936#L454-1 assume !(1 == ~wl_pc~0); 4879#L466 assume !(2 == ~wl_pc~0); 4880#L467 assume !(1 == ~c1_pc~0); 4876#L477 assume !(1 == ~c2_pc~0); 4878#L486 assume !(1 == ~wb_pc~0); 5032#L495 assume !(1 == ~e_c~0); 5030#L504-1 assume !(1 == ~e_e~0); 5028#L509-1 assume !(1 == ~e_f~0); 5025#L514-1 assume 1 == ~e_g~0;~e_g~0 := 2; 5022#L519-1 assume !(1 == ~e_c~0); 5023#L524-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 5196#L666-1 [2019-11-28 21:18:30,040 INFO L796 eck$LassoCheckResult]: Loop: 5196#L666-1 assume !false; 5346#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 5718#L371 assume !false; 5717#L289 assume !(0 == ~wl_st~0); 5716#L293 assume !(0 == ~c1_st~0); 5715#L296 assume !(0 == ~c2_st~0); 5714#L299 assume !(0 == ~wb_st~0); 5322#L302 assume !(0 == ~r_st~0); 5320#L387 start_simulation_~kernel_st~0 := 2; 5313#L542 assume !(1 == ~c_req_up~0); 5312#L542-2 start_simulation_~kernel_st~0 := 3; 5305#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 5303#L554-2 assume !(0 == ~e_g~0); 5301#L559-1 assume !(0 == ~e_e~0); 5298#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 5297#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 5295#L574-1 assume 1 == ~wl_pc~0; 5293#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 5289#L587 assume !(1 == ~c1_pc~0); 5286#L597 assume !(1 == ~c2_pc~0); 5288#L606 assume !(1 == ~wb_pc~0); 5680#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 5277#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 5278#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 5660#L634-1 assume !(1 == ~e_g~0); 5462#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 5659#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 5730#L649-1 assume 0 == ~wl_st~0; 5196#L666-1 [2019-11-28 21:18:30,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:30,040 INFO L82 PathProgramCache]: Analyzing trace with hash 842409169, now seen corresponding path program 1 times [2019-11-28 21:18:30,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:30,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62562909] [2019-11-28 21:18:30,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:30,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:30,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62562909] [2019-11-28 21:18:30,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:30,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:18:30,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236697142] [2019-11-28 21:18:30,084 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:18:30,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:30,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1467526129, now seen corresponding path program 1 times [2019-11-28 21:18:30,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:30,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933253062] [2019-11-28 21:18:30,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:30,114 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:18:30,255 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-11-28 21:18:30,309 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:18:30,310 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:18:30,310 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:18:30,310 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:18:30,310 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:18:30,310 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:30,310 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:18:30,311 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:18:30,311 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration8_Loop [2019-11-28 21:18:30,311 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:18:30,311 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:18:30,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,665 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:18:30,670 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:18:30,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:18:30,681 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:30,687 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:18:30,687 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:18:30,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:18:30,700 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:30,703 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:18:30,704 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:30,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:18:30,712 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:18:30,719 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:18:30,719 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2019-11-28 21:18:30,749 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:18:30,749 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:30,758 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:18:30,758 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-5} Honda state: {~c1_st~0=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:30,774 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:18:30,775 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:30,797 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:18:30,797 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:18:30,803 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:18:30,806 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:18:30,806 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:18:30,806 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:18:30,806 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:18:30,806 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:18:30,807 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:30,807 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:18:30,807 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:18:30,807 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration8_Loop [2019-11-28 21:18:30,807 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:18:30,807 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:18:30,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:30,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,151 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:18:31,152 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:31,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:18:31,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:18:31,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:18:31,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:18:31,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:18:31,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:18:31,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:18:31,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:18:31,166 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:18:31,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:18:31,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:18:31,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:18:31,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:18:31,177 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 21:18:31,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:18:31,178 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 21:18:31,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:31,186 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:31,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:18:31,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:18:31,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:18:31,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:18:31,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:18:31,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:18:31,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:18:31,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:18:31,205 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:31,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:18:31,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:18:31,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:18:31,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:18:31,214 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 21:18:31,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:18:31,215 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 21:18:31,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:18:31,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:31,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:18:31,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:18:31,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:18:31,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:18:31,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:18:31,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:18:31,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:18:31,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:18:31,230 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:18:31,234 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 21:18:31,234 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:31,242 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:18:31,242 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:18:31,242 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:18:31,243 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2019-11-28 21:18:31,246 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 21:18:31,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:31,298 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:18:31,299 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:18:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:31,316 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:18:31,317 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:18:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:31,344 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 21:18:31,344 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1111 states and 1875 transitions. cyclomatic complexity: 776 Second operand 5 states. [2019-11-28 21:18:31,396 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1111 states and 1875 transitions. cyclomatic complexity: 776. Second operand 5 states. Result 1849 states and 3132 transitions. Complement of second has 5 states. [2019-11-28 21:18:31,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:18:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 21:18:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2019-11-28 21:18:31,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 359 transitions. Stem has 24 letters. Loop has 28 letters. [2019-11-28 21:18:31,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:18:31,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 359 transitions. Stem has 52 letters. Loop has 28 letters. [2019-11-28 21:18:31,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:18:31,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 359 transitions. Stem has 24 letters. Loop has 56 letters. [2019-11-28 21:18:31,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:18:31,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1849 states and 3132 transitions. [2019-11-28 21:18:31,418 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1064 [2019-11-28 21:18:31,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1849 states to 1849 states and 3132 transitions. [2019-11-28 21:18:31,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1142 [2019-11-28 21:18:31,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1151 [2019-11-28 21:18:31,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1849 states and 3132 transitions. [2019-11-28 21:18:31,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:18:31,437 INFO L688 BuchiCegarLoop]: Abstraction has 1849 states and 3132 transitions. [2019-11-28 21:18:31,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states and 3132 transitions. [2019-11-28 21:18:31,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 955. [2019-11-28 21:18:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-11-28 21:18:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1615 transitions. [2019-11-28 21:18:31,471 INFO L711 BuchiCegarLoop]: Abstraction has 955 states and 1615 transitions. [2019-11-28 21:18:31,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:18:31,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:18:31,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:18:31,471 INFO L87 Difference]: Start difference. First operand 955 states and 1615 transitions. Second operand 4 states. [2019-11-28 21:18:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:18:31,614 INFO L93 Difference]: Finished difference Result 977 states and 1626 transitions. [2019-11-28 21:18:31,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 21:18:31,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 977 states and 1626 transitions. [2019-11-28 21:18:31,625 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 547 [2019-11-28 21:18:31,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 977 states to 977 states and 1626 transitions. [2019-11-28 21:18:31,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2019-11-28 21:18:31,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2019-11-28 21:18:31,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 977 states and 1626 transitions. [2019-11-28 21:18:31,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:18:31,636 INFO L688 BuchiCegarLoop]: Abstraction has 977 states and 1626 transitions. [2019-11-28 21:18:31,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states and 1626 transitions. [2019-11-28 21:18:31,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 894. [2019-11-28 21:18:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-11-28 21:18:31,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1493 transitions. [2019-11-28 21:18:31,654 INFO L711 BuchiCegarLoop]: Abstraction has 894 states and 1493 transitions. [2019-11-28 21:18:31,654 INFO L591 BuchiCegarLoop]: Abstraction has 894 states and 1493 transitions. [2019-11-28 21:18:31,654 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 21:18:31,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 894 states and 1493 transitions. [2019-11-28 21:18:31,660 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 547 [2019-11-28 21:18:31,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:18:31,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:18:31,661 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:31,661 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:31,661 INFO L794 eck$LassoCheckResult]: Stem: 10007#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 9831#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 9788#L398 assume !(1 == ~c_req_up~0); 9790#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 9801#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 9802#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 9954#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 9955#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 9995#L429-1 assume !(0 == ~e_f~0); 10039#L434-1 assume !(0 == ~e_g~0); 10040#L439-1 assume !(0 == ~e_e~0); 9946#L444-1 assume !(0 == ~e_c~0); 9947#L449-1 assume !(0 == ~e_wl~0); 10014#L454-1 assume !(1 == ~wl_pc~0); 10015#L466 assume !(2 == ~wl_pc~0); 10038#L467 assume !(1 == ~c1_pc~0); 10037#L477 assume !(1 == ~c2_pc~0); 9850#L486 assume !(1 == ~wb_pc~0); 9851#L495 assume !(1 == ~e_c~0); 10032#L504-1 assume !(1 == ~e_e~0); 10012#L509-1 assume !(1 == ~e_f~0); 10013#L514-1 assume 1 == ~e_g~0;~e_g~0 := 2; 10035#L519-1 assume !(1 == ~e_c~0); 9928#L524-1 assume !(1 == ~e_wl~0); 9929#L666-1 assume !false; 10456#L536 [2019-11-28 21:18:31,662 INFO L796 eck$LassoCheckResult]: Loop: 10456#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 10532#L371 assume !false; 10531#L289 assume !(0 == ~wl_st~0); 10530#L293 assume !(0 == ~c1_st~0); 10529#L296 assume !(0 == ~c2_st~0); 10528#L299 assume !(0 == ~wb_st~0); 10527#L302 assume !(0 == ~r_st~0); 10526#L387 start_simulation_~kernel_st~0 := 2; 10441#L542 assume !(1 == ~c_req_up~0); 9940#L542-2 start_simulation_~kernel_st~0 := 3; 9963#L554 assume !(0 == ~e_f~0); 9932#L554-2 assume !(0 == ~e_g~0); 9933#L559-1 assume !(0 == ~e_e~0); 9981#L564-1 assume !(0 == ~e_c~0); 10008#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 9844#L574-1 assume 1 == ~wl_pc~0; 9845#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 9810#L587 assume !(1 == ~c1_pc~0); 9960#L597 assume !(1 == ~c2_pc~0); 9889#L606 assume !(1 == ~wb_pc~0); 9896#L615 assume !(1 == ~e_c~0); 9897#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 10041#L629-1 assume !(1 == ~e_f~0); 10499#L634-1 assume !(1 == ~e_g~0); 9918#L639-1 assume !(1 == ~e_c~0); 10542#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 10539#L649-1 assume 0 == ~wl_st~0; 10535#L666-1 assume !false; 10456#L536 [2019-11-28 21:18:31,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:31,662 INFO L82 PathProgramCache]: Analyzing trace with hash -666236546, now seen corresponding path program 1 times [2019-11-28 21:18:31,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:31,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227386767] [2019-11-28 21:18:31,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:31,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227386767] [2019-11-28 21:18:31,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:31,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:18:31,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057012576] [2019-11-28 21:18:31,717 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:18:31,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:31,718 INFO L82 PathProgramCache]: Analyzing trace with hash -311766517, now seen corresponding path program 1 times [2019-11-28 21:18:31,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:31,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518520849] [2019-11-28 21:18:31,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:31,733 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:18:31,847 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-11-28 21:18:31,897 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:18:31,897 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:18:31,897 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:18:31,897 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:18:31,897 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:18:31,898 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:31,898 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:18:31,898 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:18:31,898 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration9_Loop [2019-11-28 21:18:31,898 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:18:31,898 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:18:31,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:31,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,246 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:18:32,247 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,254 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:18:32,254 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:18:32,257 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:18:32,257 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,272 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:18:32,272 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:18:32,275 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:18:32,276 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=7} Honda state: {~r_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,282 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:18:32,282 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:18:32,284 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:18:32,284 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0=0} Honda state: {ULTIMATE.start_eval_~tmp~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:18:32,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:18:32,292 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,295 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:18:32,295 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___2~0=0} Honda state: {ULTIMATE.start_eval_~tmp___2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:18:32,307 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:18:32,307 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,312 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:18:32,312 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:18:32,319 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:18:32,319 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,323 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:18:32,324 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-5} Honda state: {~c1_st~0=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,332 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:18:32,332 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:18:32,336 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:18:32,336 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_g~0=-1} Honda state: {~e_g~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,348 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:18:32,348 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:18:32,350 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:18:32,351 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet1=0} Honda state: {ULTIMATE.start_eval_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,359 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:18:32,360 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:18:32,364 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:18:32,364 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_st~0=7} Honda state: {~wb_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:18:32,371 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,380 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:18:32,381 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:18:32,392 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:18:32,393 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:18:32,393 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:18:32,394 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:18:32,394 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:18:32,394 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:18:32,394 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,394 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:18:32,394 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:18:32,394 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration9_Loop [2019-11-28 21:18:32,394 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:18:32,394 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:18:32,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:18:32,714 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:18:32,715 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:18:32,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:18:32,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:18:32,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:18:32,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:18:32,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:18:32,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:18:32,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:18:32,733 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) [2019-11-28 21:18:32,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:18:32,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:18:32,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:18:32,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:18:32,749 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 21:18:32,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:18:32,750 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 21:18:32,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:18:32,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:18:32,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:18:32,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:18:32,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:18:32,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:18:32,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:18:32,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:18:32,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:18:32,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:18:32,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:18:32,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:18:32,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:18:32,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:18:32,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:18:32,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:18:32,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:18:32,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:18:32,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:18:32,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:18:32,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:18:32,791 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 21:18:32,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:18:32,792 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 21:18:32,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:18:32,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:18:32,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:18:32,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:18:32,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:18:32,805 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 21:18:32,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,807 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 21:18:32,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:18:32,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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:18:32,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:18:32,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:18:32,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:18:32,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:18:32,821 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 21:18:32,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:18:32,823 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 21:18:32,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,826 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) [2019-11-28 21:18:32,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:18:32,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:18:32,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:18:32,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:18:32,836 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 21:18:32,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:18:32,838 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 21:18:32,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,840 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) [2019-11-28 21:18:32,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:18:32,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:18:32,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:18:32,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:18:32,851 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 21:18:32,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:18:32,853 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 21:18:32,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,858 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) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:18:32,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:18:32,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:18:32,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:18:32,867 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 21:18:32,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:18:32,869 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 21:18:32,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:18:32,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 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 [2019-11-28 21:18:32,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:18:32,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:18:32,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:18:32,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:18:32,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:18:32,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:18:32,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:18:32,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:18:32,889 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:18:32,892 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 21:18:32,893 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:18:32,897 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:18:32,897 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:18:32,898 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:18:32,898 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -2*~e_e~0 + 3 Supporting invariants [] [2019-11-28 21:18:32,900 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:18:32,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:32,934 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:18:32,937 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:18:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:32,949 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:18:32,953 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:18:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:32,973 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 21:18:32,973 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 894 states and 1493 transitions. cyclomatic complexity: 608 Second operand 4 states. [2019-11-28 21:18:33,020 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 894 states and 1493 transitions. cyclomatic complexity: 608. Second operand 4 states. Result 2509 states and 4176 transitions. Complement of second has 5 states. [2019-11-28 21:18:33,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:18:33,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 21:18:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2019-11-28 21:18:33,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 25 letters. Loop has 28 letters. [2019-11-28 21:18:33,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:18:33,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 53 letters. Loop has 28 letters. [2019-11-28 21:18:33,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:18:33,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 25 letters. Loop has 56 letters. [2019-11-28 21:18:33,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:18:33,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2509 states and 4176 transitions. [2019-11-28 21:18:33,045 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1064 [2019-11-28 21:18:33,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2509 states to 2509 states and 4176 transitions. [2019-11-28 21:18:33,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1144 [2019-11-28 21:18:33,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1165 [2019-11-28 21:18:33,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2509 states and 4176 transitions. [2019-11-28 21:18:33,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:18:33,067 INFO L688 BuchiCegarLoop]: Abstraction has 2509 states and 4176 transitions. [2019-11-28 21:18:33,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states and 4176 transitions. [2019-11-28 21:18:33,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2488. [2019-11-28 21:18:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2488 states. [2019-11-28 21:18:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 4141 transitions. [2019-11-28 21:18:33,121 INFO L711 BuchiCegarLoop]: Abstraction has 2488 states and 4141 transitions. [2019-11-28 21:18:33,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:18:33,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:18:33,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:18:33,122 INFO L87 Difference]: Start difference. First operand 2488 states and 4141 transitions. Second operand 4 states. [2019-11-28 21:18:33,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:18:33,204 INFO L93 Difference]: Finished difference Result 3187 states and 5219 transitions. [2019-11-28 21:18:33,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:18:33,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3187 states and 5219 transitions. [2019-11-28 21:18:33,227 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1227 [2019-11-28 21:18:33,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3187 states to 3187 states and 5219 transitions. [2019-11-28 21:18:33,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2019-11-28 21:18:33,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2019-11-28 21:18:33,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3187 states and 5219 transitions. [2019-11-28 21:18:33,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:18:33,253 INFO L688 BuchiCegarLoop]: Abstraction has 3187 states and 5219 transitions. [2019-11-28 21:18:33,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3187 states and 5219 transitions. [2019-11-28 21:18:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3187 to 3187. [2019-11-28 21:18:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3187 states. [2019-11-28 21:18:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3187 states to 3187 states and 5219 transitions. [2019-11-28 21:18:33,314 INFO L711 BuchiCegarLoop]: Abstraction has 3187 states and 5219 transitions. [2019-11-28 21:18:33,314 INFO L591 BuchiCegarLoop]: Abstraction has 3187 states and 5219 transitions. [2019-11-28 21:18:33,314 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 21:18:33,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3187 states and 5219 transitions. [2019-11-28 21:18:33,332 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1227 [2019-11-28 21:18:33,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:18:33,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:18:33,333 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:33,333 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:33,333 INFO L794 eck$LassoCheckResult]: Stem: 19290#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 19102#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 19055#L398 assume !(1 == ~c_req_up~0); 19057#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 19062#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 19063#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 19222#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 19223#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 19271#L429-1 assume !(0 == ~e_f~0); 19344#L434-1 assume !(0 == ~e_g~0); 19147#L439-1 assume !(0 == ~e_e~0); 19148#L444-1 assume !(0 == ~e_c~0); 19343#L449-1 assume !(0 == ~e_wl~0); 19298#L454-1 assume !(1 == ~wl_pc~0); 19207#L466 assume !(2 == ~wl_pc~0); 19208#L467 assume !(1 == ~c1_pc~0); 19324#L477 assume !(1 == ~c2_pc~0); 19336#L486 assume !(1 == ~wb_pc~0); 19317#L495 assume !(1 == ~e_c~0); 19262#L504-1 assume !(1 == ~e_e~0); 19263#L509-1 assume !(1 == ~e_f~0); 19322#L514-1 assume !(1 == ~e_g~0); 19120#L519-1 assume !(1 == ~e_c~0); 19121#L524-1 assume !(1 == ~e_wl~0); 19425#L666-1 assume !false; 19426#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 20838#L371 [2019-11-28 21:18:33,334 INFO L796 eck$LassoCheckResult]: Loop: 20838#L371 assume !false; 21690#L289 assume 0 == ~wl_st~0; 21685#L302-1 assume !(0 == ~wl_st~0); 21679#L311 assume !(0 == ~c1_st~0); 21676#L326 assume !(0 == ~c2_st~0); 21667#L341 assume !(0 == ~wb_st~0); 21664#L356 assume !(0 == ~r_st~0); 20838#L371 [2019-11-28 21:18:33,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:33,334 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2019-11-28 21:18:33,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:33,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514048856] [2019-11-28 21:18:33,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:33,353 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:18:33,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:33,354 INFO L82 PathProgramCache]: Analyzing trace with hash 117964263, now seen corresponding path program 1 times [2019-11-28 21:18:33,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:33,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946837609] [2019-11-28 21:18:33,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:33,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946837609] [2019-11-28 21:18:33,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:33,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:18:33,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531949118] [2019-11-28 21:18:33,363 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:18:33,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:18:33,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:18:33,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:18:33,364 INFO L87 Difference]: Start difference. First operand 3187 states and 5219 transitions. cyclomatic complexity: 2068 Second operand 3 states. [2019-11-28 21:18:33,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:18:33,425 INFO L93 Difference]: Finished difference Result 4973 states and 7999 transitions. [2019-11-28 21:18:33,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:18:33,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4973 states and 7999 transitions. [2019-11-28 21:18:33,459 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1926 [2019-11-28 21:18:33,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4973 states to 4973 states and 7999 transitions. [2019-11-28 21:18:33,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1992 [2019-11-28 21:18:33,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1992 [2019-11-28 21:18:33,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4973 states and 7999 transitions. [2019-11-28 21:18:33,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:18:33,503 INFO L688 BuchiCegarLoop]: Abstraction has 4973 states and 7999 transitions. [2019-11-28 21:18:33,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4973 states and 7999 transitions. [2019-11-28 21:18:33,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4973 to 4973. [2019-11-28 21:18:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4973 states. [2019-11-28 21:18:33,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4973 states to 4973 states and 7999 transitions. [2019-11-28 21:18:33,631 INFO L711 BuchiCegarLoop]: Abstraction has 4973 states and 7999 transitions. [2019-11-28 21:18:33,631 INFO L591 BuchiCegarLoop]: Abstraction has 4973 states and 7999 transitions. [2019-11-28 21:18:33,631 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 21:18:33,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4973 states and 7999 transitions. [2019-11-28 21:18:33,656 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1926 [2019-11-28 21:18:33,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:18:33,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:18:33,657 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:33,658 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:33,658 INFO L794 eck$LassoCheckResult]: Stem: 27454#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 27270#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 27221#L398 assume !(1 == ~c_req_up~0); 27223#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 27228#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 27229#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 27385#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 27386#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 27435#L429-1 assume !(0 == ~e_f~0); 27509#L434-1 assume !(0 == ~e_g~0); 27311#L439-1 assume !(0 == ~e_e~0); 27312#L444-1 assume !(0 == ~e_c~0); 27508#L449-1 assume !(0 == ~e_wl~0); 27461#L454-1 assume !(1 == ~wl_pc~0); 27373#L466 assume !(2 == ~wl_pc~0); 27374#L467 assume !(1 == ~c1_pc~0); 27488#L477 assume !(1 == ~c2_pc~0); 27501#L486 assume !(1 == ~wb_pc~0); 27483#L495 assume !(1 == ~e_c~0); 27426#L504-1 assume !(1 == ~e_e~0); 27427#L509-1 assume !(1 == ~e_f~0); 27486#L514-1 assume !(1 == ~e_g~0); 27286#L519-1 assume !(1 == ~e_c~0); 27287#L524-1 assume !(1 == ~e_wl~0); 27360#L666-1 assume !false; 28735#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 30068#L371 [2019-11-28 21:18:33,658 INFO L796 eck$LassoCheckResult]: Loop: 30068#L371 assume !false; 31131#L289 assume 0 == ~wl_st~0; 31003#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 31120#L315 assume !(0 != eval_~tmp~0); 31129#L311 assume !(0 == ~c1_st~0); 31161#L326 assume !(0 == ~c2_st~0); 31147#L341 assume !(0 == ~wb_st~0); 31140#L356 assume !(0 == ~r_st~0); 30068#L371 [2019-11-28 21:18:33,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:33,658 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2019-11-28 21:18:33,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:33,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305736371] [2019-11-28 21:18:33,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:33,677 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:18:33,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:33,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1280783410, now seen corresponding path program 1 times [2019-11-28 21:18:33,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:33,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307814454] [2019-11-28 21:18:33,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:33,684 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:18:33,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:33,685 INFO L82 PathProgramCache]: Analyzing trace with hash 361828906, now seen corresponding path program 1 times [2019-11-28 21:18:33,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:33,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433453261] [2019-11-28 21:18:33,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:33,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433453261] [2019-11-28 21:18:33,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:33,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:18:33,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186758328] [2019-11-28 21:18:33,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:18:33,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:18:33,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:18:33,810 INFO L87 Difference]: Start difference. First operand 4973 states and 7999 transitions. cyclomatic complexity: 3062 Second operand 3 states. [2019-11-28 21:18:33,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:18:33,859 INFO L93 Difference]: Finished difference Result 7644 states and 12212 transitions. [2019-11-28 21:18:33,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:18:33,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7644 states and 12212 transitions. [2019-11-28 21:18:33,900 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2986 [2019-11-28 21:18:33,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7644 states to 7644 states and 12212 transitions. [2019-11-28 21:18:33,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3054 [2019-11-28 21:18:33,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3054 [2019-11-28 21:18:33,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7644 states and 12212 transitions. [2019-11-28 21:18:33,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:18:33,958 INFO L688 BuchiCegarLoop]: Abstraction has 7644 states and 12212 transitions. [2019-11-28 21:18:33,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7644 states and 12212 transitions. [2019-11-28 21:18:34,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7644 to 7644. [2019-11-28 21:18:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7644 states. [2019-11-28 21:18:34,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7644 states to 7644 states and 12212 transitions. [2019-11-28 21:18:34,090 INFO L711 BuchiCegarLoop]: Abstraction has 7644 states and 12212 transitions. [2019-11-28 21:18:34,090 INFO L591 BuchiCegarLoop]: Abstraction has 7644 states and 12212 transitions. [2019-11-28 21:18:34,090 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 21:18:34,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7644 states and 12212 transitions. [2019-11-28 21:18:34,117 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2986 [2019-11-28 21:18:34,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:18:34,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:18:34,118 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:34,118 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:34,118 INFO L794 eck$LassoCheckResult]: Stem: 40073#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 39895#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 39846#L398 assume !(1 == ~c_req_up~0); 39848#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 39853#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 39854#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 40014#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 40015#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 40056#L429-1 assume !(0 == ~e_f~0); 40131#L434-1 assume !(0 == ~e_g~0); 39938#L439-1 assume !(0 == ~e_e~0); 39939#L444-1 assume !(0 == ~e_c~0); 40130#L449-1 assume !(0 == ~e_wl~0); 40080#L454-1 assume !(1 == ~wl_pc~0); 40001#L466 assume !(2 == ~wl_pc~0); 40002#L467 assume !(1 == ~c1_pc~0); 40108#L477 assume !(1 == ~c2_pc~0); 40123#L486 assume !(1 == ~wb_pc~0); 40101#L495 assume !(1 == ~e_c~0); 40045#L504-1 assume !(1 == ~e_e~0); 40046#L509-1 assume !(1 == ~e_f~0); 40105#L514-1 assume !(1 == ~e_g~0); 39912#L519-1 assume !(1 == ~e_c~0); 39913#L524-1 assume !(1 == ~e_wl~0); 39988#L666-1 assume !false; 42263#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 45127#L371 [2019-11-28 21:18:34,119 INFO L796 eck$LassoCheckResult]: Loop: 45127#L371 assume !false; 47432#L289 assume 0 == ~wl_st~0; 40114#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 39963#L315 assume !(0 != eval_~tmp~0); 39964#L311 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 45144#L330 assume !(0 != eval_~tmp___0~0); 45143#L326 assume !(0 == ~c2_st~0); 45131#L341 assume !(0 == ~wb_st~0); 45128#L356 assume !(0 == ~r_st~0); 45127#L371 [2019-11-28 21:18:34,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:34,119 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2019-11-28 21:18:34,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:34,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697898777] [2019-11-28 21:18:34,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:34,132 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:18:34,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:34,133 INFO L82 PathProgramCache]: Analyzing trace with hash 998807808, now seen corresponding path program 1 times [2019-11-28 21:18:34,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:34,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533393029] [2019-11-28 21:18:34,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:34,139 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:18:34,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:34,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1718978040, now seen corresponding path program 1 times [2019-11-28 21:18:34,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:34,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693103837] [2019-11-28 21:18:34,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:34,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693103837] [2019-11-28 21:18:34,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:34,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:18:34,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277629914] [2019-11-28 21:18:34,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:18:34,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:18:34,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:18:34,207 INFO L87 Difference]: Start difference. First operand 7644 states and 12212 transitions. cyclomatic complexity: 4604 Second operand 3 states. [2019-11-28 21:18:34,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:18:34,283 INFO L93 Difference]: Finished difference Result 12085 states and 19155 transitions. [2019-11-28 21:18:34,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:18:34,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12085 states and 19155 transitions. [2019-11-28 21:18:34,365 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2019-11-28 21:18:34,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12085 states to 12085 states and 19155 transitions. [2019-11-28 21:18:34,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4860 [2019-11-28 21:18:34,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4860 [2019-11-28 21:18:34,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12085 states and 19155 transitions. [2019-11-28 21:18:34,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:18:34,447 INFO L688 BuchiCegarLoop]: Abstraction has 12085 states and 19155 transitions. [2019-11-28 21:18:34,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12085 states and 19155 transitions. [2019-11-28 21:18:34,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12085 to 12085. [2019-11-28 21:18:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12085 states. [2019-11-28 21:18:34,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12085 states to 12085 states and 19155 transitions. [2019-11-28 21:18:34,635 INFO L711 BuchiCegarLoop]: Abstraction has 12085 states and 19155 transitions. [2019-11-28 21:18:34,635 INFO L591 BuchiCegarLoop]: Abstraction has 12085 states and 19155 transitions. [2019-11-28 21:18:34,635 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 21:18:34,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12085 states and 19155 transitions. [2019-11-28 21:18:34,678 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2019-11-28 21:18:34,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:18:34,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:18:34,679 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:34,679 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:34,680 INFO L794 eck$LassoCheckResult]: Stem: 59828#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 59630#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 59583#L398 assume !(1 == ~c_req_up~0); 59585#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 59590#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 59591#L414-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 59916#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 59805#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 59806#L429-1 assume !(0 == ~e_f~0); 59911#L434-1 assume !(0 == ~e_g~0); 59912#L439-1 assume !(0 == ~e_e~0); 59908#L444-1 assume !(0 == ~e_c~0); 59909#L449-1 assume !(0 == ~e_wl~0); 59835#L454-1 assume !(1 == ~wl_pc~0); 59836#L466 assume !(2 == ~wl_pc~0); 59873#L467 assume !(1 == ~c1_pc~0); 59872#L477 assume !(1 == ~c2_pc~0); 59894#L486 assume !(1 == ~wb_pc~0); 59893#L495 assume !(1 == ~e_c~0); 59797#L504-1 assume !(1 == ~e_e~0); 59798#L509-1 assume !(1 == ~e_f~0); 59868#L514-1 assume !(1 == ~e_g~0); 59869#L519-1 assume !(1 == ~e_c~0); 63968#L524-1 assume !(1 == ~e_wl~0); 63963#L666-1 assume !false; 63964#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 67491#L371 [2019-11-28 21:18:34,680 INFO L796 eck$LassoCheckResult]: Loop: 67491#L371 assume !false; 67695#L289 assume 0 == ~wl_st~0; 67682#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 67675#L315 assume !(0 != eval_~tmp~0); 67689#L311 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 67708#L330 assume !(0 != eval_~tmp___0~0); 67706#L326 assume !(0 == ~c2_st~0); 67703#L341 assume !(0 == ~wb_st~0); 67700#L356 assume !(0 == ~r_st~0); 67491#L371 [2019-11-28 21:18:34,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:34,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2019-11-28 21:18:34,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:34,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572223528] [2019-11-28 21:18:34,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:34,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572223528] [2019-11-28 21:18:34,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:34,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:18:34,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089044166] [2019-11-28 21:18:34,695 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:18:34,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:34,695 INFO L82 PathProgramCache]: Analyzing trace with hash 998807808, now seen corresponding path program 2 times [2019-11-28 21:18:34,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:34,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471724687] [2019-11-28 21:18:34,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:34,701 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:18:34,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:18:34,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:18:34,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:18:34,741 INFO L87 Difference]: Start difference. First operand 12085 states and 19155 transitions. cyclomatic complexity: 7106 Second operand 3 states. [2019-11-28 21:18:34,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:18:34,789 INFO L93 Difference]: Finished difference Result 12033 states and 19068 transitions. [2019-11-28 21:18:34,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:18:34,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12033 states and 19068 transitions. [2019-11-28 21:18:34,859 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2019-11-28 21:18:34,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12033 states to 12033 states and 19068 transitions. [2019-11-28 21:18:34,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4810 [2019-11-28 21:18:34,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4810 [2019-11-28 21:18:34,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12033 states and 19068 transitions. [2019-11-28 21:18:34,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:18:34,916 INFO L688 BuchiCegarLoop]: Abstraction has 12033 states and 19068 transitions. [2019-11-28 21:18:34,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12033 states and 19068 transitions. [2019-11-28 21:18:35,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12033 to 12033. [2019-11-28 21:18:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12033 states. [2019-11-28 21:18:35,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12033 states to 12033 states and 19068 transitions. [2019-11-28 21:18:35,091 INFO L711 BuchiCegarLoop]: Abstraction has 12033 states and 19068 transitions. [2019-11-28 21:18:35,091 INFO L591 BuchiCegarLoop]: Abstraction has 12033 states and 19068 transitions. [2019-11-28 21:18:35,092 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-28 21:18:35,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12033 states and 19068 transitions. [2019-11-28 21:18:35,131 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2019-11-28 21:18:35,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:18:35,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:18:35,132 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:35,132 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:35,132 INFO L794 eck$LassoCheckResult]: Stem: 83946#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 83750#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 83707#L398 assume !(1 == ~c_req_up~0); 83709#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 83714#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 83715#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 83877#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 83878#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 83924#L429-1 assume !(0 == ~e_f~0); 84009#L434-1 assume !(0 == ~e_g~0); 83802#L439-1 assume !(0 == ~e_e~0); 83803#L444-1 assume !(0 == ~e_c~0); 84008#L449-1 assume !(0 == ~e_wl~0); 83954#L454-1 assume !(1 == ~wl_pc~0); 83864#L466 assume !(2 == ~wl_pc~0); 83865#L467 assume !(1 == ~c1_pc~0); 83984#L477 assume !(1 == ~c2_pc~0); 84001#L486 assume !(1 == ~wb_pc~0); 83978#L495 assume !(1 == ~e_c~0); 83915#L504-1 assume !(1 == ~e_e~0); 83916#L509-1 assume !(1 == ~e_f~0); 83982#L514-1 assume !(1 == ~e_g~0); 83775#L519-1 assume !(1 == ~e_c~0); 83776#L524-1 assume !(1 == ~e_wl~0); 83851#L666-1 assume !false; 86384#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 91989#L371 [2019-11-28 21:18:35,132 INFO L796 eck$LassoCheckResult]: Loop: 91989#L371 assume !false; 91753#L289 assume 0 == ~wl_st~0; 91748#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 91686#L315 assume !(0 != eval_~tmp~0); 91590#L311 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 91588#L330 assume !(0 != eval_~tmp___0~0); 91586#L326 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 91571#L345 assume !(0 != eval_~tmp___1~0); 91581#L341 assume !(0 == ~wb_st~0); 91992#L356 assume !(0 == ~r_st~0); 91989#L371 [2019-11-28 21:18:35,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:35,133 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2019-11-28 21:18:35,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:35,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436253848] [2019-11-28 21:18:35,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:35,145 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:18:35,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:35,146 INFO L82 PathProgramCache]: Analyzing trace with hash 896651005, now seen corresponding path program 1 times [2019-11-28 21:18:35,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:35,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217621834] [2019-11-28 21:18:35,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:35,152 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:18:35,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:35,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1750331659, now seen corresponding path program 1 times [2019-11-28 21:18:35,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:35,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639995792] [2019-11-28 21:18:35,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:18:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:18:35,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639995792] [2019-11-28 21:18:35,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:18:35,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:18:35,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865560931] [2019-11-28 21:18:35,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:18:35,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:18:35,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:18:35,217 INFO L87 Difference]: Start difference. First operand 12033 states and 19068 transitions. cyclomatic complexity: 7071 Second operand 3 states. [2019-11-28 21:18:35,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:18:35,298 INFO L93 Difference]: Finished difference Result 18669 states and 29460 transitions. [2019-11-28 21:18:35,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:18:35,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18669 states and 29460 transitions. [2019-11-28 21:18:35,379 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 7424 [2019-11-28 21:18:35,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18669 states to 18669 states and 29460 transitions. [2019-11-28 21:18:35,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7496 [2019-11-28 21:18:35,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7496 [2019-11-28 21:18:35,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18669 states and 29460 transitions. [2019-11-28 21:18:35,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:18:35,483 INFO L688 BuchiCegarLoop]: Abstraction has 18669 states and 29460 transitions. [2019-11-28 21:18:35,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18669 states and 29460 transitions. [2019-11-28 21:18:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18669 to 18549. [2019-11-28 21:18:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18549 states. [2019-11-28 21:18:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18549 states to 18549 states and 29340 transitions. [2019-11-28 21:18:35,856 INFO L711 BuchiCegarLoop]: Abstraction has 18549 states and 29340 transitions. [2019-11-28 21:18:35,856 INFO L591 BuchiCegarLoop]: Abstraction has 18549 states and 29340 transitions. [2019-11-28 21:18:35,856 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-28 21:18:35,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18549 states and 29340 transitions. [2019-11-28 21:18:35,909 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 7376 [2019-11-28 21:18:35,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:18:35,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:18:35,910 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:35,910 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:18:35,910 INFO L794 eck$LassoCheckResult]: Stem: 114662#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 114464#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 114417#L398 assume !(1 == ~c_req_up~0); 114419#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 114424#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 114425#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 114584#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 114585#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 114635#L429-1 assume !(0 == ~e_f~0); 114737#L434-1 assume !(0 == ~e_g~0); 114508#L439-1 assume !(0 == ~e_e~0); 114509#L444-1 assume !(0 == ~e_c~0); 114736#L449-1 assume !(0 == ~e_wl~0); 114671#L454-1 assume !(1 == ~wl_pc~0); 114571#L466 assume !(2 == ~wl_pc~0); 114572#L467 assume !(1 == ~c1_pc~0); 114710#L477 assume !(1 == ~c2_pc~0); 114729#L486 assume !(1 == ~wb_pc~0); 114703#L495 assume !(1 == ~e_c~0); 114627#L504-1 assume !(1 == ~e_e~0); 114628#L509-1 assume !(1 == ~e_f~0); 114706#L514-1 assume !(1 == ~e_g~0); 114482#L519-1 assume !(1 == ~e_c~0); 114483#L524-1 assume !(1 == ~e_wl~0); 114558#L666-1 assume !false; 120203#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 127280#L371 [2019-11-28 21:18:35,910 INFO L796 eck$LassoCheckResult]: Loop: 127280#L371 assume !false; 126072#L289 assume 0 == ~wl_st~0; 126071#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 126063#L315 assume !(0 != eval_~tmp~0); 126070#L311 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 126221#L330 assume !(0 != eval_~tmp___0~0); 126219#L326 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 126206#L345 assume !(0 != eval_~tmp___1~0); 126215#L341 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 127228#L360 assume !(0 != eval_~tmp___2~0); 127238#L356 assume !(0 == ~r_st~0); 127280#L371 [2019-11-28 21:18:35,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:35,911 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 5 times [2019-11-28 21:18:35,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:35,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180943680] [2019-11-28 21:18:35,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:35,923 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:18:35,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:35,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2026342965, now seen corresponding path program 1 times [2019-11-28 21:18:35,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:35,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638375207] [2019-11-28 21:18:35,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:35,929 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:18:35,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:18:35,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1574259005, now seen corresponding path program 1 times [2019-11-28 21:18:35,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:18:35,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407888331] [2019-11-28 21:18:35,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:18:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:18:35,944 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:18:36,427 WARN L192 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 110 [2019-11-28 21:18:36,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:18:36 BoogieIcfgContainer [2019-11-28 21:18:36,542 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:18:36,543 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:18:36,543 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:18:36,543 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:18:36,543 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:18:26" (3/4) ... [2019-11-28 21:18:36,546 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 21:18:36,609 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 21:18:36,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:18:36,611 INFO L168 Benchmark]: Toolchain (without parser) took 11561.66 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 423.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 247.2 MB. Max. memory is 11.5 GB. [2019-11-28 21:18:36,611 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:18:36,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 470.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-28 21:18:36,612 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:18:36,612 INFO L168 Benchmark]: Boogie Preprocessor took 36.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 21:18:36,613 INFO L168 Benchmark]: RCFGBuilder took 750.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2019-11-28 21:18:36,613 INFO L168 Benchmark]: BuchiAutomizer took 10174.60 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 302.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -83.9 MB). Peak memory consumption was 218.1 MB. Max. memory is 11.5 GB. [2019-11-28 21:18:36,614 INFO L168 Benchmark]: Witness Printer took 66.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2019-11-28 21:18:36,616 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 470.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 750.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10174.60 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 302.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -83.9 MB). Peak memory consumption was 218.1 MB. Max. memory is 11.5 GB. * Witness Printer took 66.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (14 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -2 * e_e + 3 and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 18549 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.0s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 5.8s. Construction of modules took 0.4s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 12. Automata minimization 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 1274 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.8s Buchi closure took 0.0s. Biggest automaton had 18549 states and ocurred in iteration 14. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 4151 SDtfs, 4004 SDslu, 2207 SDs, 0 SdLazy, 345 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT0 SILN1 SILU0 SILI5 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq182 hnf98 smp100 dnf190 smp75 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 41ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 288]: 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 {p_out=0, wb_st=0, processed=0, \result=0, c2_st=0, wl_pc=0, e_wl=2, tmp=0, e_c=2, e_e=2, kernel_st=1, e_p_in=0, tmp___1=0, t_b=0, tmp___2=0, p_in=0, wb_pc=0, data=0, tmp___0=0, wb_i=1, c_req_up=0, tmp___3=0, c_t=0, wl_i=1, c1_st=0, c=0, wl_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8f7fe6b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66da9b82=0, c1_i=1, c2_pc=0, c2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6750cdab=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55645a0e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76708f29=0, r_i=0, d=0, e_f=2, e_g=2, r_st=2, __retres1=0, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 288]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L18] int c ; [L19] int c_t ; [L20] int c_req_up ; [L21] int p_in ; [L22] int p_out ; [L23] int wl_st ; [L24] int c1_st ; [L25] int c2_st ; [L26] int wb_st ; [L27] int r_st ; [L28] int wl_i ; [L29] int c1_i ; [L30] int c2_i ; [L31] int wb_i ; [L32] int r_i ; [L33] int wl_pc ; [L34] int c1_pc ; [L35] int c2_pc ; [L36] int wb_pc ; [L37] int e_e ; [L38] int e_f ; [L39] int e_g ; [L40] int e_c ; [L41] int e_p_in ; [L42] int e_wl ; [L48] int d ; [L49] int data ; [L50] int processed ; [L51] static int t_b ; [L683] int __retres1 ; [L687] e_wl = 2 [L688] e_c = e_wl [L689] e_g = e_c [L690] e_f = e_g [L691] e_e = e_f [L692] wl_pc = 0 [L693] c1_pc = 0 [L694] c2_pc = 0 [L695] wb_pc = 0 [L696] wb_i = 1 [L697] c2_i = wb_i [L698] c1_i = c2_i [L699] wl_i = c1_i [L700] r_i = 0 [L701] c_req_up = 0 [L702] d = 0 [L703] c = 0 [L394] int kernel_st ; [L397] kernel_st = 0 [L398] COND FALSE !((int )c_req_up == 1) [L409] COND TRUE (int )wl_i == 1 [L410] wl_st = 0 [L414] COND TRUE (int )c1_i == 1 [L415] c1_st = 0 [L419] COND TRUE (int )c2_i == 1 [L420] c2_st = 0 [L424] COND TRUE (int )wb_i == 1 [L425] wb_st = 0 [L429] COND FALSE !((int )r_i == 1) [L432] r_st = 2 [L434] COND FALSE !((int )e_f == 0) [L439] COND FALSE !((int )e_g == 0) [L444] COND FALSE !((int )e_e == 0) [L449] COND FALSE !((int )e_c == 0) [L454] COND FALSE !((int )e_wl == 0) [L459] COND FALSE !((int )wl_pc == 1) [L467] COND FALSE !((int )wl_pc == 2) [L477] COND FALSE !((int )c1_pc == 1) [L486] COND FALSE !((int )c2_pc == 1) [L495] COND FALSE !((int )wb_pc == 1) [L504] COND FALSE !((int )e_c == 1) [L509] COND FALSE !((int )e_e == 1) [L514] COND FALSE !((int )e_f == 1) [L519] COND FALSE !((int )e_g == 1) [L524] COND FALSE !((int )e_c == 1) [L529] COND FALSE !((int )e_wl == 1) [L535] COND TRUE 1 [L538] kernel_st = 1 [L280] int tmp ; [L281] int tmp___0 ; [L282] int tmp___1 ; [L283] int tmp___2 ; [L284] int tmp___3 ; Loop: [L288] COND TRUE 1 [L290] COND TRUE (int )wl_st == 0 [L311] COND TRUE (int )wl_st == 0 [L313] tmp = __VERIFIER_nondet_int() [L315] COND FALSE !(\read(tmp)) [L326] COND TRUE (int )c1_st == 0 [L328] tmp___0 = __VERIFIER_nondet_int() [L330] COND FALSE !(\read(tmp___0)) [L341] COND TRUE (int )c2_st == 0 [L343] tmp___1 = __VERIFIER_nondet_int() [L345] COND FALSE !(\read(tmp___1)) [L356] COND TRUE (int )wb_st == 0 [L358] tmp___2 = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp___2)) [L371] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...