./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec3_product47_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/product-lines/minepump_spec3_product47_false-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 8425c566d51ac72c4c499354b129f4f120e9c3b0 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0ed9222-m [2019-01-14 04:24:04,518 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:24:04,519 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:24:04,531 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:24:04,531 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:24:04,532 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:24:04,534 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:24:04,535 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:24:04,537 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:24:04,538 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:24:04,539 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:24:04,539 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:24:04,542 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:24:04,543 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:24:04,546 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:24:04,548 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:24:04,549 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:24:04,553 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:24:04,557 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:24:04,561 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:24:04,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:24:04,566 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:24:04,570 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:24:04,573 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:24:04,573 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:24:04,574 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:24:04,575 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:24:04,575 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:24:04,579 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:24:04,581 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:24:04,582 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:24:04,584 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:24:04,584 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:24:04,585 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:24:04,585 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:24:04,586 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:24:04,586 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:24:04,613 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:24:04,614 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:24:04,616 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:24:04,617 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:24:04,617 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:24:04,617 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:24:04,617 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:24:04,618 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:24:04,619 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:24:04,619 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:24:04,619 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:24:04,619 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:24:04,619 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:24:04,619 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:24:04,620 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:24:04,620 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:24:04,620 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:24:04,621 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:24:04,622 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:24:04,622 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:24:04,622 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:24:04,622 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:24:04,623 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:24:04,623 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:24:04,623 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:24:04,623 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:24:04,623 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:24:04,623 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:24:04,624 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:24:04,625 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:24:04,625 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:24:04,626 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:24:04,627 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 -> 8425c566d51ac72c4c499354b129f4f120e9c3b0 [2019-01-14 04:24:04,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:24:04,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:24:04,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:24:04,699 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:24:04,699 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:24:04,700 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec3_product47_false-unreach-call_false-termination.cil.c [2019-01-14 04:24:04,758 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecde1607e/ebe14505608c481d9ac8c536b7eed522/FLAG16458ceab [2019-01-14 04:24:05,246 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:24:05,246 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec3_product47_false-unreach-call_false-termination.cil.c [2019-01-14 04:24:05,263 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecde1607e/ebe14505608c481d9ac8c536b7eed522/FLAG16458ceab [2019-01-14 04:24:05,537 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecde1607e/ebe14505608c481d9ac8c536b7eed522 [2019-01-14 04:24:05,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:24:05,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:24:05,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:24:05,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:24:05,549 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:24:05,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:24:05" (1/1) ... [2019-01-14 04:24:05,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c4bba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:05, skipping insertion in model container [2019-01-14 04:24:05,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:24:05" (1/1) ... [2019-01-14 04:24:05,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:24:05,614 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:24:05,970 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:24:05,997 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:24:06,152 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:24:06,190 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:24:06,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:06 WrapperNode [2019-01-14 04:24:06,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:24:06,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:24:06,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:24:06,192 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:24:06,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:06" (1/1) ... [2019-01-14 04:24:06,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:06" (1/1) ... [2019-01-14 04:24:06,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:24:06,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:24:06,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:24:06,276 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:24:06,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:06" (1/1) ... [2019-01-14 04:24:06,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:06" (1/1) ... [2019-01-14 04:24:06,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:06" (1/1) ... [2019-01-14 04:24:06,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:06" (1/1) ... [2019-01-14 04:24:06,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:06" (1/1) ... [2019-01-14 04:24:06,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:06" (1/1) ... [2019-01-14 04:24:06,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:06" (1/1) ... [2019-01-14 04:24:06,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:24:06,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:24:06,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:24:06,325 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:24:06,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:24:06,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:24:06,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:24:06,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:24:06,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:24:07,944 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:24:07,945 INFO L286 CfgBuilder]: Removed 202 assue(true) statements. [2019-01-14 04:24:07,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:24:07 BoogieIcfgContainer [2019-01-14 04:24:07,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:24:07,947 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:24:07,947 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:24:07,950 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:24:07,951 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:24:07,952 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:24:05" (1/3) ... [2019-01-14 04:24:07,953 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6bc717b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:24:07, skipping insertion in model container [2019-01-14 04:24:07,953 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:24:07,953 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:06" (2/3) ... [2019-01-14 04:24:07,954 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6bc717b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:24:07, skipping insertion in model container [2019-01-14 04:24:07,954 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:24:07,954 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:24:07" (3/3) ... [2019-01-14 04:24:07,956 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product47_false-unreach-call_false-termination.cil.c [2019-01-14 04:24:08,012 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:24:08,013 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:24:08,013 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:24:08,013 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:24:08,013 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:24:08,013 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:24:08,014 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:24:08,014 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:24:08,014 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:24:08,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states. [2019-01-14 04:24:08,064 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2019-01-14 04:24:08,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:24:08,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:24:08,074 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:24:08,074 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:24:08,074 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:24:08,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states. [2019-01-14 04:24:08,085 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2019-01-14 04:24:08,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:24:08,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:24:08,087 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:24:08,087 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:24:08,092 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(13);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(110, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 2 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 3 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string52.base, #t~string52.offset, 1);call write~init~int(80, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(117, #t~string52.base, 2 + #t~string52.offset, 1);call write~init~int(109, #t~string52.base, 3 + #t~string52.offset, 1);call write~init~int(112, #t~string52.base, 4 + #t~string52.offset, 1);call write~init~int(58, #t~string52.base, 5 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 6 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(110, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 3 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string58.base, #t~string58.offset, 1);call write~init~int(32, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string60.base, #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 1 + #t~string60.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string65.base, #t~string65.offset, 1);call write~init~int(77, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(101, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(104, #t~string65.base, 4 + #t~string65.offset, 1);call write~init~int(58, #t~string65.base, 5 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 6 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string67.base, #t~string67.offset, 1);call write~init~int(82, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(73, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(84, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(75, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 11#L-1true havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 3#L175true havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 37#L183true main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 34#L139true assume 0 != main_~tmp~0; 116#L112true havoc test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 64#L950-1true [2019-01-14 04:24:08,093 INFO L796 eck$LassoCheckResult]: Loop: 64#L950-1true assume !false; 7#L566true assume test_~splverifierCounter~0 < 4; 77#L567true test_~tmp~4 := test_#t~nondet37;havoc test_#t~nondet37; 101#L575true assume !(0 != test_~tmp~4); 81#L575-1true test_~tmp___0~0 := test_#t~nondet38;havoc test_#t~nondet38; 12#L585true assume !(0 != test_~tmp___0~0); 16#L585-1true test_~tmp___2~0 := test_#t~nondet39;havoc test_#t~nondet39; 53#L595true assume 0 != test_~tmp___2~0; 42#L601-1true assume !(0 != ~pumpRunning~0); 35#L637true assume !(0 != ~systemActive~0); 72#L644true havoc __utac_acc__Specification3_spec__1_#t~ret72, __utac_acc__Specification3_spec__1_#t~ret73, __utac_acc__Specification3_spec__1_#t~ret74, __utac_acc__Specification3_spec__1_~tmp~9, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~9;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~9;havoc isMethaneLevelCritical_~retValue_acc~9;isMethaneLevelCritical_~retValue_acc~9 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~9; 57#L884-3true __utac_acc__Specification3_spec__1_#t~ret72 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~9 := __utac_acc__Specification3_spec__1_#t~ret72;havoc __utac_acc__Specification3_spec__1_#t~ret72; 93#L944true assume 0 != __utac_acc__Specification3_spec__1_~tmp~9; 64#L950-1true [2019-01-14 04:24:08,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:08,102 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-14 04:24:08,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:08,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:08,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:08,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:08,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:09,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1670724674, now seen corresponding path program 1 times [2019-01-14 04:24:09,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:09,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:09,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:09,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:09,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:09,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:09,060 INFO L82 PathProgramCache]: Analyzing trace with hash 43554264, now seen corresponding path program 1 times [2019-01-14 04:24:09,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:09,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:09,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:09,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:09,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:24:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:24:09,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:24:09,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:24:09,442 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 04:24:09,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:24:09,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:24:09,536 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 6 states. [2019-01-14 04:24:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:24:10,080 INFO L93 Difference]: Finished difference Result 318 states and 453 transitions. [2019-01-14 04:24:10,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:24:10,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 453 transitions. [2019-01-14 04:24:10,093 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 205 [2019-01-14 04:24:10,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 297 states and 432 transitions. [2019-01-14 04:24:10,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 297 [2019-01-14 04:24:10,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 297 [2019-01-14 04:24:10,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 297 states and 432 transitions. [2019-01-14 04:24:10,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:24:10,121 INFO L706 BuchiCegarLoop]: Abstraction has 297 states and 432 transitions. [2019-01-14 04:24:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states and 432 transitions. [2019-01-14 04:24:10,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 174. [2019-01-14 04:24:10,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-01-14 04:24:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 252 transitions. [2019-01-14 04:24:10,199 INFO L729 BuchiCegarLoop]: Abstraction has 174 states and 252 transitions. [2019-01-14 04:24:10,199 INFO L609 BuchiCegarLoop]: Abstraction has 174 states and 252 transitions. [2019-01-14 04:24:10,199 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:24:10,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 252 transitions. [2019-01-14 04:24:10,202 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2019-01-14 04:24:10,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:24:10,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:24:10,203 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:24:10,203 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:24:10,204 INFO L794 eck$LassoCheckResult]: Stem: 579#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(13);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(110, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 2 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 3 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string52.base, #t~string52.offset, 1);call write~init~int(80, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(117, #t~string52.base, 2 + #t~string52.offset, 1);call write~init~int(109, #t~string52.base, 3 + #t~string52.offset, 1);call write~init~int(112, #t~string52.base, 4 + #t~string52.offset, 1);call write~init~int(58, #t~string52.base, 5 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 6 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(110, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 3 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string58.base, #t~string58.offset, 1);call write~init~int(32, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string60.base, #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 1 + #t~string60.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string65.base, #t~string65.offset, 1);call write~init~int(77, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(101, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(104, #t~string65.base, 4 + #t~string65.offset, 1);call write~init~int(58, #t~string65.base, 5 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 6 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string67.base, #t~string67.offset, 1);call write~init~int(82, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(73, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(84, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(75, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 486#L-1 havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 470#L175 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 471#L183 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 531#L139 assume 0 != main_~tmp~0; 532#L112 havoc test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 509#L950-1 [2019-01-14 04:24:10,204 INFO L796 eck$LassoCheckResult]: Loop: 509#L950-1 assume !false; 478#L566 assume test_~splverifierCounter~0 < 4; 479#L567 test_~tmp~4 := test_#t~nondet37;havoc test_#t~nondet37; 576#L575 assume !(0 != test_~tmp~4); 570#L575-1 test_~tmp___0~0 := test_#t~nondet38;havoc test_#t~nondet38; 487#L585 assume !(0 != test_~tmp___0~0); 488#L585-1 test_~tmp___2~0 := test_#t~nondet39;havoc test_#t~nondet39; 497#L595 assume 0 != test_~tmp___2~0; 539#L601-1 assume !(0 != ~pumpRunning~0); 533#L637 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret42, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 510#L695 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret41, processEnvironment__wrappee__methaneQuery_~tmp~5;havoc processEnvironment__wrappee__methaneQuery_~tmp~5; 512#L669-1 assume !(0 == ~pumpRunning~0); 473#L644 havoc __utac_acc__Specification3_spec__1_#t~ret72, __utac_acc__Specification3_spec__1_#t~ret73, __utac_acc__Specification3_spec__1_#t~ret74, __utac_acc__Specification3_spec__1_~tmp~9, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~9;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~9;havoc isMethaneLevelCritical_~retValue_acc~9;isMethaneLevelCritical_~retValue_acc~9 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~9; 557#L884-3 __utac_acc__Specification3_spec__1_#t~ret72 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~9 := __utac_acc__Specification3_spec__1_#t~ret72;havoc __utac_acc__Specification3_spec__1_#t~ret72; 558#L944 assume 0 != __utac_acc__Specification3_spec__1_~tmp~9; 509#L950-1 [2019-01-14 04:24:10,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:10,204 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-14 04:24:10,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:10,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:10,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:10,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:10,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:10,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:10,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1966055744, now seen corresponding path program 1 times [2019-01-14 04:24:10,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:10,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:10,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:10,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:24:10,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:24:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:24:10,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:24:10,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:24:10,688 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:24:10,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:24:10,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:24:10,690 INFO L87 Difference]: Start difference. First operand 174 states and 252 transitions. cyclomatic complexity: 81 Second operand 3 states. [2019-01-14 04:24:11,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:24:11,086 INFO L93 Difference]: Finished difference Result 219 states and 301 transitions. [2019-01-14 04:24:11,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:24:11,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 301 transitions. [2019-01-14 04:24:11,092 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 154 [2019-01-14 04:24:11,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 219 states and 301 transitions. [2019-01-14 04:24:11,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 219 [2019-01-14 04:24:11,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2019-01-14 04:24:11,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 301 transitions. [2019-01-14 04:24:11,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:24:11,106 INFO L706 BuchiCegarLoop]: Abstraction has 219 states and 301 transitions. [2019-01-14 04:24:11,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 301 transitions. [2019-01-14 04:24:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2019-01-14 04:24:11,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-01-14 04:24:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 301 transitions. [2019-01-14 04:24:11,136 INFO L729 BuchiCegarLoop]: Abstraction has 219 states and 301 transitions. [2019-01-14 04:24:11,136 INFO L609 BuchiCegarLoop]: Abstraction has 219 states and 301 transitions. [2019-01-14 04:24:11,136 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:24:11,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 219 states and 301 transitions. [2019-01-14 04:24:11,141 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 154 [2019-01-14 04:24:11,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:24:11,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:24:11,145 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:24:11,145 INFO L868 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] [2019-01-14 04:24:11,146 INFO L794 eck$LassoCheckResult]: Stem: 987#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(13);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(110, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 2 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 3 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string52.base, #t~string52.offset, 1);call write~init~int(80, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(117, #t~string52.base, 2 + #t~string52.offset, 1);call write~init~int(109, #t~string52.base, 3 + #t~string52.offset, 1);call write~init~int(112, #t~string52.base, 4 + #t~string52.offset, 1);call write~init~int(58, #t~string52.base, 5 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 6 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(110, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 3 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string58.base, #t~string58.offset, 1);call write~init~int(32, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string60.base, #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 1 + #t~string60.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string65.base, #t~string65.offset, 1);call write~init~int(77, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(101, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(104, #t~string65.base, 4 + #t~string65.offset, 1);call write~init~int(58, #t~string65.base, 5 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 6 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string67.base, #t~string67.offset, 1);call write~init~int(82, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(73, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(84, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(75, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 887#L-1 havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 869#L175 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 870#L183 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 929#L139 assume 0 != main_~tmp~0; 930#L112 havoc test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 910#L950-1 [2019-01-14 04:24:11,146 INFO L796 eck$LassoCheckResult]: Loop: 910#L950-1 assume !false; 1059#L566 assume test_~splverifierCounter~0 < 4; 1060#L567 test_~tmp~4 := test_#t~nondet37;havoc test_#t~nondet37; 1085#L575 assume !(0 != test_~tmp~4); 1083#L575-1 test_~tmp___0~0 := test_#t~nondet38;havoc test_#t~nondet38; 1082#L585 assume !(0 != test_~tmp___0~0); 1080#L585-1 test_~tmp___2~0 := test_#t~nondet39;havoc test_#t~nondet39; 1078#L595 assume 0 != test_~tmp___2~0; 1077#L601-1 assume !(0 != ~pumpRunning~0); 931#L637 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret42, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 911#L695 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret41, processEnvironment__wrappee__methaneQuery_~tmp~5;havoc processEnvironment__wrappee__methaneQuery_~tmp~5; 912#L669-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret61, isHighWaterLevel_~retValue_acc~8, isHighWaterLevel_~tmp~8, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~8;havoc isHighWaterLevel_~tmp~8;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 973#L924-1 assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~11 := 0;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 919#L929-1 isHighWaterLevel_#t~ret61 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~8 := isHighWaterLevel_#t~ret61;havoc isHighWaterLevel_#t~ret61; 920#L814-3 assume 0 != isHighWaterLevel_~tmp~8;isHighWaterLevel_~tmp___0~1 := 0; 1004#L814-5 isHighWaterLevel_~retValue_acc~8 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~8; 988#L820-1 processEnvironment__wrappee__methaneQuery_#t~ret41 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~5 := processEnvironment__wrappee__methaneQuery_#t~ret41;havoc processEnvironment__wrappee__methaneQuery_#t~ret41; 921#L673-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~5); 872#L644 havoc __utac_acc__Specification3_spec__1_#t~ret72, __utac_acc__Specification3_spec__1_#t~ret73, __utac_acc__Specification3_spec__1_#t~ret74, __utac_acc__Specification3_spec__1_~tmp~9, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~9;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~9;havoc isMethaneLevelCritical_~retValue_acc~9;isMethaneLevelCritical_~retValue_acc~9 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~9; 1063#L884-3 __utac_acc__Specification3_spec__1_#t~ret72 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~9 := __utac_acc__Specification3_spec__1_#t~ret72;havoc __utac_acc__Specification3_spec__1_#t~ret72; 996#L944 assume 0 != __utac_acc__Specification3_spec__1_~tmp~9; 910#L950-1 [2019-01-14 04:24:11,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:11,146 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-14 04:24:11,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:11,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:11,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:11,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:11,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:11,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:11,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1687938738, now seen corresponding path program 1 times [2019-01-14 04:24:11,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:11,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:11,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:11,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:24:11,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:24:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:24:11,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:24:11,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:24:11,709 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:24:11,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:24:11,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:24:11,711 INFO L87 Difference]: Start difference. First operand 219 states and 301 transitions. cyclomatic complexity: 85 Second operand 4 states. [2019-01-14 04:24:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:24:12,869 INFO L93 Difference]: Finished difference Result 621 states and 843 transitions. [2019-01-14 04:24:12,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:24:12,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 621 states and 843 transitions. [2019-01-14 04:24:12,878 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 446 [2019-01-14 04:24:12,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 621 states to 621 states and 843 transitions. [2019-01-14 04:24:12,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 621 [2019-01-14 04:24:12,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 621 [2019-01-14 04:24:12,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 621 states and 843 transitions. [2019-01-14 04:24:12,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:24:12,891 INFO L706 BuchiCegarLoop]: Abstraction has 621 states and 843 transitions. [2019-01-14 04:24:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states and 843 transitions. [2019-01-14 04:24:12,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 231. [2019-01-14 04:24:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-14 04:24:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 313 transitions. [2019-01-14 04:24:12,908 INFO L729 BuchiCegarLoop]: Abstraction has 231 states and 313 transitions. [2019-01-14 04:24:12,908 INFO L609 BuchiCegarLoop]: Abstraction has 231 states and 313 transitions. [2019-01-14 04:24:12,908 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:24:12,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 313 transitions. [2019-01-14 04:24:12,911 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 162 [2019-01-14 04:24:12,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:24:12,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:24:12,912 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:24:12,913 INFO L868 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] [2019-01-14 04:24:12,914 INFO L794 eck$LassoCheckResult]: Stem: 1838#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(13);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(110, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 2 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 3 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string52.base, #t~string52.offset, 1);call write~init~int(80, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(117, #t~string52.base, 2 + #t~string52.offset, 1);call write~init~int(109, #t~string52.base, 3 + #t~string52.offset, 1);call write~init~int(112, #t~string52.base, 4 + #t~string52.offset, 1);call write~init~int(58, #t~string52.base, 5 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 6 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(110, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 3 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string58.base, #t~string58.offset, 1);call write~init~int(32, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string60.base, #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 1 + #t~string60.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string65.base, #t~string65.offset, 1);call write~init~int(77, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(101, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(104, #t~string65.base, 4 + #t~string65.offset, 1);call write~init~int(58, #t~string65.base, 5 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 6 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string67.base, #t~string67.offset, 1);call write~init~int(82, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(73, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(84, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(75, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 1737#L-1 havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 1719#L175 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 1720#L183 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 1780#L139 assume 0 != main_~tmp~0; 1781#L112 havoc test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1822#L950-1 [2019-01-14 04:24:12,914 INFO L796 eck$LassoCheckResult]: Loop: 1822#L950-1 assume !false; 1729#L566 assume test_~splverifierCounter~0 < 4; 1730#L567 test_~tmp~4 := test_#t~nondet37;havoc test_#t~nondet37; 1834#L575 assume !(0 != test_~tmp~4); 1827#L575-1 test_~tmp___0~0 := test_#t~nondet38;havoc test_#t~nondet38; 1738#L585 assume !(0 != test_~tmp___0~0); 1739#L585-1 test_~tmp___2~0 := test_#t~nondet39;havoc test_#t~nondet39; 1747#L595 assume 0 != test_~tmp___2~0; 1789#L601-1 assume !(0 != ~pumpRunning~0); 1790#L637 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret42, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 1762#L695 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret41, processEnvironment__wrappee__methaneQuery_~tmp~5;havoc processEnvironment__wrappee__methaneQuery_~tmp~5; 1763#L669-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret61, isHighWaterLevel_~retValue_acc~8, isHighWaterLevel_~tmp~8, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~8;havoc isHighWaterLevel_~tmp~8;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 1825#L924-1 assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~11 := 0;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 1880#L929-1 isHighWaterLevel_#t~ret61 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~8 := isHighWaterLevel_#t~ret61;havoc isHighWaterLevel_#t~ret61; 1878#L814-3 assume !(0 != isHighWaterLevel_~tmp~8);isHighWaterLevel_~tmp___0~1 := 1; 1859#L814-5 isHighWaterLevel_~retValue_acc~8 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~8; 1839#L820-1 processEnvironment__wrappee__methaneQuery_#t~ret41 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~5 := processEnvironment__wrappee__methaneQuery_#t~ret41;havoc processEnvironment__wrappee__methaneQuery_#t~ret41; 1772#L673-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~5); 1722#L644 havoc __utac_acc__Specification3_spec__1_#t~ret72, __utac_acc__Specification3_spec__1_#t~ret73, __utac_acc__Specification3_spec__1_#t~ret74, __utac_acc__Specification3_spec__1_~tmp~9, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~9;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~9;havoc isMethaneLevelCritical_~retValue_acc~9;isMethaneLevelCritical_~retValue_acc~9 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~9; 1811#L884-3 __utac_acc__Specification3_spec__1_#t~ret72 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~9 := __utac_acc__Specification3_spec__1_#t~ret72;havoc __utac_acc__Specification3_spec__1_#t~ret72; 1812#L944 assume 0 != __utac_acc__Specification3_spec__1_~tmp~9; 1822#L950-1 [2019-01-14 04:24:12,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:12,914 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2019-01-14 04:24:12,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:12,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:12,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:12,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:12,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:13,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:13,254 INFO L82 PathProgramCache]: Analyzing trace with hash 87068624, now seen corresponding path program 1 times [2019-01-14 04:24:13,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:13,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:13,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:13,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:24:13,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:24:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:24:13,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:24:13,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:24:13,558 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:24:13,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:24:13,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:24:13,559 INFO L87 Difference]: Start difference. First operand 231 states and 313 transitions. cyclomatic complexity: 85 Second operand 5 states. [2019-01-14 04:24:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:24:14,283 INFO L93 Difference]: Finished difference Result 732 states and 988 transitions. [2019-01-14 04:24:14,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:24:14,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 732 states and 988 transitions. [2019-01-14 04:24:14,292 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 532 [2019-01-14 04:24:14,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 732 states to 732 states and 988 transitions. [2019-01-14 04:24:14,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 732 [2019-01-14 04:24:14,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 732 [2019-01-14 04:24:14,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 732 states and 988 transitions. [2019-01-14 04:24:14,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:24:14,302 INFO L706 BuchiCegarLoop]: Abstraction has 732 states and 988 transitions. [2019-01-14 04:24:14,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states and 988 transitions. [2019-01-14 04:24:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 249. [2019-01-14 04:24:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-01-14 04:24:14,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 331 transitions. [2019-01-14 04:24:14,314 INFO L729 BuchiCegarLoop]: Abstraction has 249 states and 331 transitions. [2019-01-14 04:24:14,314 INFO L609 BuchiCegarLoop]: Abstraction has 249 states and 331 transitions. [2019-01-14 04:24:14,314 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:24:14,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 331 transitions. [2019-01-14 04:24:14,317 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 174 [2019-01-14 04:24:14,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:24:14,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:24:14,319 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:24:14,319 INFO L868 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] [2019-01-14 04:24:14,319 INFO L794 eck$LassoCheckResult]: Stem: 2819#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(13);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(110, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 2 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 3 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string52.base, #t~string52.offset, 1);call write~init~int(80, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(117, #t~string52.base, 2 + #t~string52.offset, 1);call write~init~int(109, #t~string52.base, 3 + #t~string52.offset, 1);call write~init~int(112, #t~string52.base, 4 + #t~string52.offset, 1);call write~init~int(58, #t~string52.base, 5 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 6 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(110, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 3 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string58.base, #t~string58.offset, 1);call write~init~int(32, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string60.base, #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 1 + #t~string60.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string65.base, #t~string65.offset, 1);call write~init~int(77, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(101, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(104, #t~string65.base, 4 + #t~string65.offset, 1);call write~init~int(58, #t~string65.base, 5 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 6 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string67.base, #t~string67.offset, 1);call write~init~int(82, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(73, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(84, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(75, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 2714#L-1 havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 2696#L175 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 2697#L183 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 2755#L139 assume 0 != main_~tmp~0; 2756#L112 havoc test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 2797#L950-1 [2019-01-14 04:24:14,319 INFO L796 eck$LassoCheckResult]: Loop: 2797#L950-1 assume !false; 2798#L566 assume test_~splverifierCounter~0 < 4; 2812#L567 test_~tmp~4 := test_#t~nondet37;havoc test_#t~nondet37; 2813#L575 assume !(0 != test_~tmp~4); 2915#L575-1 test_~tmp___0~0 := test_#t~nondet38;havoc test_#t~nondet38; 2715#L585 assume !(0 != test_~tmp___0~0); 2716#L585-1 test_~tmp___2~0 := test_#t~nondet39;havoc test_#t~nondet39; 2781#L595 assume 0 != test_~tmp___2~0; 2765#L601-1 assume !(0 != ~pumpRunning~0); 2766#L637 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret42, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 2737#L695 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret41, processEnvironment__wrappee__methaneQuery_~tmp~5;havoc processEnvironment__wrappee__methaneQuery_~tmp~5; 2738#L669-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret61, isHighWaterLevel_~retValue_acc~8, isHighWaterLevel_~tmp~8, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~8;havoc isHighWaterLevel_~tmp~8;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 2801#L924-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 2860#L929-1 isHighWaterLevel_#t~ret61 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~8 := isHighWaterLevel_#t~ret61;havoc isHighWaterLevel_#t~ret61; 2869#L814-3 assume 0 != isHighWaterLevel_~tmp~8;isHighWaterLevel_~tmp___0~1 := 0; 2844#L814-5 isHighWaterLevel_~retValue_acc~8 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~8; 2820#L820-1 processEnvironment__wrappee__methaneQuery_#t~ret41 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~5 := processEnvironment__wrappee__methaneQuery_#t~ret41;havoc processEnvironment__wrappee__methaneQuery_#t~ret41; 2821#L673-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~5); 2699#L644 havoc __utac_acc__Specification3_spec__1_#t~ret72, __utac_acc__Specification3_spec__1_#t~ret73, __utac_acc__Specification3_spec__1_#t~ret74, __utac_acc__Specification3_spec__1_~tmp~9, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~9;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~9;havoc isMethaneLevelCritical_~retValue_acc~9;isMethaneLevelCritical_~retValue_acc~9 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~9; 2921#L884-3 __utac_acc__Specification3_spec__1_#t~ret72 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~9 := __utac_acc__Specification3_spec__1_#t~ret72;havoc __utac_acc__Specification3_spec__1_#t~ret72; 2919#L944 assume 0 != __utac_acc__Specification3_spec__1_~tmp~9; 2797#L950-1 [2019-01-14 04:24:14,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:14,320 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 5 times [2019-01-14 04:24:14,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:14,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:14,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:14,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:14,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:14,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:14,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1926970188, now seen corresponding path program 1 times [2019-01-14 04:24:14,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:14,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:14,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:14,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:24:14,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:14,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:14,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1911925914, now seen corresponding path program 1 times [2019-01-14 04:24:14,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:14,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:14,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:14,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:14,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:24:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:24:14,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:24:14,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:24:15,547 WARN L181 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-01-14 04:24:15,655 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-14 04:24:15,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:24:15,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:24:15,660 INFO L87 Difference]: Start difference. First operand 249 states and 331 transitions. cyclomatic complexity: 85 Second operand 5 states. [2019-01-14 04:24:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:24:16,179 INFO L93 Difference]: Finished difference Result 839 states and 1112 transitions. [2019-01-14 04:24:16,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 04:24:16,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 839 states and 1112 transitions. [2019-01-14 04:24:16,189 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 614 [2019-01-14 04:24:16,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 839 states to 839 states and 1112 transitions. [2019-01-14 04:24:16,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 839 [2019-01-14 04:24:16,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 839 [2019-01-14 04:24:16,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 839 states and 1112 transitions. [2019-01-14 04:24:16,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:24:16,199 INFO L706 BuchiCegarLoop]: Abstraction has 839 states and 1112 transitions. [2019-01-14 04:24:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states and 1112 transitions. [2019-01-14 04:24:16,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 492. [2019-01-14 04:24:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-01-14 04:24:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 644 transitions. [2019-01-14 04:24:16,212 INFO L729 BuchiCegarLoop]: Abstraction has 492 states and 644 transitions. [2019-01-14 04:24:16,212 INFO L609 BuchiCegarLoop]: Abstraction has 492 states and 644 transitions. [2019-01-14 04:24:16,212 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:24:16,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 492 states and 644 transitions. [2019-01-14 04:24:16,217 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 348 [2019-01-14 04:24:16,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:24:16,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:24:16,218 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:24:16,218 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:24:16,218 INFO L794 eck$LassoCheckResult]: Stem: 3929#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(13);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(110, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 2 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 3 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string52.base, #t~string52.offset, 1);call write~init~int(80, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(117, #t~string52.base, 2 + #t~string52.offset, 1);call write~init~int(109, #t~string52.base, 3 + #t~string52.offset, 1);call write~init~int(112, #t~string52.base, 4 + #t~string52.offset, 1);call write~init~int(58, #t~string52.base, 5 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 6 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(110, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 3 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string58.base, #t~string58.offset, 1);call write~init~int(32, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string60.base, #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 1 + #t~string60.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string65.base, #t~string65.offset, 1);call write~init~int(77, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(101, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(104, #t~string65.base, 4 + #t~string65.offset, 1);call write~init~int(58, #t~string65.base, 5 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 6 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string67.base, #t~string67.offset, 1);call write~init~int(82, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(73, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(84, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(75, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 3820#L-1 havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 3802#L175 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 3803#L183 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 3861#L139 assume 0 != main_~tmp~0; 3862#L112 havoc test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 3964#L950-1 [2019-01-14 04:24:16,218 INFO L796 eck$LassoCheckResult]: Loop: 3964#L950-1 assume !false; 4207#L566 assume test_~splverifierCounter~0 < 4; 3922#L567 test_~tmp~4 := test_#t~nondet37;havoc test_#t~nondet37; 3923#L575 assume !(0 != test_~tmp~4); 3908#L575-1 test_~tmp___0~0 := test_#t~nondet38;havoc test_#t~nondet38; 4245#L585 assume !(0 != test_~tmp___0~0); 4243#L585-1 test_~tmp___2~0 := test_#t~nondet39;havoc test_#t~nondet39; 4241#L595 assume 0 != test_~tmp___2~0; 4232#L601-1 assume !(0 != ~pumpRunning~0); 3863#L637 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret42, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 3843#L695 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret41, processEnvironment__wrappee__methaneQuery_~tmp~5;havoc processEnvironment__wrappee__methaneQuery_~tmp~5; 3844#L669-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret61, isHighWaterLevel_~retValue_acc~8, isHighWaterLevel_~tmp~8, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~8;havoc isHighWaterLevel_~tmp~8;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 3906#L924-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 3976#L929-1 isHighWaterLevel_#t~ret61 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~8 := isHighWaterLevel_#t~ret61;havoc isHighWaterLevel_#t~ret61; 4293#L814-3 assume 0 != isHighWaterLevel_~tmp~8;isHighWaterLevel_~tmp___0~1 := 0; 4292#L814-5 isHighWaterLevel_~retValue_acc~8 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~8; 3930#L820-1 processEnvironment__wrappee__methaneQuery_#t~ret41 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~5 := processEnvironment__wrappee__methaneQuery_#t~ret41;havoc processEnvironment__wrappee__methaneQuery_#t~ret41; 3931#L673-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~5); 3805#L644 havoc __utac_acc__Specification3_spec__1_#t~ret72, __utac_acc__Specification3_spec__1_#t~ret73, __utac_acc__Specification3_spec__1_#t~ret74, __utac_acc__Specification3_spec__1_~tmp~9, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~9;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~9;havoc isMethaneLevelCritical_~retValue_acc~9;isMethaneLevelCritical_~retValue_acc~9 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~9; 4213#L884-3 __utac_acc__Specification3_spec__1_#t~ret72 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~9 := __utac_acc__Specification3_spec__1_#t~ret72;havoc __utac_acc__Specification3_spec__1_#t~ret72; 4212#L944 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~9);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 4211#L916 __utac_acc__Specification3_spec__1_#t~ret73 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~2 := __utac_acc__Specification3_spec__1_#t~ret73;havoc __utac_acc__Specification3_spec__1_#t~ret73; 4208#L950 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~2); 3964#L950-1 [2019-01-14 04:24:16,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:16,219 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 6 times [2019-01-14 04:24:16,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:16,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:16,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:16,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:16,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:16,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:16,532 INFO L82 PathProgramCache]: Analyzing trace with hash 687454750, now seen corresponding path program 1 times [2019-01-14 04:24:16,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:16,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:16,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:16,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:24:16,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:16,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:16,546 INFO L82 PathProgramCache]: Analyzing trace with hash 885207992, now seen corresponding path program 1 times [2019-01-14 04:24:16,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:16,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:16,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:16,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:16,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:17,132 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-01-14 04:24:36,517 WARN L181 SmtUtils]: Spent 19.31 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-14 04:24:48,417 WARN L181 SmtUtils]: Spent 11.90 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-14 04:24:48,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:24:48 BoogieIcfgContainer [2019-01-14 04:24:48,521 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:24:48,521 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:24:48,522 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:24:48,522 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:24:48,523 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:24:07" (3/4) ... [2019-01-14 04:24:48,529 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:24:48,615 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:24:48,615 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:24:48,616 INFO L168 Benchmark]: Toolchain (without parser) took 43073.77 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 353.9 MB). Free memory was 946.0 MB in the beginning and 907.4 MB in the end (delta: 38.6 MB). Peak memory consumption was 392.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:24:48,619 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:24:48,625 INFO L168 Benchmark]: CACSL2BoogieTranslator took 646.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:24:48,626 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:24:48,627 INFO L168 Benchmark]: Boogie Preprocessor took 48.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:24:48,627 INFO L168 Benchmark]: RCFGBuilder took 1621.64 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: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:24:48,631 INFO L168 Benchmark]: BuchiAutomizer took 40574.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 207.1 MB). Free memory was 1.1 GB in the beginning and 918.1 MB in the end (delta: 144.3 MB). Peak memory consumption was 394.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:24:48,632 INFO L168 Benchmark]: Witness Printer took 93.48 ms. Allocated memory is still 1.4 GB. Free memory was 918.1 MB in the beginning and 907.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:24:48,636 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 646.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1621.64 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: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 40574.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 207.1 MB). Free memory was 1.1 GB in the beginning and 918.1 MB in the end (delta: 144.3 MB). Peak memory consumption was 394.6 MB. Max. memory is 11.5 GB. * Witness Printer took 93.48 ms. Allocated memory is still 1.4 GB. Free memory was 918.1 MB in the beginning and 907.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 492 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 40.4s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 36.6s. Construction of modules took 2.7s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 1343 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 492 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1304 SDtfs, 2553 SDslu, 2808 SDs, 0 SdLazy, 356 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 565]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=6562} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@660a02ec=0, NULL=0, NULL=0, retValue_acc=0, NULL=0, retValue_acc=1, NULL=6562, NULL=-12, NULL=-23, NULL=0, NULL=-20, NULL=-18, methaneLevelCritical=0, tmp___0=0, NULL=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1541b2ed=0, NULL=0, NULL=-15, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27f72a25=0, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f5b2d0e=0, NULL=0, tmp___1=0, NULL=-14, NULL=-10, NULL=-4, cleanupTimeShifts=4, NULL=6560, NULL=-11, NULL=-6, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b7664c0=66, NULL=-16, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@200b7e5c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c105e51=0, tmp=0, tmp___0=1, NULL=0, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@56c95939=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@139cd331=0, NULL=0, systemActive=1, waterLevel=1, NULL=-3, \result=1, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53229af3=0, NULL=6561, retValue_acc=0, \result=0, NULL=0, tmp___0=0, NULL=0, NULL=0, NULL=-17, NULL=0, NULL=0, \result=1, head=0, pumpRunning=0, tmp=1, \result=0, NULL=-13, NULL=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c9aca8b=0, NULL=0, NULL=0, \result=1, NULL=-22, NULL=-21, NULL=-9, NULL=0, retValue_acc=1, tmp=1, tmp___2=66, retValue_acc=1, NULL=-1, splverifierCounter=0, \result=0, tmp___1=0, head=0, NULL=-2, NULL=0, tmp=0, NULL=0, NULL=-7, NULL=0, NULL=0, NULL=-8, NULL=0, NULL=-19, tmp=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L49] int cleanupTimeShifts = 4; [L357] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L629] int pumpRunning = 0; [L630] int systemActive = 1; [L841] int waterLevel = 1; [L842] int methaneLevelCritical = 0; [L130] int retValue_acc ; [L131] int tmp ; [L179] int retValue_acc ; [L182] retValue_acc = 1 [L183] return (retValue_acc); [L137] tmp = valid_product() [L139] COND TRUE \read(tmp) [L556] int splverifierCounter ; [L557] int tmp ; [L558] int tmp___0 ; [L559] int tmp___1 ; [L560] int tmp___2 ; [L563] splverifierCounter = 0 Loop: [L565] COND TRUE 1 [L567] COND TRUE splverifierCounter < 4 [L573] tmp = __VERIFIER_nondet_int() [L575] COND FALSE !(\read(tmp)) [L583] tmp___0 = __VERIFIER_nondet_int() [L585] COND FALSE !(\read(tmp___0)) [L593] tmp___2 = __VERIFIER_nondet_int() [L595] COND TRUE \read(tmp___2) [L637] COND FALSE !(\read(pumpRunning)) [L644] COND TRUE \read(systemActive) [L692] int tmp ; [L695] COND FALSE !(\read(pumpRunning)) [L666] int tmp ; [L669] COND TRUE ! pumpRunning [L806] int retValue_acc ; [L807] int tmp ; [L808] int tmp___0 ; [L921] int retValue_acc ; [L924] COND TRUE waterLevel < 2 [L925] retValue_acc = 1 [L926] return (retValue_acc); [L812] tmp = isHighWaterSensorDry() [L814] COND TRUE \read(tmp) [L815] tmp___0 = 0 [L819] retValue_acc = tmp___0 [L820] return (retValue_acc); [L671] tmp = isHighWaterLevel() [L673] COND FALSE !(\read(tmp)) [L936] int tmp ; [L937] int tmp___0 ; [L938] int tmp___1 ; [L880] int retValue_acc ; [L883] retValue_acc = methaneLevelCritical [L884] return (retValue_acc); [L942] tmp = isMethaneLevelCritical() [L944] COND FALSE !(\read(tmp)) [L912] int retValue_acc ; [L915] retValue_acc = waterLevel [L916] return (retValue_acc); [L948] tmp___0 = getWaterLevel() [L950] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...