./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product47_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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_spec4_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 982cd7c832ad69be85d11abb6d88a1915810e691 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-2e94e6a [2019-01-01 23:48:00,597 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:48:00,599 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:48:00,611 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:48:00,611 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:48:00,613 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:48:00,614 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:48:00,616 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:48:00,619 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:48:00,620 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:48:00,622 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:48:00,625 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:48:00,626 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:48:00,627 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:48:00,632 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:48:00,633 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:48:00,634 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:48:00,638 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:48:00,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:48:00,649 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:48:00,651 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:48:00,652 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:48:00,657 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:48:00,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:48:00,660 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:48:00,661 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:48:00,665 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:48:00,666 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:48:00,668 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:48:00,670 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:48:00,670 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:48:00,673 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:48:00,673 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:48:00,673 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:48:00,675 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:48:00,676 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:48:00,679 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:48:00,712 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:48:00,713 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:48:00,715 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:48:00,715 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:48:00,715 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:48:00,715 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:48:00,715 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:48:00,717 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:48:00,717 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:48:00,718 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:48:00,718 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:48:00,718 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:48:00,718 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:48:00,718 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:48:00,718 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:48:00,719 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:48:00,720 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:48:00,720 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:48:00,720 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:48:00,720 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:48:00,723 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:48:00,723 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:48:00,723 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:48:00,723 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:48:00,724 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:48:00,724 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:48:00,724 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:48:00,724 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:48:00,724 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:48:00,725 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:48:00,725 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:48:00,728 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:48:00,729 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 -> 982cd7c832ad69be85d11abb6d88a1915810e691 [2019-01-01 23:48:00,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:48:00,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:48:00,813 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:48:00,815 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:48:00,815 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:48:00,816 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product47_false-unreach-call_false-termination.cil.c [2019-01-01 23:48:00,875 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cd0414bb/c83a63a3b8984330b5a7a09842704389/FLAGfb0bf890b [2019-01-01 23:48:01,396 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:48:01,397 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product47_false-unreach-call_false-termination.cil.c [2019-01-01 23:48:01,408 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cd0414bb/c83a63a3b8984330b5a7a09842704389/FLAGfb0bf890b [2019-01-01 23:48:01,732 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cd0414bb/c83a63a3b8984330b5a7a09842704389 [2019-01-01 23:48:01,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:48:01,738 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:48:01,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:48:01,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:48:01,744 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:48:01,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:48:01" (1/1) ... [2019-01-01 23:48:01,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f10360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:01, skipping insertion in model container [2019-01-01 23:48:01,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:48:01" (1/1) ... [2019-01-01 23:48:01,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:48:01,816 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:48:02,198 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:48:02,240 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:48:02,447 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:48:02,492 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:48:02,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:02 WrapperNode [2019-01-01 23:48:02,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:48:02,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:48:02,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:48:02,494 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:48:02,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:02" (1/1) ... [2019-01-01 23:48:02,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:02" (1/1) ... [2019-01-01 23:48:02,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:48:02,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:48:02,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:48:02,581 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:48:02,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:02" (1/1) ... [2019-01-01 23:48:02,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:02" (1/1) ... [2019-01-01 23:48:02,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:02" (1/1) ... [2019-01-01 23:48:02,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:02" (1/1) ... [2019-01-01 23:48:02,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:02" (1/1) ... [2019-01-01 23:48:02,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:02" (1/1) ... [2019-01-01 23:48:02,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:02" (1/1) ... [2019-01-01 23:48:02,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:48:02,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:48:02,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:48:02,647 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:48:02,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:02" (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-01 23:48:02,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:48:02,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:48:02,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:48:02,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:48:04,143 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:48:04,143 INFO L280 CfgBuilder]: Removed 196 assue(true) statements. [2019-01-01 23:48:04,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:48:04 BoogieIcfgContainer [2019-01-01 23:48:04,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:48:04,145 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:48:04,145 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:48:04,149 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:48:04,150 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:48:04,150 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:48:01" (1/3) ... [2019-01-01 23:48:04,151 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31b43315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:48:04, skipping insertion in model container [2019-01-01 23:48:04,151 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:48:04,152 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:02" (2/3) ... [2019-01-01 23:48:04,152 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31b43315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:48:04, skipping insertion in model container [2019-01-01 23:48:04,152 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:48:04,153 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:48:04" (3/3) ... [2019-01-01 23:48:04,155 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product47_false-unreach-call_false-termination.cil.c [2019-01-01 23:48:04,213 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:48:04,214 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:48:04,214 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:48:04,214 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:48:04,215 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:48:04,215 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:48:04,215 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:48:04,215 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:48:04,215 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:48:04,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states. [2019-01-01 23:48:04,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 83 [2019-01-01 23:48:04,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:48:04,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:48:04,278 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:48:04,279 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:48:04,279 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:48:04,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states. [2019-01-01 23:48:04,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 83 [2019-01-01 23:48:04,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:48:04,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:48:04,288 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:48:04,289 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:48:04,294 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(13);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(110, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 3 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string16.base, #t~string16.offset, 1);call write~init~int(80, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(117, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(109, #t~string16.base, 3 + #t~string16.offset, 1);call write~init~int(112, #t~string16.base, 4 + #t~string16.offset, 1);call write~init~int(58, #t~string16.base, 5 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 6 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(110, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string22.base, #t~string22.offset, 1);call write~init~int(32, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string24.base, #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 1 + #t~string24.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(21);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(30);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(25);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(13);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string67.base, #t~string67.offset, 1);call write~init~int(77, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(101, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(116, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(104, #t~string67.base, 4 + #t~string67.offset, 1);call write~init~int(58, #t~string67.base, 5 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 6 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string69.base, #t~string69.offset, 1);call write~init~int(82, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(73, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(84, #t~string69.base, 3 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 4 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string71.base, #t~string71.offset, 1);call write~init~int(75, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 2 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string73.base, #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 1 + #t~string73.offset, 1); 16#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; 10#L855true havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 32#L863true main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 54#L130true assume 0 != main_~tmp~0; 27#L103true havoc test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_#t~nondet4, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 116#L806-1true [2019-01-01 23:48:04,296 INFO L796 eck$LassoCheckResult]: Loop: 116#L806-1true assume !false; 122#L156true assume test_~splverifierCounter~0 < 4; 56#L157true test_~tmp~1 := test_#t~nondet1;havoc test_#t~nondet1; 70#L165true assume !(0 != test_~tmp~1); 95#L165-1true test_~tmp___0~0 := test_#t~nondet2;havoc test_#t~nondet2; 3#L175true assume !(0 != test_~tmp___0~0); 23#L175-1true test_~tmp___2~0 := test_#t~nondet3;havoc test_#t~nondet3; 55#L185true assume 0 != test_~tmp___2~0; 29#L191-1true assume !(0 != ~pumpRunning~0); 37#L227true assume !(0 != ~systemActive~0); 87#L234true havoc __utac_acc__Specification4_spec__1_#t~ret61, __utac_acc__Specification4_spec__1_#t~ret62, __utac_acc__Specification4_spec__1_~tmp~9, __utac_acc__Specification4_spec__1_~tmp___0~2;havoc __utac_acc__Specification4_spec__1_~tmp~9;havoc __utac_acc__Specification4_spec__1_~tmp___0~2;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; 25#L943true __utac_acc__Specification4_spec__1_#t~ret61 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~9 := __utac_acc__Specification4_spec__1_#t~ret61;havoc __utac_acc__Specification4_spec__1_#t~ret61; 114#L806true assume !(0 == __utac_acc__Specification4_spec__1_~tmp~9); 116#L806-1true [2019-01-01 23:48:04,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:04,303 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-01 23:48:04,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:04,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:04,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:04,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:48:04,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:05,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:05,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1670724661, now seen corresponding path program 1 times [2019-01-01 23:48:05,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:05,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:05,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:05,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:48:05,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:05,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:05,169 INFO L82 PathProgramCache]: Analyzing trace with hash 43554277, now seen corresponding path program 1 times [2019-01-01 23:48:05,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:05,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:05,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:05,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:48:05,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:48:05,446 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-01 23:48:05,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:48:05,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:48:05,645 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 23:48:05,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:48:05,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:48:05,743 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 6 states. [2019-01-01 23:48:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:48:06,310 INFO L93 Difference]: Finished difference Result 300 states and 426 transitions. [2019-01-01 23:48:06,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:48:06,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 426 transitions. [2019-01-01 23:48:06,335 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 193 [2019-01-01 23:48:06,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 279 states and 405 transitions. [2019-01-01 23:48:06,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 279 [2019-01-01 23:48:06,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 279 [2019-01-01 23:48:06,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 405 transitions. [2019-01-01 23:48:06,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:48:06,372 INFO L705 BuchiCegarLoop]: Abstraction has 279 states and 405 transitions. [2019-01-01 23:48:06,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 405 transitions. [2019-01-01 23:48:06,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 162. [2019-01-01 23:48:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-01 23:48:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2019-01-01 23:48:06,431 INFO L728 BuchiCegarLoop]: Abstraction has 162 states and 234 transitions. [2019-01-01 23:48:06,431 INFO L608 BuchiCegarLoop]: Abstraction has 162 states and 234 transitions. [2019-01-01 23:48:06,431 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:48:06,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 234 transitions. [2019-01-01 23:48:06,434 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 112 [2019-01-01 23:48:06,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:48:06,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:48:06,435 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:48:06,435 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:48:06,436 INFO L794 eck$LassoCheckResult]: Stem: 551#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(13);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(110, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 3 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string16.base, #t~string16.offset, 1);call write~init~int(80, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(117, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(109, #t~string16.base, 3 + #t~string16.offset, 1);call write~init~int(112, #t~string16.base, 4 + #t~string16.offset, 1);call write~init~int(58, #t~string16.base, 5 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 6 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(110, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string22.base, #t~string22.offset, 1);call write~init~int(32, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string24.base, #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 1 + #t~string24.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(21);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(30);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(25);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(13);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string67.base, #t~string67.offset, 1);call write~init~int(77, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(101, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(116, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(104, #t~string67.base, 4 + #t~string67.offset, 1);call write~init~int(58, #t~string67.base, 5 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 6 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string69.base, #t~string69.offset, 1);call write~init~int(82, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(73, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(84, #t~string69.base, 3 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 4 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string71.base, #t~string71.offset, 1);call write~init~int(75, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 2 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string73.base, #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 1 + #t~string73.offset, 1); 476#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; 464#L855 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 465#L863 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 506#L130 assume 0 != main_~tmp~0; 497#L103 havoc test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_#t~nondet4, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 498#L806-1 [2019-01-01 23:48:06,436 INFO L796 eck$LassoCheckResult]: Loop: 498#L806-1 assume !false; 564#L156 assume test_~splverifierCounter~0 < 4; 524#L157 test_~tmp~1 := test_#t~nondet1;havoc test_#t~nondet1; 525#L165 assume !(0 != test_~tmp~1); 534#L165-1 test_~tmp___0~0 := test_#t~nondet2;havoc test_#t~nondet2; 446#L175 assume !(0 != test_~tmp___0~0); 447#L175-1 test_~tmp___2~0 := test_#t~nondet3;havoc test_#t~nondet3; 490#L185 assume 0 != test_~tmp___2~0; 501#L191-1 assume !(0 != ~pumpRunning~0); 503#L227 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret6, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 472#L285 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret5, processEnvironment__wrappee__methaneQuery_~tmp~2;havoc processEnvironment__wrappee__methaneQuery_~tmp~2; 474#L259-1 assume !(0 == ~pumpRunning~0); 460#L234 havoc __utac_acc__Specification4_spec__1_#t~ret61, __utac_acc__Specification4_spec__1_#t~ret62, __utac_acc__Specification4_spec__1_~tmp~9, __utac_acc__Specification4_spec__1_~tmp___0~2;havoc __utac_acc__Specification4_spec__1_~tmp~9;havoc __utac_acc__Specification4_spec__1_~tmp___0~2;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; 493#L943 __utac_acc__Specification4_spec__1_#t~ret61 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~9 := __utac_acc__Specification4_spec__1_#t~ret61;havoc __utac_acc__Specification4_spec__1_#t~ret61; 494#L806 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~9); 498#L806-1 [2019-01-01 23:48:06,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:06,441 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-01 23:48:06,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:06,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:06,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:06,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:48:06,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:06,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:06,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1966055757, now seen corresponding path program 1 times [2019-01-01 23:48:06,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:06,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:06,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:06,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:48:06,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:48:06,819 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-01 23:48:06,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:48:06,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:48:06,820 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:48:06,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:48:06,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:48:06,821 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. cyclomatic complexity: 75 Second operand 3 states. [2019-01-01 23:48:07,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:48:07,492 INFO L93 Difference]: Finished difference Result 201 states and 274 transitions. [2019-01-01 23:48:07,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:48:07,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 201 states and 274 transitions. [2019-01-01 23:48:07,496 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 142 [2019-01-01 23:48:07,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 201 states to 201 states and 274 transitions. [2019-01-01 23:48:07,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2019-01-01 23:48:07,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2019-01-01 23:48:07,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 274 transitions. [2019-01-01 23:48:07,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:48:07,501 INFO L705 BuchiCegarLoop]: Abstraction has 201 states and 274 transitions. [2019-01-01 23:48:07,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states and 274 transitions. [2019-01-01 23:48:07,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-01-01 23:48:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-01 23:48:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 274 transitions. [2019-01-01 23:48:07,513 INFO L728 BuchiCegarLoop]: Abstraction has 201 states and 274 transitions. [2019-01-01 23:48:07,513 INFO L608 BuchiCegarLoop]: Abstraction has 201 states and 274 transitions. [2019-01-01 23:48:07,513 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:48:07,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 274 transitions. [2019-01-01 23:48:07,515 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 142 [2019-01-01 23:48:07,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:48:07,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:48:07,516 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:48:07,516 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:48:07,516 INFO L794 eck$LassoCheckResult]: Stem: 925#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(13);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(110, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 3 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string16.base, #t~string16.offset, 1);call write~init~int(80, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(117, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(109, #t~string16.base, 3 + #t~string16.offset, 1);call write~init~int(112, #t~string16.base, 4 + #t~string16.offset, 1);call write~init~int(58, #t~string16.base, 5 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 6 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(110, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string22.base, #t~string22.offset, 1);call write~init~int(32, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string24.base, #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 1 + #t~string24.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(21);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(30);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(25);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(13);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string67.base, #t~string67.offset, 1);call write~init~int(77, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(101, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(116, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(104, #t~string67.base, 4 + #t~string67.offset, 1);call write~init~int(58, #t~string67.base, 5 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 6 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string69.base, #t~string69.offset, 1);call write~init~int(82, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(73, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(84, #t~string69.base, 3 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 4 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string71.base, #t~string71.offset, 1);call write~init~int(75, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 2 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string73.base, #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 1 + #t~string73.offset, 1); 843#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; 832#L855 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 833#L863 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 874#L130 assume 0 != main_~tmp~0; 864#L103 havoc test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_#t~nondet4, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 865#L806-1 [2019-01-01 23:48:07,517 INFO L796 eck$LassoCheckResult]: Loop: 865#L806-1 assume !false; 939#L156 assume test_~splverifierCounter~0 < 4; 894#L157 test_~tmp~1 := test_#t~nondet1;havoc test_#t~nondet1; 895#L165 assume !(0 != test_~tmp~1); 907#L165-1 test_~tmp___0~0 := test_#t~nondet2;havoc test_#t~nondet2; 815#L175 assume !(0 != test_~tmp___0~0); 816#L175-1 test_~tmp___2~0 := test_#t~nondet3;havoc test_#t~nondet3; 857#L185 assume 0 != test_~tmp___2~0; 868#L191-1 assume !(0 != ~pumpRunning~0); 869#L227 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret6, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 840#L285 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret5, processEnvironment__wrappee__methaneQuery_~tmp~2;havoc processEnvironment__wrappee__methaneQuery_~tmp~2; 841#L259-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret25, isHighWaterLevel_~retValue_acc~3, isHighWaterLevel_~tmp~5, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~3;havoc isHighWaterLevel_~tmp~5;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 866#L951-1 assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~11 := 0;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 867#L956-1 isHighWaterLevel_#t~ret25 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~5 := isHighWaterLevel_#t~ret25;havoc isHighWaterLevel_#t~ret25; 889#L404-3 assume 0 != isHighWaterLevel_~tmp~5;isHighWaterLevel_~tmp___0~1 := 0; 938#L404-5 isHighWaterLevel_~retValue_acc~3 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~3; 905#L410-1 processEnvironment__wrappee__methaneQuery_#t~ret5 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~2 := processEnvironment__wrappee__methaneQuery_#t~ret5;havoc processEnvironment__wrappee__methaneQuery_#t~ret5; 827#L263-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~2); 828#L234 havoc __utac_acc__Specification4_spec__1_#t~ret61, __utac_acc__Specification4_spec__1_#t~ret62, __utac_acc__Specification4_spec__1_~tmp~9, __utac_acc__Specification4_spec__1_~tmp___0~2;havoc __utac_acc__Specification4_spec__1_~tmp~9;havoc __utac_acc__Specification4_spec__1_~tmp___0~2;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; 860#L943 __utac_acc__Specification4_spec__1_#t~ret61 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~9 := __utac_acc__Specification4_spec__1_#t~ret61;havoc __utac_acc__Specification4_spec__1_#t~ret61; 861#L806 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~9); 865#L806-1 [2019-01-01 23:48:07,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:07,517 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-01 23:48:07,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:07,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:07,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:07,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:48:07,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:07,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:07,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1687938725, now seen corresponding path program 1 times [2019-01-01 23:48:07,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:07,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:07,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:07,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:48:07,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:48:07,859 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-01 23:48:07,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:48:07,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:48:07,860 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:48:07,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 23:48:07,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 23:48:07,861 INFO L87 Difference]: Start difference. First operand 201 states and 274 transitions. cyclomatic complexity: 76 Second operand 4 states. [2019-01-01 23:48:08,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:48:08,444 INFO L93 Difference]: Finished difference Result 567 states and 762 transitions. [2019-01-01 23:48:08,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 23:48:08,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 567 states and 762 transitions. [2019-01-01 23:48:08,451 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 410 [2019-01-01 23:48:08,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 567 states to 567 states and 762 transitions. [2019-01-01 23:48:08,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 567 [2019-01-01 23:48:08,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 567 [2019-01-01 23:48:08,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 567 states and 762 transitions. [2019-01-01 23:48:08,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:48:08,460 INFO L705 BuchiCegarLoop]: Abstraction has 567 states and 762 transitions. [2019-01-01 23:48:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states and 762 transitions. [2019-01-01 23:48:08,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 213. [2019-01-01 23:48:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-01 23:48:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 286 transitions. [2019-01-01 23:48:08,474 INFO L728 BuchiCegarLoop]: Abstraction has 213 states and 286 transitions. [2019-01-01 23:48:08,474 INFO L608 BuchiCegarLoop]: Abstraction has 213 states and 286 transitions. [2019-01-01 23:48:08,474 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:48:08,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 213 states and 286 transitions. [2019-01-01 23:48:08,476 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 150 [2019-01-01 23:48:08,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:48:08,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:48:08,477 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:48:08,478 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:48:08,478 INFO L794 eck$LassoCheckResult]: Stem: 1714#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(13);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(110, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 3 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string16.base, #t~string16.offset, 1);call write~init~int(80, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(117, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(109, #t~string16.base, 3 + #t~string16.offset, 1);call write~init~int(112, #t~string16.base, 4 + #t~string16.offset, 1);call write~init~int(58, #t~string16.base, 5 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 6 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(110, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string22.base, #t~string22.offset, 1);call write~init~int(32, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string24.base, #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 1 + #t~string24.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(21);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(30);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(25);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(13);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string67.base, #t~string67.offset, 1);call write~init~int(77, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(101, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(116, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(104, #t~string67.base, 4 + #t~string67.offset, 1);call write~init~int(58, #t~string67.base, 5 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 6 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string69.base, #t~string69.offset, 1);call write~init~int(82, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(73, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(84, #t~string69.base, 3 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 4 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string71.base, #t~string71.offset, 1);call write~init~int(75, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 2 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string73.base, #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 1 + #t~string73.offset, 1); 1621#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; 1610#L855 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 1611#L863 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 1658#L130 assume 0 != main_~tmp~0; 1646#L103 havoc test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_#t~nondet4, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1647#L806-1 [2019-01-01 23:48:08,478 INFO L796 eck$LassoCheckResult]: Loop: 1647#L806-1 assume !false; 1794#L156 assume test_~splverifierCounter~0 < 4; 1793#L157 test_~tmp~1 := test_#t~nondet1;havoc test_#t~nondet1; 1792#L165 assume !(0 != test_~tmp~1); 1788#L165-1 test_~tmp___0~0 := test_#t~nondet2;havoc test_#t~nondet2; 1785#L175 assume !(0 != test_~tmp___0~0); 1782#L175-1 test_~tmp___2~0 := test_#t~nondet3;havoc test_#t~nondet3; 1778#L185 assume 0 != test_~tmp___2~0; 1776#L191-1 assume !(0 != ~pumpRunning~0); 1662#L227 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret6, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 1618#L285 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret5, processEnvironment__wrappee__methaneQuery_~tmp~2;havoc processEnvironment__wrappee__methaneQuery_~tmp~2; 1619#L259-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret25, isHighWaterLevel_~retValue_acc~3, isHighWaterLevel_~tmp~5, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~3;havoc isHighWaterLevel_~tmp~5;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 1648#L951-1 assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~11 := 0;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 1649#L956-1 isHighWaterLevel_#t~ret25 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~5 := isHighWaterLevel_#t~ret25;havoc isHighWaterLevel_#t~ret25; 1731#L404-3 assume !(0 != isHighWaterLevel_~tmp~5);isHighWaterLevel_~tmp___0~1 := 1; 1732#L404-5 isHighWaterLevel_~retValue_acc~3 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~3; 1692#L410-1 processEnvironment__wrappee__methaneQuery_#t~ret5 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~2 := processEnvironment__wrappee__methaneQuery_#t~ret5;havoc processEnvironment__wrappee__methaneQuery_#t~ret5; 1605#L263-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~2); 1606#L234 havoc __utac_acc__Specification4_spec__1_#t~ret61, __utac_acc__Specification4_spec__1_#t~ret62, __utac_acc__Specification4_spec__1_~tmp~9, __utac_acc__Specification4_spec__1_~tmp___0~2;havoc __utac_acc__Specification4_spec__1_~tmp~9;havoc __utac_acc__Specification4_spec__1_~tmp___0~2;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; 1712#L943 __utac_acc__Specification4_spec__1_#t~ret61 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~9 := __utac_acc__Specification4_spec__1_#t~ret61;havoc __utac_acc__Specification4_spec__1_#t~ret61; 1796#L806 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~9); 1647#L806-1 [2019-01-01 23:48:08,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:08,479 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2019-01-01 23:48:08,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:08,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:08,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:08,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:48:08,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:08,654 INFO L82 PathProgramCache]: Analyzing trace with hash 87068637, now seen corresponding path program 1 times [2019-01-01 23:48:08,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:08,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:08,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:08,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:48:08,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:48:08,931 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-01 23:48:08,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:48:08,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:48:08,931 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:48:08,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:48:08,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:48:08,933 INFO L87 Difference]: Start difference. First operand 213 states and 286 transitions. cyclomatic complexity: 76 Second operand 5 states. [2019-01-01 23:48:09,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:48:09,588 INFO L93 Difference]: Finished difference Result 660 states and 880 transitions. [2019-01-01 23:48:09,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:48:09,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 880 transitions. [2019-01-01 23:48:09,596 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 484 [2019-01-01 23:48:09,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 880 transitions. [2019-01-01 23:48:09,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2019-01-01 23:48:09,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2019-01-01 23:48:09,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 880 transitions. [2019-01-01 23:48:09,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:48:09,604 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 880 transitions. [2019-01-01 23:48:09,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 880 transitions. [2019-01-01 23:48:09,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 231. [2019-01-01 23:48:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-01 23:48:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 304 transitions. [2019-01-01 23:48:09,615 INFO L728 BuchiCegarLoop]: Abstraction has 231 states and 304 transitions. [2019-01-01 23:48:09,615 INFO L608 BuchiCegarLoop]: Abstraction has 231 states and 304 transitions. [2019-01-01 23:48:09,616 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:48:09,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 304 transitions. [2019-01-01 23:48:09,617 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 162 [2019-01-01 23:48:09,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:48:09,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:48:09,618 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:48:09,618 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:48:09,619 INFO L794 eck$LassoCheckResult]: Stem: 2609#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(13);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(110, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 3 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string16.base, #t~string16.offset, 1);call write~init~int(80, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(117, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(109, #t~string16.base, 3 + #t~string16.offset, 1);call write~init~int(112, #t~string16.base, 4 + #t~string16.offset, 1);call write~init~int(58, #t~string16.base, 5 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 6 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(110, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string22.base, #t~string22.offset, 1);call write~init~int(32, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string24.base, #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 1 + #t~string24.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(21);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(30);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(25);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(13);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string67.base, #t~string67.offset, 1);call write~init~int(77, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(101, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(116, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(104, #t~string67.base, 4 + #t~string67.offset, 1);call write~init~int(58, #t~string67.base, 5 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 6 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string69.base, #t~string69.offset, 1);call write~init~int(82, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(73, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(84, #t~string69.base, 3 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 4 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string71.base, #t~string71.offset, 1);call write~init~int(75, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 2 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string73.base, #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 1 + #t~string73.offset, 1); 2507#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; 2497#L855 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 2498#L863 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 2543#L130 assume 0 != main_~tmp~0; 2531#L103 havoc test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_#t~nondet4, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 2532#L806-1 [2019-01-01 23:48:09,619 INFO L796 eck$LassoCheckResult]: Loop: 2532#L806-1 assume !false; 2632#L156 assume test_~splverifierCounter~0 < 4; 2566#L157 test_~tmp~1 := test_#t~nondet1;havoc test_#t~nondet1; 2567#L165 assume !(0 != test_~tmp~1); 2582#L165-1 test_~tmp___0~0 := test_#t~nondet2;havoc test_#t~nondet2; 2618#L175 assume !(0 != test_~tmp___0~0); 2702#L175-1 test_~tmp___2~0 := test_#t~nondet3;havoc test_#t~nondet3; 2565#L185 assume 0 != test_~tmp___2~0; 2536#L191-1 assume !(0 != ~pumpRunning~0); 2537#L227 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret6, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 2504#L285 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret5, processEnvironment__wrappee__methaneQuery_~tmp~2;havoc processEnvironment__wrappee__methaneQuery_~tmp~2; 2505#L259-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret25, isHighWaterLevel_~retValue_acc~3, isHighWaterLevel_~tmp~5, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~3;havoc isHighWaterLevel_~tmp~5;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 2533#L951-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 2535#L956-1 isHighWaterLevel_#t~ret25 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~5 := isHighWaterLevel_#t~ret25;havoc isHighWaterLevel_#t~ret25; 2560#L404-3 assume 0 != isHighWaterLevel_~tmp~5;isHighWaterLevel_~tmp___0~1 := 0; 2633#L404-5 isHighWaterLevel_~retValue_acc~3 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~3; 2579#L410-1 processEnvironment__wrappee__methaneQuery_#t~ret5 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~2 := processEnvironment__wrappee__methaneQuery_#t~ret5;havoc processEnvironment__wrappee__methaneQuery_#t~ret5; 2580#L263-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~2); 2502#L234 havoc __utac_acc__Specification4_spec__1_#t~ret61, __utac_acc__Specification4_spec__1_#t~ret62, __utac_acc__Specification4_spec__1_~tmp~9, __utac_acc__Specification4_spec__1_~tmp___0~2;havoc __utac_acc__Specification4_spec__1_~tmp~9;havoc __utac_acc__Specification4_spec__1_~tmp___0~2;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; 2706#L943 __utac_acc__Specification4_spec__1_#t~ret61 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~9 := __utac_acc__Specification4_spec__1_#t~ret61;havoc __utac_acc__Specification4_spec__1_#t~ret61; 2704#L806 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~9); 2532#L806-1 [2019-01-01 23:48:09,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:09,619 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 5 times [2019-01-01 23:48:09,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:09,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:09,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:09,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:48:09,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:09,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:09,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1926970201, now seen corresponding path program 1 times [2019-01-01 23:48:09,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:09,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:09,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:09,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:48:09,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:09,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:09,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1911925901, now seen corresponding path program 1 times [2019-01-01 23:48:09,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:09,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:09,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:09,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:48:09,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:11,057 WARN L181 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-01-01 23:48:11,185 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-01 23:48:37,127 WARN L181 SmtUtils]: Spent 25.94 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-01 23:48:52,193 WARN L181 SmtUtils]: Spent 15.06 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-01 23:48:52,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:48:52 BoogieIcfgContainer [2019-01-01 23:48:52,268 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:48:52,268 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:48:52,268 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:48:52,269 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:48:52,269 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:48:04" (3/4) ... [2019-01-01 23:48:52,275 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:48:52,358 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:48:52,359 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:48:52,360 INFO L168 Benchmark]: Toolchain (without parser) took 50622.90 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.1 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -360.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:48:52,361 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:48:52,362 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:52,362 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:48:52,363 INFO L168 Benchmark]: Boogie Preprocessor took 66.05 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:52,363 INFO L168 Benchmark]: RCFGBuilder took 1497.39 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: 60.7 MB). Peak memory consumption was 60.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:52,366 INFO L168 Benchmark]: BuchiAutomizer took 48123.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -261.0 MB). Peak memory consumption was 410.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:52,368 INFO L168 Benchmark]: Witness Printer took 90.37 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:52,372 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 754.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.05 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1497.39 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: 60.7 MB). Peak memory consumption was 60.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 48123.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -261.0 MB). Peak memory consumption was 410.4 MB. Max. memory is 11.5 GB. * Witness Printer took 90.37 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 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 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 231 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 48.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 45.2s. Construction of modules took 2.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 900 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 231 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 957 SDtfs, 1733 SDslu, 1855 SDs, 0 SdLazy, 224 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 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: 155]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=4891} State at position 1 is {NULL=0, NULL=0, NULL=-1, NULL=-14, retValue_acc=0, NULL=0, retValue_acc=1, NULL=4891, NULL=-12, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72393820=0, NULL=-18, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@403f5d69=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68cf9bf=61, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@494e48aa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59572497=0, NULL=-13, methaneLevelCritical=0, tmp___0=0, NULL=0, retValue_acc=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e2e013d=0, tmp___1=0, NULL=-2, cleanupTimeShifts=4, tmp=0, NULL=-22, NULL=-4, tmp___0=0, NULL=4890, NULL=0, systemActive=1, waterLevel=1, NULL=-15, \result=1, NULL=0, NULL=-10, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a53ec2a=0, NULL=0, NULL=0, NULL=4889, \result=0, NULL=0, NULL=-3, NULL=-7, NULL=0, tmp___0=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, \result=1, NULL=-23, head=0, pumpRunning=0, tmp=1, NULL=-9, NULL=-16, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55c3bfd8=0, NULL=0, NULL=0, \result=1, NULL=-11, NULL=-5, NULL=-8, retValue_acc=1, NULL=0, NULL=0, tmp___2=61, tmp=1, retValue_acc=1, tmp=1, splverifierCounter=0, NULL=-19, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ba2b78d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@693fdaa2=0, tmp=0, head=0, NULL=-6, NULL=0, NULL=0, NULL=-20, NULL=0, NULL=-21, NULL=0, NULL=-17, tmp=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L40] int cleanupTimeShifts = 4; [L219] int pumpRunning = 0; [L220] int systemActive = 1; [L599] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L868] int waterLevel = 1; [L869] int methaneLevelCritical = 0; [L121] int retValue_acc ; [L122] int tmp ; [L859] int retValue_acc ; [L862] retValue_acc = 1 [L863] return (retValue_acc); [L128] tmp = valid_product() [L130] COND TRUE \read(tmp) [L146] int splverifierCounter ; [L147] int tmp ; [L148] int tmp___0 ; [L149] int tmp___1 ; [L150] int tmp___2 ; [L153] splverifierCounter = 0 Loop: [L155] COND TRUE 1 [L157] COND TRUE splverifierCounter < 4 [L163] tmp = __VERIFIER_nondet_int() [L165] COND FALSE !(\read(tmp)) [L173] tmp___0 = __VERIFIER_nondet_int() [L175] COND FALSE !(\read(tmp___0)) [L183] tmp___2 = __VERIFIER_nondet_int() [L185] COND TRUE \read(tmp___2) [L227] COND FALSE !(\read(pumpRunning)) [L234] COND TRUE \read(systemActive) [L282] int tmp ; [L285] COND FALSE !(\read(pumpRunning)) [L256] int tmp ; [L259] COND TRUE ! pumpRunning [L396] int retValue_acc ; [L397] int tmp ; [L398] int tmp___0 ; [L948] int retValue_acc ; [L951] COND TRUE waterLevel < 2 [L952] retValue_acc = 1 [L953] return (retValue_acc); [L402] tmp = isHighWaterSensorDry() [L404] COND TRUE \read(tmp) [L405] tmp___0 = 0 [L409] retValue_acc = tmp___0 [L410] return (retValue_acc); [L261] tmp = isHighWaterLevel() [L263] COND FALSE !(\read(tmp)) [L799] int tmp ; [L800] int tmp___0 ; [L939] int retValue_acc ; [L942] retValue_acc = waterLevel [L943] return (retValue_acc); [L804] tmp = getWaterLevel() [L806] COND FALSE !(tmp == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...