./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/systemc/toy_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/systemc/toy_true-unreach-call_false-termination.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.24-91b1670 [2018-11-29 00:06:27,605 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:06:27,607 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:06:27,630 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:06:27,631 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:06:27,632 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:06:27,634 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:06:27,637 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:06:27,640 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:06:27,646 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:06:27,650 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:06:27,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:06:27,653 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:06:27,655 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:06:27,656 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:06:27,660 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:06:27,661 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:06:27,667 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:06:27,668 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:06:27,670 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:06:27,672 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:06:27,675 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:06:27,679 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:06:27,680 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:06:27,680 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:06:27,681 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:06:27,683 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:06:27,685 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:06:27,687 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:06:27,690 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:06:27,691 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:06:27,692 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:06:27,692 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:06:27,692 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:06:27,694 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:06:27,695 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:06:27,695 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:06:27,712 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:06:27,712 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:06:27,713 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:06:27,714 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:06:27,714 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:06:27,714 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:06:27,714 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:06:27,714 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:06:27,714 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:06:27,715 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:06:27,716 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:06:27,716 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:06:27,716 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:06:27,717 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:06:27,717 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:06:27,717 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:06:27,717 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:06:27,717 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:06:27,717 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:06:27,718 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:06:27,718 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:06:27,719 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:06:27,719 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:06:27,719 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:06:27,719 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:06:27,719 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:06:27,719 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:06:27,720 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:06:27,721 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:06:27,721 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:06:27,721 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:06:27,722 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:06:27,722 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2cf465b3c46ffeaae0c4558b2b00688c0a746a8 [2018-11-29 00:06:27,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:06:27,780 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:06:27,787 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:06:27,790 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:06:27,790 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:06:27,791 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/toy_true-unreach-call_false-termination.cil.c [2018-11-29 00:06:27,856 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/711bb968c/242de0b49b894f1d9b4c4bfcbc3bb6f2/FLAG2386cf697 [2018-11-29 00:06:28,404 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:06:28,404 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/toy_true-unreach-call_false-termination.cil.c [2018-11-29 00:06:28,415 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/711bb968c/242de0b49b894f1d9b4c4bfcbc3bb6f2/FLAG2386cf697 [2018-11-29 00:06:28,717 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/711bb968c/242de0b49b894f1d9b4c4bfcbc3bb6f2 [2018-11-29 00:06:28,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:06:28,723 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:06:28,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:06:28,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:06:28,729 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:06:28,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:06:28" (1/1) ... [2018-11-29 00:06:28,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef72e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:06:28, skipping insertion in model container [2018-11-29 00:06:28,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:06:28" (1/1) ... [2018-11-29 00:06:28,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:06:28,804 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:06:29,141 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:06:29,149 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:06:29,241 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:06:29,265 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:06:29,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:06:29 WrapperNode [2018-11-29 00:06:29,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:06:29,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:06:29,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:06:29,267 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:06:29,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:06:29" (1/1) ... [2018-11-29 00:06:29,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:06:29" (1/1) ... [2018-11-29 00:06:29,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:06:29,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:06:29,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:06:29,330 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:06:29,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:06:29" (1/1) ... [2018-11-29 00:06:29,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:06:29" (1/1) ... [2018-11-29 00:06:29,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:06:29" (1/1) ... [2018-11-29 00:06:29,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:06:29" (1/1) ... [2018-11-29 00:06:29,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:06:29" (1/1) ... [2018-11-29 00:06:29,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:06:29" (1/1) ... [2018-11-29 00:06:29,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:06:29" (1/1) ... [2018-11-29 00:06:29,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:06:29,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:06:29,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:06:29,441 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:06:29,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:06:29" (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 [2018-11-29 00:06:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:06:29,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:06:30,755 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:06:30,755 INFO L280 CfgBuilder]: Removed 26 assue(true) statements. [2018-11-29 00:06:30,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:06:30 BoogieIcfgContainer [2018-11-29 00:06:30,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:06:30,757 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:06:30,757 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:06:30,762 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:06:30,763 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:06:30,763 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:06:28" (1/3) ... [2018-11-29 00:06:30,765 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67b7e2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:06:30, skipping insertion in model container [2018-11-29 00:06:30,765 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:06:30,765 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:06:29" (2/3) ... [2018-11-29 00:06:30,766 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67b7e2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:06:30, skipping insertion in model container [2018-11-29 00:06:30,766 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:06:30,766 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:06:30" (3/3) ... [2018-11-29 00:06:30,769 INFO L375 chiAutomizerObserver]: Analyzing ICFG toy_true-unreach-call_false-termination.cil.c [2018-11-29 00:06:30,828 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:06:30,829 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:06:30,830 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:06:30,830 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:06:30,830 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:06:30,830 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:06:30,831 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:06:30,831 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:06:30,831 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:06:30,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2018-11-29 00:06:30,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2018-11-29 00:06:30,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:06:30,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:06:30,901 INFO L866 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] [2018-11-29 00:06:30,901 INFO L867 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] [2018-11-29 00:06:30,901 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:06:30,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2018-11-29 00:06:30,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2018-11-29 00:06:30,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:06:30,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:06:30,913 INFO L866 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] [2018-11-29 00:06:30,913 INFO L867 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] [2018-11-29 00:06:30,924 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 [2018-11-29 00:06:30,924 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 [2018-11-29 00:06:30,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:30,932 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2018-11-29 00:06:30,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:30,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:30,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:30,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:30,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:31,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:31,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:06:31,164 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:06:31,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:31,165 INFO L82 PathProgramCache]: Analyzing trace with hash 359392569, now seen corresponding path program 1 times [2018-11-29 00:06:31,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:31,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:31,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:31,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:31,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:31,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:31,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:31,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:06:31,180 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:06:31,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-29 00:06:31,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-29 00:06:31,203 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 2 states. [2018-11-29 00:06:31,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:06:31,224 INFO L93 Difference]: Finished difference Result 125 states and 219 transitions. [2018-11-29 00:06:31,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:06:31,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 219 transitions. [2018-11-29 00:06:31,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-11-29 00:06:31,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 120 states and 214 transitions. [2018-11-29 00:06:31,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2018-11-29 00:06:31,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2018-11-29 00:06:31,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 214 transitions. [2018-11-29 00:06:31,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:06:31,266 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 214 transitions. [2018-11-29 00:06:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 214 transitions. [2018-11-29 00:06:31,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-29 00:06:31,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-29 00:06:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 214 transitions. [2018-11-29 00:06:31,310 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 214 transitions. [2018-11-29 00:06:31,311 INFO L608 BuchiCegarLoop]: Abstraction has 120 states and 214 transitions. [2018-11-29 00:06:31,311 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:06:31,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 214 transitions. [2018-11-29 00:06:31,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-11-29 00:06:31,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:06:31,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:06:31,316 INFO L866 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] [2018-11-29 00:06:31,317 INFO L867 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] [2018-11-29 00:06:31,317 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 [2018-11-29 00:06:31,317 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 [2018-11-29 00:06:31,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:31,318 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2018-11-29 00:06:31,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:31,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:31,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:31,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:31,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:31,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:31,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:06:31,387 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:06:31,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:31,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1806372813, now seen corresponding path program 1 times [2018-11-29 00:06:31,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:31,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:31,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:31,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:06:31,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:31,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:31,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:06:31,446 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:06:31,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:06:31,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:06:31,447 INFO L87 Difference]: Start difference. First operand 120 states and 214 transitions. cyclomatic complexity: 95 Second operand 3 states. [2018-11-29 00:06:31,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:06:31,493 INFO L93 Difference]: Finished difference Result 120 states and 213 transitions. [2018-11-29 00:06:31,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:06:31,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 213 transitions. [2018-11-29 00:06:31,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-11-29 00:06:31,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 213 transitions. [2018-11-29 00:06:31,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2018-11-29 00:06:31,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2018-11-29 00:06:31,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 213 transitions. [2018-11-29 00:06:31,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:06:31,502 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 213 transitions. [2018-11-29 00:06:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 213 transitions. [2018-11-29 00:06:31,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-29 00:06:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-29 00:06:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 213 transitions. [2018-11-29 00:06:31,512 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 213 transitions. [2018-11-29 00:06:31,512 INFO L608 BuchiCegarLoop]: Abstraction has 120 states and 213 transitions. [2018-11-29 00:06:31,513 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:06:31,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 213 transitions. [2018-11-29 00:06:31,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-11-29 00:06:31,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:06:31,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:06:31,517 INFO L866 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] [2018-11-29 00:06:31,517 INFO L867 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] [2018-11-29 00:06:31,517 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 [2018-11-29 00:06:31,518 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 [2018-11-29 00:06:31,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:31,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2018-11-29 00:06:31,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:31,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:31,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:31,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:31,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:31,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:31,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:06:31,567 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:06:31,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:31,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1806372813, now seen corresponding path program 2 times [2018-11-29 00:06:31,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:31,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:31,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:31,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:31,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:31,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:31,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:06:31,651 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:06:31,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:06:31,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:06:31,651 INFO L87 Difference]: Start difference. First operand 120 states and 213 transitions. cyclomatic complexity: 94 Second operand 3 states. [2018-11-29 00:06:31,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:06:31,679 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2018-11-29 00:06:31,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:06:31,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 212 transitions. [2018-11-29 00:06:31,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-11-29 00:06:31,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 212 transitions. [2018-11-29 00:06:31,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2018-11-29 00:06:31,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2018-11-29 00:06:31,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 212 transitions. [2018-11-29 00:06:31,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:06:31,688 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 212 transitions. [2018-11-29 00:06:31,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 212 transitions. [2018-11-29 00:06:31,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-29 00:06:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-29 00:06:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 212 transitions. [2018-11-29 00:06:31,699 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 212 transitions. [2018-11-29 00:06:31,699 INFO L608 BuchiCegarLoop]: Abstraction has 120 states and 212 transitions. [2018-11-29 00:06:31,699 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:06:31,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 212 transitions. [2018-11-29 00:06:31,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-11-29 00:06:31,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:06:31,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:06:31,706 INFO L866 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] [2018-11-29 00:06:31,708 INFO L867 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] [2018-11-29 00:06:31,709 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 [2018-11-29 00:06:31,709 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 [2018-11-29 00:06:31,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:31,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2018-11-29 00:06:31,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:31,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:31,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:31,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:06:31,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:31,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:31,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:31,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:06:31,791 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:06:31,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:31,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1257113092, now seen corresponding path program 1 times [2018-11-29 00:06:31,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:31,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:31,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:31,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:31,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:31,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:31,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:31,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:06:31,880 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:06:31,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:06:31,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:06:31,881 INFO L87 Difference]: Start difference. First operand 120 states and 212 transitions. cyclomatic complexity: 93 Second operand 3 states. [2018-11-29 00:06:31,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:06:31,913 INFO L93 Difference]: Finished difference Result 120 states and 211 transitions. [2018-11-29 00:06:31,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:06:31,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 211 transitions. [2018-11-29 00:06:31,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-11-29 00:06:31,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 211 transitions. [2018-11-29 00:06:31,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2018-11-29 00:06:31,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2018-11-29 00:06:31,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 211 transitions. [2018-11-29 00:06:31,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:06:31,923 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 211 transitions. [2018-11-29 00:06:31,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 211 transitions. [2018-11-29 00:06:31,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-29 00:06:31,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-29 00:06:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 211 transitions. [2018-11-29 00:06:31,930 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 211 transitions. [2018-11-29 00:06:31,931 INFO L608 BuchiCegarLoop]: Abstraction has 120 states and 211 transitions. [2018-11-29 00:06:31,931 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:06:31,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 211 transitions. [2018-11-29 00:06:31,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-11-29 00:06:31,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:06:31,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:06:31,934 INFO L866 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] [2018-11-29 00:06:31,934 INFO L867 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] [2018-11-29 00:06:31,934 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 [2018-11-29 00:06:31,934 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 [2018-11-29 00:06:31,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:31,935 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2018-11-29 00:06:31,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:31,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:31,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:31,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:31,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:32,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:32,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1806372813, now seen corresponding path program 3 times [2018-11-29 00:06:32,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:32,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:32,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:32,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:32,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:32,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:32,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:06:32,082 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:06:32,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:06:32,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:06:32,082 INFO L87 Difference]: Start difference. First operand 120 states and 211 transitions. cyclomatic complexity: 92 Second operand 3 states. [2018-11-29 00:06:32,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:06:32,154 INFO L93 Difference]: Finished difference Result 154 states and 273 transitions. [2018-11-29 00:06:32,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:06:32,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 273 transitions. [2018-11-29 00:06:32,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2018-11-29 00:06:32,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 273 transitions. [2018-11-29 00:06:32,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2018-11-29 00:06:32,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-11-29 00:06:32,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 273 transitions. [2018-11-29 00:06:32,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:06:32,165 INFO L705 BuchiCegarLoop]: Abstraction has 154 states and 273 transitions. [2018-11-29 00:06:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 273 transitions. [2018-11-29 00:06:32,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-11-29 00:06:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-29 00:06:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 273 transitions. [2018-11-29 00:06:32,176 INFO L728 BuchiCegarLoop]: Abstraction has 154 states and 273 transitions. [2018-11-29 00:06:32,176 INFO L608 BuchiCegarLoop]: Abstraction has 154 states and 273 transitions. [2018-11-29 00:06:32,176 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:06:32,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 273 transitions. [2018-11-29 00:06:32,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2018-11-29 00:06:32,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:06:32,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:06:32,181 INFO L866 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] [2018-11-29 00:06:32,181 INFO L867 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] [2018-11-29 00:06:32,181 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 [2018-11-29 00:06:32,181 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 [2018-11-29 00:06:32,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:32,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1535466835, now seen corresponding path program 1 times [2018-11-29 00:06:32,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:32,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:32,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:32,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:06:32,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:32,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:32,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-29 00:06:32,271 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:06:32,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:32,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1806432395, now seen corresponding path program 1 times [2018-11-29 00:06:32,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:32,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:32,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:32,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:32,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:32,928 WARN L180 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-11-29 00:06:33,045 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-29 00:06:33,058 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:06:33,059 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:06:33,059 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:06:33,059 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:06:33,060 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:06:33,060 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:06:33,060 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:06:33,060 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:06:33,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy_true-unreach-call_false-termination.cil.c_Iteration6_Loop [2018-11-29 00:06:33,060 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:06:33,061 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:06:33,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,732 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:06:33,733 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:06:33,749 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:06:33,750 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:06:33,776 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:06:33,776 INFO L448 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) [2018-11-29 00:06:33,812 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:06:33,812 INFO L163 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) [2018-11-29 00:06:33,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:06:33,859 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:06:33,876 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:06:33,911 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:06:33,912 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:06:33,912 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:06:33,912 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:06:33,912 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:06:33,912 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:06:33,912 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:06:33,913 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:06:33,915 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy_true-unreach-call_false-termination.cil.c_Iteration6_Loop [2018-11-29 00:06:33,915 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:06:33,915 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:06:33,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:33,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:34,987 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-29 00:06:35,205 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:06:35,212 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:06:35,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:06:35,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:06:35,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:06:35,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:06:35,219 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:06:35,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:06:35,221 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:06:35,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:06:35,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:06:35,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:06:35,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:06:35,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:06:35,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:06:35,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:06:35,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:06:35,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:06:35,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:06:35,232 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:06:35,235 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:06:35,235 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:06:35,237 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:06:35,238 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:06:35,238 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:06:35,238 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2018-11-29 00:06:35,240 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:06:35,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:35,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:06:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:35,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:06:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:35,533 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 [2018-11-29 00:06:35,551 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 154 states and 273 transitions. cyclomatic complexity: 120 Second operand 5 states. [2018-11-29 00:06:35,707 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. [2018-11-29 00:06:35,715 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 [2018-11-29 00:06:35,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:06:35,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2018-11-29 00:06:35,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 24 letters. Loop has 28 letters. [2018-11-29 00:06:35,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:06:35,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 52 letters. Loop has 28 letters. [2018-11-29 00:06:35,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:06:35,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 24 letters. Loop has 56 letters. [2018-11-29 00:06:35,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:06:35,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 480 states and 845 transitions. [2018-11-29 00:06:35,740 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 318 [2018-11-29 00:06:35,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 480 states to 480 states and 845 transitions. [2018-11-29 00:06:35,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2018-11-29 00:06:35,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 371 [2018-11-29 00:06:35,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 480 states and 845 transitions. [2018-11-29 00:06:35,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:06:35,750 INFO L705 BuchiCegarLoop]: Abstraction has 480 states and 845 transitions. [2018-11-29 00:06:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states and 845 transitions. [2018-11-29 00:06:35,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 370. [2018-11-29 00:06:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-29 00:06:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 653 transitions. [2018-11-29 00:06:35,785 INFO L728 BuchiCegarLoop]: Abstraction has 370 states and 653 transitions. [2018-11-29 00:06:35,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:06:35,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:06:35,785 INFO L87 Difference]: Start difference. First operand 370 states and 653 transitions. Second operand 4 states. [2018-11-29 00:06:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:06:36,130 INFO L93 Difference]: Finished difference Result 570 states and 982 transitions. [2018-11-29 00:06:36,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:06:36,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 570 states and 982 transitions. [2018-11-29 00:06:36,140 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 332 [2018-11-29 00:06:36,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 570 states to 570 states and 982 transitions. [2018-11-29 00:06:36,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 391 [2018-11-29 00:06:36,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 391 [2018-11-29 00:06:36,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 570 states and 982 transitions. [2018-11-29 00:06:36,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:06:36,151 INFO L705 BuchiCegarLoop]: Abstraction has 570 states and 982 transitions. [2018-11-29 00:06:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states and 982 transitions. [2018-11-29 00:06:36,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 542. [2018-11-29 00:06:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-11-29 00:06:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 942 transitions. [2018-11-29 00:06:36,171 INFO L728 BuchiCegarLoop]: Abstraction has 542 states and 942 transitions. [2018-11-29 00:06:36,171 INFO L608 BuchiCegarLoop]: Abstraction has 542 states and 942 transitions. [2018-11-29 00:06:36,171 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:06:36,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 542 states and 942 transitions. [2018-11-29 00:06:36,176 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 332 [2018-11-29 00:06:36,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:06:36,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:06:36,179 INFO L866 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] [2018-11-29 00:06:36,186 INFO L867 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] [2018-11-29 00:06:36,186 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 [2018-11-29 00:06:36,186 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 [2018-11-29 00:06:36,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:36,187 INFO L82 PathProgramCache]: Analyzing trace with hash 255545495, now seen corresponding path program 1 times [2018-11-29 00:06:36,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:36,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:36,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:36,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:36,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:36,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:36,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-29 00:06:36,249 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:06:36,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:36,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2016785850, now seen corresponding path program 1 times [2018-11-29 00:06:36,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:36,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:36,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:36,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:36,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:36,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:36,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:06:36,332 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:06:36,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:06:36,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:06:36,332 INFO L87 Difference]: Start difference. First operand 542 states and 942 transitions. cyclomatic complexity: 406 Second operand 4 states. [2018-11-29 00:06:36,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:06:36,791 INFO L93 Difference]: Finished difference Result 1129 states and 1896 transitions. [2018-11-29 00:06:36,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:06:36,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1129 states and 1896 transitions. [2018-11-29 00:06:36,803 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 690 [2018-11-29 00:06:36,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1129 states to 1129 states and 1896 transitions. [2018-11-29 00:06:36,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 774 [2018-11-29 00:06:36,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 774 [2018-11-29 00:06:36,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1129 states and 1896 transitions. [2018-11-29 00:06:36,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:06:36,815 INFO L705 BuchiCegarLoop]: Abstraction has 1129 states and 1896 transitions. [2018-11-29 00:06:36,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states and 1896 transitions. [2018-11-29 00:06:36,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1111. [2018-11-29 00:06:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-11-29 00:06:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1875 transitions. [2018-11-29 00:06:36,841 INFO L728 BuchiCegarLoop]: Abstraction has 1111 states and 1875 transitions. [2018-11-29 00:06:36,841 INFO L608 BuchiCegarLoop]: Abstraction has 1111 states and 1875 transitions. [2018-11-29 00:06:36,841 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:06:36,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1111 states and 1875 transitions. [2018-11-29 00:06:36,847 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 688 [2018-11-29 00:06:36,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:06:36,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:06:36,848 INFO L866 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] [2018-11-29 00:06:36,848 INFO L867 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] [2018-11-29 00:06:36,849 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 [2018-11-29 00:06:36,849 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 [2018-11-29 00:06:36,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:36,849 INFO L82 PathProgramCache]: Analyzing trace with hash 842409169, now seen corresponding path program 1 times [2018-11-29 00:06:36,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:36,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:36,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:36,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:36,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:36,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:36,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-29 00:06:36,935 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:06:36,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:36,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1467526129, now seen corresponding path program 1 times [2018-11-29 00:06:36,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:36,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:36,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:36,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:36,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:37,277 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2018-11-29 00:06:37,333 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:06:37,334 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:06:37,334 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:06:37,334 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:06:37,334 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:06:37,334 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:06:37,334 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:06:37,335 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:06:37,335 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy_true-unreach-call_false-termination.cil.c_Iteration8_Loop [2018-11-29 00:06:37,335 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:06:37,335 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:06:37,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,757 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:06:37,757 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2018-11-29 00:06:37,765 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:06:37,766 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:06:37,769 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:06:37,770 INFO L448 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 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 [2018-11-29 00:06:37,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:06:37,792 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:06:37,794 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:06:37,794 INFO L448 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:06:37,817 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:06:37,817 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:06:37,822 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:06:37,823 INFO L448 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:06:37,843 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:06:37,843 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:06:37,847 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:06:37,847 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-1} Honda state: {~c1_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:06:37,869 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:06:37,869 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-29 00:06:37,896 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:06:37,896 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:06:37,904 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:06:37,921 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:06:37,922 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:06:37,922 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:06:37,922 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:06:37,922 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:06:37,922 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:06:37,922 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:06:37,922 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:06:37,922 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy_true-unreach-call_false-termination.cil.c_Iteration8_Loop [2018-11-29 00:06:37,922 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:06:37,923 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:06:37,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:37,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:38,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:38,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:38,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:38,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:38,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:38,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:38,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:38,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:38,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:38,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:38,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:38,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:38,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:38,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:38,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:38,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:38,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:38,532 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:06:38,532 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:06:38,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:06:38,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:06:38,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:06:38,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:06:38,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:06:38,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:06:38,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:06:38,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:06:38,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:06:38,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:06:38,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:06:38,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:06:38,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:06:38,538 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:06:38,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:06:38,542 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:06:38,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:06:38,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:06:38,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:06:38,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:06:38,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:06:38,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:06:38,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:06:38,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:06:38,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:06:38,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:06:38,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:06:38,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:06:38,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:06:38,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:06:38,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:06:38,556 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:06:38,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:06:38,557 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:06:38,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:06:38,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:06:38,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:06:38,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:06:38,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:06:38,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:06:38,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:06:38,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:06:38,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:06:38,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:06:38,568 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:06:38,570 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:06:38,571 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:06:38,571 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:06:38,571 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:06:38,571 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:06:38,571 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2018-11-29 00:06:38,574 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:06:38,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:38,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:06:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:38,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:06:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:38,703 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 [2018-11-29 00:06:38,703 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1111 states and 1875 transitions. cyclomatic complexity: 776 Second operand 5 states. [2018-11-29 00:06:38,836 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. [2018-11-29 00:06:38,837 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 [2018-11-29 00:06:38,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:06:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2018-11-29 00:06:38,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 359 transitions. Stem has 24 letters. Loop has 28 letters. [2018-11-29 00:06:38,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:06:38,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 359 transitions. Stem has 52 letters. Loop has 28 letters. [2018-11-29 00:06:38,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:06:38,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 359 transitions. Stem has 24 letters. Loop has 56 letters. [2018-11-29 00:06:38,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:06:38,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1849 states and 3132 transitions. [2018-11-29 00:06:38,859 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1064 [2018-11-29 00:06:38,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1849 states to 1849 states and 3132 transitions. [2018-11-29 00:06:38,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1142 [2018-11-29 00:06:38,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1151 [2018-11-29 00:06:38,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1849 states and 3132 transitions. [2018-11-29 00:06:38,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:06:38,878 INFO L705 BuchiCegarLoop]: Abstraction has 1849 states and 3132 transitions. [2018-11-29 00:06:38,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states and 3132 transitions. [2018-11-29 00:06:38,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 955. [2018-11-29 00:06:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-11-29 00:06:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1615 transitions. [2018-11-29 00:06:38,911 INFO L728 BuchiCegarLoop]: Abstraction has 955 states and 1615 transitions. [2018-11-29 00:06:38,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:06:38,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:06:38,913 INFO L87 Difference]: Start difference. First operand 955 states and 1615 transitions. Second operand 4 states. [2018-11-29 00:06:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:06:39,426 INFO L93 Difference]: Finished difference Result 977 states and 1626 transitions. [2018-11-29 00:06:39,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:06:39,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 977 states and 1626 transitions. [2018-11-29 00:06:39,437 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 547 [2018-11-29 00:06:39,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 977 states to 977 states and 1626 transitions. [2018-11-29 00:06:39,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2018-11-29 00:06:39,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2018-11-29 00:06:39,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 977 states and 1626 transitions. [2018-11-29 00:06:39,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:06:39,447 INFO L705 BuchiCegarLoop]: Abstraction has 977 states and 1626 transitions. [2018-11-29 00:06:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states and 1626 transitions. [2018-11-29 00:06:39,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 894. [2018-11-29 00:06:39,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2018-11-29 00:06:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1493 transitions. [2018-11-29 00:06:39,472 INFO L728 BuchiCegarLoop]: Abstraction has 894 states and 1493 transitions. [2018-11-29 00:06:39,472 INFO L608 BuchiCegarLoop]: Abstraction has 894 states and 1493 transitions. [2018-11-29 00:06:39,472 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-29 00:06:39,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 894 states and 1493 transitions. [2018-11-29 00:06:39,480 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 547 [2018-11-29 00:06:39,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:06:39,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:06:39,481 INFO L866 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] [2018-11-29 00:06:39,481 INFO L867 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] [2018-11-29 00:06:39,482 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 [2018-11-29 00:06:39,482 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 [2018-11-29 00:06:39,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:39,482 INFO L82 PathProgramCache]: Analyzing trace with hash -666236546, now seen corresponding path program 1 times [2018-11-29 00:06:39,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:39,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:39,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:39,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:39,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:39,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:39,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-29 00:06:39,637 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:06:39,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:39,639 INFO L82 PathProgramCache]: Analyzing trace with hash -311766517, now seen corresponding path program 1 times [2018-11-29 00:06:39,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:39,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:39,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:39,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:39,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:40,065 WARN L180 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2018-11-29 00:06:40,137 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:06:40,137 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:06:40,138 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:06:40,138 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:06:40,138 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:06:40,138 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:06:40,138 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:06:40,138 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:06:40,138 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy_true-unreach-call_false-termination.cil.c_Iteration9_Loop [2018-11-29 00:06:40,138 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:06:40,138 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:06:40,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:40,841 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-29 00:06:41,099 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:06:41,099 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:06:41,107 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:06:41,108 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:06:41,116 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:06:41,117 INFO L448 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 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 [2018-11-29 00:06:41,138 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:06:41,139 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:06:41,142 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:06:41,142 INFO L448 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 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 [2018-11-29 00:06:41,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:06:41,163 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:06:41,167 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:06:41,167 INFO L448 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 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 [2018-11-29 00:06:41,188 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:06:41,188 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:06:41,192 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:06:41,192 INFO L448 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:06:41,213 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:06:41,214 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:06:41,217 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:06:41,217 INFO L448 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 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 [2018-11-29 00:06:41,239 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:06:41,239 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:06:41,243 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:06:41,243 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-1} Honda state: {~c1_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:06:41,264 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:06:41,264 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:06:41,273 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:06:41,273 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_g~0=7} Honda state: {~e_g~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2018-11-29 00:06:41,294 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:06:41,294 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:06:41,296 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:06:41,297 INFO L448 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 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 [2018-11-29 00:06:41,319 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:06:41,319 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:06:41,322 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:06:41,322 INFO L448 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 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 [2018-11-29 00:06:41,348 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:06:41,348 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-29 00:06:41,414 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:06:41,415 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:06:41,446 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:06:41,448 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:06:41,448 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:06:41,448 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:06:41,448 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:06:41,448 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:06:41,448 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:06:41,448 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:06:41,448 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:06:41,449 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy_true-unreach-call_false-termination.cil.c_Iteration9_Loop [2018-11-29 00:06:41,449 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:06:41,449 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:06:41,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:41,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:06:42,113 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:06:42,114 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:06:42,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:06:42,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:06:42,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:06:42,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:06:42,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:06:42,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:06:42,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:06:42,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:06:42,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:06:42,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:06:42,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:06:42,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:06:42,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:06:42,120 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:06:42,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:06:42,123 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:06:42,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:06:42,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:06:42,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:06:42,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:06:42,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:06:42,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:06:42,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:06:42,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:06:42,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:06:42,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:06:42,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:06:42,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:06:42,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:06:42,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:06:42,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:06:42,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:06:42,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:06:42,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:06:42,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:06:42,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:06:42,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:06:42,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:06:42,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:06:42,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:06:42,142 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:06:42,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:06:42,142 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:06:42,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:06:42,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:06:42,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:06:42,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:06:42,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:06:42,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:06:42,151 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:06:42,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:06:42,152 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:06:42,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:06:42,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:06:42,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:06:42,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:06:42,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:06:42,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:06:42,160 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:06:42,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:06:42,160 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:06:42,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:06:42,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:06:42,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:06:42,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:06:42,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:06:42,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:06:42,171 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:06:42,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:06:42,172 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:06:42,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:06:42,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:06:42,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:06:42,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:06:42,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:06:42,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:06:42,174 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:06:42,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:06:42,175 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:06:42,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:06:42,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:06:42,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:06:42,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:06:42,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:06:42,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:06:42,188 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:06:42,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:06:42,192 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:06:42,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:06:42,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:06:42,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:06:42,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:06:42,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:06:42,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:06:42,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:06:42,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:06:42,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:06:42,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:06:42,204 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:06:42,210 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:06:42,210 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:06:42,210 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:06:42,210 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:06:42,214 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:06:42,214 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -2*~e_e~0 + 3 Supporting invariants [] [2018-11-29 00:06:42,214 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:06:42,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:42,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:06:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:42,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:06:42,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:42,350 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 [2018-11-29 00:06:42,351 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 894 states and 1493 transitions. cyclomatic complexity: 608 Second operand 4 states. [2018-11-29 00:06:42,552 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. [2018-11-29 00:06:42,553 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 [2018-11-29 00:06:42,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:06:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2018-11-29 00:06:42,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 25 letters. Loop has 28 letters. [2018-11-29 00:06:42,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:06:42,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 53 letters. Loop has 28 letters. [2018-11-29 00:06:42,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:06:42,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 25 letters. Loop has 56 letters. [2018-11-29 00:06:42,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:06:42,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2509 states and 4176 transitions. [2018-11-29 00:06:42,578 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1064 [2018-11-29 00:06:42,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2509 states to 2509 states and 4176 transitions. [2018-11-29 00:06:42,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1144 [2018-11-29 00:06:42,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1165 [2018-11-29 00:06:42,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2509 states and 4176 transitions. [2018-11-29 00:06:42,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:06:42,601 INFO L705 BuchiCegarLoop]: Abstraction has 2509 states and 4176 transitions. [2018-11-29 00:06:42,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states and 4176 transitions. [2018-11-29 00:06:42,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2488. [2018-11-29 00:06:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2488 states. [2018-11-29 00:06:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 4141 transitions. [2018-11-29 00:06:42,656 INFO L728 BuchiCegarLoop]: Abstraction has 2488 states and 4141 transitions. [2018-11-29 00:06:42,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:06:42,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:06:42,656 INFO L87 Difference]: Start difference. First operand 2488 states and 4141 transitions. Second operand 4 states. [2018-11-29 00:06:43,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:06:43,066 INFO L93 Difference]: Finished difference Result 3187 states and 5219 transitions. [2018-11-29 00:06:43,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:06:43,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3187 states and 5219 transitions. [2018-11-29 00:06:43,087 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1227 [2018-11-29 00:06:43,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3187 states to 3187 states and 5219 transitions. [2018-11-29 00:06:43,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2018-11-29 00:06:43,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2018-11-29 00:06:43,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3187 states and 5219 transitions. [2018-11-29 00:06:43,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:06:43,114 INFO L705 BuchiCegarLoop]: Abstraction has 3187 states and 5219 transitions. [2018-11-29 00:06:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3187 states and 5219 transitions. [2018-11-29 00:06:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3187 to 3187. [2018-11-29 00:06:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3187 states. [2018-11-29 00:06:43,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3187 states to 3187 states and 5219 transitions. [2018-11-29 00:06:43,181 INFO L728 BuchiCegarLoop]: Abstraction has 3187 states and 5219 transitions. [2018-11-29 00:06:43,181 INFO L608 BuchiCegarLoop]: Abstraction has 3187 states and 5219 transitions. [2018-11-29 00:06:43,181 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-29 00:06:43,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3187 states and 5219 transitions. [2018-11-29 00:06:43,198 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1227 [2018-11-29 00:06:43,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:06:43,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:06:43,199 INFO L866 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] [2018-11-29 00:06:43,199 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:06:43,203 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 [2018-11-29 00:06:43,203 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 [2018-11-29 00:06:43,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:43,203 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2018-11-29 00:06:43,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:43,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:43,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:43,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:43,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:43,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:43,227 INFO L82 PathProgramCache]: Analyzing trace with hash 117964263, now seen corresponding path program 1 times [2018-11-29 00:06:43,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:43,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:43,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:43,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:43,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:43,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:43,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:06:43,283 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:06:43,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:06:43,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:06:43,283 INFO L87 Difference]: Start difference. First operand 3187 states and 5219 transitions. cyclomatic complexity: 2068 Second operand 3 states. [2018-11-29 00:06:43,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:06:43,547 INFO L93 Difference]: Finished difference Result 4973 states and 7999 transitions. [2018-11-29 00:06:43,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:06:43,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4973 states and 7999 transitions. [2018-11-29 00:06:43,575 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1926 [2018-11-29 00:06:43,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4973 states to 4973 states and 7999 transitions. [2018-11-29 00:06:43,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1992 [2018-11-29 00:06:43,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1992 [2018-11-29 00:06:43,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4973 states and 7999 transitions. [2018-11-29 00:06:43,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:06:43,615 INFO L705 BuchiCegarLoop]: Abstraction has 4973 states and 7999 transitions. [2018-11-29 00:06:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4973 states and 7999 transitions. [2018-11-29 00:06:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4973 to 4973. [2018-11-29 00:06:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4973 states. [2018-11-29 00:06:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4973 states to 4973 states and 7999 transitions. [2018-11-29 00:06:43,710 INFO L728 BuchiCegarLoop]: Abstraction has 4973 states and 7999 transitions. [2018-11-29 00:06:43,710 INFO L608 BuchiCegarLoop]: Abstraction has 4973 states and 7999 transitions. [2018-11-29 00:06:43,710 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-29 00:06:43,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4973 states and 7999 transitions. [2018-11-29 00:06:43,729 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1926 [2018-11-29 00:06:43,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:06:43,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:06:43,730 INFO L866 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] [2018-11-29 00:06:43,730 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:06:43,730 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 [2018-11-29 00:06:43,733 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 [2018-11-29 00:06:43,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:43,733 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2018-11-29 00:06:43,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:43,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:43,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:43,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:43,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:43,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:43,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1280783410, now seen corresponding path program 1 times [2018-11-29 00:06:43,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:43,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:43,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:43,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:06:43,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:43,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:43,771 INFO L82 PathProgramCache]: Analyzing trace with hash 361828906, now seen corresponding path program 1 times [2018-11-29 00:06:43,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:43,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:43,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:43,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:43,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:43,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:43,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:06:43,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:06:43,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:06:43,952 INFO L87 Difference]: Start difference. First operand 4973 states and 7999 transitions. cyclomatic complexity: 3062 Second operand 3 states. [2018-11-29 00:06:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:06:43,993 INFO L93 Difference]: Finished difference Result 7644 states and 12212 transitions. [2018-11-29 00:06:43,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:06:43,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7644 states and 12212 transitions. [2018-11-29 00:06:44,023 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2986 [2018-11-29 00:06:44,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7644 states to 7644 states and 12212 transitions. [2018-11-29 00:06:44,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3054 [2018-11-29 00:06:44,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3054 [2018-11-29 00:06:44,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7644 states and 12212 transitions. [2018-11-29 00:06:44,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:06:44,087 INFO L705 BuchiCegarLoop]: Abstraction has 7644 states and 12212 transitions. [2018-11-29 00:06:44,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7644 states and 12212 transitions. [2018-11-29 00:06:44,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7644 to 7644. [2018-11-29 00:06:44,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7644 states. [2018-11-29 00:06:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7644 states to 7644 states and 12212 transitions. [2018-11-29 00:06:44,237 INFO L728 BuchiCegarLoop]: Abstraction has 7644 states and 12212 transitions. [2018-11-29 00:06:44,237 INFO L608 BuchiCegarLoop]: Abstraction has 7644 states and 12212 transitions. [2018-11-29 00:06:44,237 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-29 00:06:44,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7644 states and 12212 transitions. [2018-11-29 00:06:44,265 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2986 [2018-11-29 00:06:44,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:06:44,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:06:44,268 INFO L866 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] [2018-11-29 00:06:44,268 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:06:44,268 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 [2018-11-29 00:06:44,269 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 [2018-11-29 00:06:44,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:44,269 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2018-11-29 00:06:44,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:44,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:44,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:44,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:44,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:44,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:44,293 INFO L82 PathProgramCache]: Analyzing trace with hash 998807808, now seen corresponding path program 1 times [2018-11-29 00:06:44,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:44,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:44,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:44,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:06:44,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:44,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:44,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1718978040, now seen corresponding path program 1 times [2018-11-29 00:06:44,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:44,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:44,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:44,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:44,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:44,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:44,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:06:44,632 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-29 00:06:44,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:06:44,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:06:44,656 INFO L87 Difference]: Start difference. First operand 7644 states and 12212 transitions. cyclomatic complexity: 4604 Second operand 3 states. [2018-11-29 00:06:44,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:06:44,845 INFO L93 Difference]: Finished difference Result 12085 states and 19155 transitions. [2018-11-29 00:06:44,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:06:44,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12085 states and 19155 transitions. [2018-11-29 00:06:44,896 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2018-11-29 00:06:44,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12085 states to 12085 states and 19155 transitions. [2018-11-29 00:06:44,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4860 [2018-11-29 00:06:44,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4860 [2018-11-29 00:06:44,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12085 states and 19155 transitions. [2018-11-29 00:06:44,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:06:44,965 INFO L705 BuchiCegarLoop]: Abstraction has 12085 states and 19155 transitions. [2018-11-29 00:06:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12085 states and 19155 transitions. [2018-11-29 00:06:45,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12085 to 12085. [2018-11-29 00:06:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12085 states. [2018-11-29 00:06:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12085 states to 12085 states and 19155 transitions. [2018-11-29 00:06:45,140 INFO L728 BuchiCegarLoop]: Abstraction has 12085 states and 19155 transitions. [2018-11-29 00:06:45,140 INFO L608 BuchiCegarLoop]: Abstraction has 12085 states and 19155 transitions. [2018-11-29 00:06:45,141 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-29 00:06:45,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12085 states and 19155 transitions. [2018-11-29 00:06:45,177 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2018-11-29 00:06:45,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:06:45,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:06:45,178 INFO L866 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] [2018-11-29 00:06:45,179 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:06:45,179 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 [2018-11-29 00:06:45,179 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 [2018-11-29 00:06:45,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:45,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2018-11-29 00:06:45,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:45,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:45,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:45,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:45,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:45,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:45,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:06:45,248 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:06:45,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:45,248 INFO L82 PathProgramCache]: Analyzing trace with hash 998807808, now seen corresponding path program 2 times [2018-11-29 00:06:45,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:45,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:45,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:45,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:45,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:45,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:06:45,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:06:45,339 INFO L87 Difference]: Start difference. First operand 12085 states and 19155 transitions. cyclomatic complexity: 7106 Second operand 3 states. [2018-11-29 00:06:45,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:06:45,375 INFO L93 Difference]: Finished difference Result 12033 states and 19068 transitions. [2018-11-29 00:06:45,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:06:45,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12033 states and 19068 transitions. [2018-11-29 00:06:45,416 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2018-11-29 00:06:45,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12033 states to 12033 states and 19068 transitions. [2018-11-29 00:06:45,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4810 [2018-11-29 00:06:45,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4810 [2018-11-29 00:06:45,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12033 states and 19068 transitions. [2018-11-29 00:06:45,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:06:45,466 INFO L705 BuchiCegarLoop]: Abstraction has 12033 states and 19068 transitions. [2018-11-29 00:06:45,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12033 states and 19068 transitions. [2018-11-29 00:06:45,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12033 to 12033. [2018-11-29 00:06:45,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12033 states. [2018-11-29 00:06:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12033 states to 12033 states and 19068 transitions. [2018-11-29 00:06:45,626 INFO L728 BuchiCegarLoop]: Abstraction has 12033 states and 19068 transitions. [2018-11-29 00:06:45,626 INFO L608 BuchiCegarLoop]: Abstraction has 12033 states and 19068 transitions. [2018-11-29 00:06:45,626 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-29 00:06:45,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12033 states and 19068 transitions. [2018-11-29 00:06:45,663 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2018-11-29 00:06:45,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:06:45,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:06:45,664 INFO L866 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] [2018-11-29 00:06:45,664 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:06:45,664 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 [2018-11-29 00:06:45,664 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 [2018-11-29 00:06:45,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:45,665 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2018-11-29 00:06:45,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:45,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:45,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:45,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:06:45,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:45,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:45,689 INFO L82 PathProgramCache]: Analyzing trace with hash 896651005, now seen corresponding path program 1 times [2018-11-29 00:06:45,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:45,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:45,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:45,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:06:45,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:45,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:45,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1750331659, now seen corresponding path program 1 times [2018-11-29 00:06:45,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:45,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:45,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:45,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:45,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:06:45,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:06:45,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:06:45,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:06:46,010 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-29 00:06:46,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:06:46,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:06:46,056 INFO L87 Difference]: Start difference. First operand 12033 states and 19068 transitions. cyclomatic complexity: 7071 Second operand 3 states. [2018-11-29 00:06:46,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:06:46,146 INFO L93 Difference]: Finished difference Result 18669 states and 29460 transitions. [2018-11-29 00:06:46,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:06:46,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18669 states and 29460 transitions. [2018-11-29 00:06:46,204 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 7424 [2018-11-29 00:06:46,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18669 states to 18669 states and 29460 transitions. [2018-11-29 00:06:46,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7496 [2018-11-29 00:06:46,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7496 [2018-11-29 00:06:46,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18669 states and 29460 transitions. [2018-11-29 00:06:46,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:06:46,299 INFO L705 BuchiCegarLoop]: Abstraction has 18669 states and 29460 transitions. [2018-11-29 00:06:46,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18669 states and 29460 transitions. [2018-11-29 00:06:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18669 to 18549. [2018-11-29 00:06:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18549 states. [2018-11-29 00:06:46,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18549 states to 18549 states and 29340 transitions. [2018-11-29 00:06:46,524 INFO L728 BuchiCegarLoop]: Abstraction has 18549 states and 29340 transitions. [2018-11-29 00:06:46,524 INFO L608 BuchiCegarLoop]: Abstraction has 18549 states and 29340 transitions. [2018-11-29 00:06:46,524 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-29 00:06:46,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18549 states and 29340 transitions. [2018-11-29 00:06:46,574 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 7376 [2018-11-29 00:06:46,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:06:46,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:06:46,577 INFO L866 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] [2018-11-29 00:06:46,577 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:06:46,577 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 [2018-11-29 00:06:46,578 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 [2018-11-29 00:06:46,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:46,578 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 5 times [2018-11-29 00:06:46,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:46,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:46,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:46,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:46,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:46,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:46,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2026342965, now seen corresponding path program 1 times [2018-11-29 00:06:46,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:46,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:46,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:46,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:06:46,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:46,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:06:46,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1574259005, now seen corresponding path program 1 times [2018-11-29 00:06:46,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:06:46,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:06:46,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:46,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:06:46,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:06:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:06:47,062 WARN L180 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-29 00:06:47,187 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-29 00:06:47,615 WARN L180 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 110 [2018-11-29 00:06:47,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:06:47 BoogieIcfgContainer [2018-11-29 00:06:47,724 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:06:47,725 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:06:47,725 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:06:47,725 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:06:47,727 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:06:30" (3/4) ... [2018-11-29 00:06:47,730 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-29 00:06:47,819 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-29 00:06:47,819 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:06:47,824 INFO L168 Benchmark]: Toolchain (without parser) took 19102.10 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 384.8 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -270.3 MB). Peak memory consumption was 114.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:06:47,825 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:06:47,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 541.55 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:06:47,828 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.58 ms. Allocated memory is still 1.0 GB. Free memory was 931.2 MB in the beginning and 925.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:06:47,829 INFO L168 Benchmark]: Boogie Preprocessor took 111.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -213.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-29 00:06:47,829 INFO L168 Benchmark]: RCFGBuilder took 1315.36 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: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:06:47,833 INFO L168 Benchmark]: BuchiAutomizer took 16966.93 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 241.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -124.4 MB). Peak memory consumption was 448.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:06:47,834 INFO L168 Benchmark]: Witness Printer took 94.15 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:06:47,839 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 541.55 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.58 ms. Allocated memory is still 1.0 GB. Free memory was 931.2 MB in the beginning and 925.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 111.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -213.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1315.36 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: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16966.93 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 241.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -124.4 MB). Peak memory consumption was 448.8 MB. Max. memory is 11.5 GB. * Witness Printer took 94.15 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 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 16.8s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 10.8s. Construction of modules took 2.1s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 12. Automata minimization 1.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 1274 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.6s 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, 2.1s 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: 12ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - 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@3f3b1352=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12095312=0, c1_i=1, c2_pc=0, c2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1459cf6e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c90942d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1abec112=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...