./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec2_product57_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec2_product57_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 57406ed1e8515a3807c9750d676c6ccf8b3f94ad ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:21:00,160 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:21:00,162 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:21:00,174 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:21:00,174 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:21:00,175 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:21:00,176 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:21:00,178 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:21:00,180 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:21:00,181 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:21:00,182 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:21:00,183 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:21:00,184 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:21:00,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:21:00,186 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:21:00,187 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:21:00,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:21:00,189 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:21:00,192 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:21:00,193 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:21:00,194 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:21:00,196 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:21:00,198 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:21:00,199 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:21:00,199 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:21:00,200 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:21:00,201 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:21:00,202 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:21:00,203 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:21:00,204 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:21:00,204 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:21:00,205 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:21:00,205 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:21:00,206 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:21:00,207 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:21:00,208 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:21:00,208 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:21:00,228 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:21:00,229 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:21:00,232 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:21:00,234 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:21:00,234 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:21:00,234 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:21:00,234 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:21:00,235 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:21:00,236 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:21:00,236 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:21:00,236 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:21:00,236 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:21:00,236 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:21:00,237 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:21:00,237 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:21:00,237 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:21:00,237 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:21:00,237 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:21:00,237 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:21:00,238 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:21:00,239 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:21:00,240 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:21:00,240 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:21:00,240 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:21:00,240 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:21:00,240 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:21:00,240 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:21:00,241 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:21:00,243 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:21:00,243 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:21:00,244 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:21:00,245 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:21:00,246 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 -> 57406ed1e8515a3807c9750d676c6ccf8b3f94ad [2019-01-14 04:21:00,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:21:00,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:21:00,333 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:21:00,334 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:21:00,335 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:21:00,335 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec2_product57_true-unreach-call_false-termination.cil.c [2019-01-14 04:21:00,395 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af142cc24/f409edc68f0348a79e4c0fbd7db5de25/FLAGde2987ed3 [2019-01-14 04:21:00,880 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:21:00,881 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec2_product57_true-unreach-call_false-termination.cil.c [2019-01-14 04:21:00,903 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af142cc24/f409edc68f0348a79e4c0fbd7db5de25/FLAGde2987ed3 [2019-01-14 04:21:01,171 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af142cc24/f409edc68f0348a79e4c0fbd7db5de25 [2019-01-14 04:21:01,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:21:01,176 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:21:01,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:21:01,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:21:01,181 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:21:01,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:21:01" (1/1) ... [2019-01-14 04:21:01,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13568bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:01, skipping insertion in model container [2019-01-14 04:21:01,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:21:01" (1/1) ... [2019-01-14 04:21:01,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:21:01,246 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:21:01,658 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:21:01,686 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:21:01,763 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:21:01,806 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:21:01,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:01 WrapperNode [2019-01-14 04:21:01,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:21:01,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:21:01,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:21:01,809 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:21:01,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:01" (1/1) ... [2019-01-14 04:21:01,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:01" (1/1) ... [2019-01-14 04:21:01,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:21:01,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:21:01,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:21:01,992 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:21:02,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:01" (1/1) ... [2019-01-14 04:21:02,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:01" (1/1) ... [2019-01-14 04:21:02,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:01" (1/1) ... [2019-01-14 04:21:02,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:01" (1/1) ... [2019-01-14 04:21:02,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:01" (1/1) ... [2019-01-14 04:21:02,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:01" (1/1) ... [2019-01-14 04:21:02,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:01" (1/1) ... [2019-01-14 04:21:02,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:21:02,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:21:02,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:21:02,045 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:21:02,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:21:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:21:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:21:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:21:02,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:21:03,565 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:21:03,565 INFO L286 CfgBuilder]: Removed 194 assue(true) statements. [2019-01-14 04:21:03,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:21:03 BoogieIcfgContainer [2019-01-14 04:21:03,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:21:03,568 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:21:03,568 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:21:03,572 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:21:03,576 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:21:03,576 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:21:01" (1/3) ... [2019-01-14 04:21:03,578 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@704a1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:21:03, skipping insertion in model container [2019-01-14 04:21:03,578 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:21:03,579 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:01" (2/3) ... [2019-01-14 04:21:03,579 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@704a1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:21:03, skipping insertion in model container [2019-01-14 04:21:03,579 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:21:03,580 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:21:03" (3/3) ... [2019-01-14 04:21:03,583 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec2_product57_true-unreach-call_false-termination.cil.c [2019-01-14 04:21:03,648 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:21:03,649 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:21:03,649 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:21:03,650 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:21:03,650 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:21:03,651 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:21:03,651 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:21:03,651 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:21:03,651 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:21:03,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states. [2019-01-14 04:21:03,720 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2019-01-14 04:21:03,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:21:03,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:21:03,730 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:03,730 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:03,730 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:21:03,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states. [2019-01-14 04:21:03,740 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2019-01-14 04:21:03,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:21:03,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:21:03,742 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:03,742 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:03,749 INFO L794 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~cleanupTimeShifts~0 := 4;~methAndRunningLastTime~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(110, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string25.base, #t~string25.offset, 1);call write~init~int(80, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(117, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(109, #t~string25.base, 3 + #t~string25.offset, 1);call write~init~int(112, #t~string25.base, 4 + #t~string25.offset, 1);call write~init~int(58, #t~string25.base, 5 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 6 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string31.base, #t~string31.offset, 1);call write~init~int(32, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 2 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string33.base, #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 1 + #t~string33.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(9);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(21);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(30);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(9);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(21);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(30);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(9);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(25); 13#L-1true havoc main_#res;havoc main_#t~ret11, main_~retValue_acc~6, main_~tmp~0;havoc main_~retValue_acc~6;havoc main_~tmp~0; 16#L65true havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 12#L73true main_#t~ret11 := valid_product_#res;main_~tmp~0 := main_#t~ret11;havoc main_#t~ret11; 48#L276true assume 0 != main_~tmp~0; 124#L250true ~methAndRunningLastTime~0 := 0; 70#L298true havoc test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~3, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~3;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 49#L309-1true [2019-01-14 04:21:03,749 INFO L796 eck$LassoCheckResult]: Loop: 49#L309-1true assume !false; 113#L559true assume test_~splverifierCounter~0 < 4; 34#L560true test_~tmp~7 := test_#t~nondet36;havoc test_#t~nondet36; 37#L568true assume !(0 != test_~tmp~7); 39#L568-1true test_~tmp___0~3 := test_#t~nondet37;havoc test_#t~nondet37; 117#L578true assume !(0 != test_~tmp___0~3); 119#L578-1true test_~tmp___2~0 := test_#t~nondet38;havoc test_#t~nondet38; 7#L588true assume 0 != test_~tmp___2~0; 133#L594-2true assume !(0 != ~pumpRunning~0); 14#L340true assume !(0 != ~systemActive~0); 108#L347true havoc __utac_acc__Specification2_spec__2_#t~ret12, __utac_acc__Specification2_spec__2_#t~ret13, __utac_acc__Specification2_spec__2_~tmp~1, __utac_acc__Specification2_spec__2_~tmp___0~0;havoc __utac_acc__Specification2_spec__2_~tmp~1;havoc __utac_acc__Specification2_spec__2_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 126#L129-2true __utac_acc__Specification2_spec__2_#t~ret12 := isMethaneLevelCritical_#res;__utac_acc__Specification2_spec__2_~tmp~1 := __utac_acc__Specification2_spec__2_#t~ret12;havoc __utac_acc__Specification2_spec__2_#t~ret12; 65#L309true assume !(0 != __utac_acc__Specification2_spec__2_~tmp~1);~methAndRunningLastTime~0 := 0; 49#L309-1true [2019-01-14 04:21:03,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:03,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-14 04:21:03,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:03,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:03,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:03,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:21:03,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:04,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:04,770 INFO L82 PathProgramCache]: Analyzing trace with hash 5185098, now seen corresponding path program 1 times [2019-01-14 04:21:04,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:04,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:04,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:04,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:21:04,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:04,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:04,795 INFO L82 PathProgramCache]: Analyzing trace with hash 838481604, now seen corresponding path program 1 times [2019-01-14 04:21:04,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:04,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:04,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:04,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:21:04,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:21:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:21:05,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:21:05,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:21:05,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:21:05,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:21:05,262 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 6 states. [2019-01-14 04:21:05,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:21:05,484 INFO L93 Difference]: Finished difference Result 136 states and 194 transitions. [2019-01-14 04:21:05,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:21:05,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 194 transitions. [2019-01-14 04:21:05,499 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-01-14 04:21:05,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 129 states and 187 transitions. [2019-01-14 04:21:05,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2019-01-14 04:21:05,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2019-01-14 04:21:05,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 187 transitions. [2019-01-14 04:21:05,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:21:05,511 INFO L706 BuchiCegarLoop]: Abstraction has 129 states and 187 transitions. [2019-01-14 04:21:05,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 187 transitions. [2019-01-14 04:21:05,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-01-14 04:21:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 04:21:05,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 187 transitions. [2019-01-14 04:21:05,550 INFO L729 BuchiCegarLoop]: Abstraction has 129 states and 187 transitions. [2019-01-14 04:21:05,550 INFO L609 BuchiCegarLoop]: Abstraction has 129 states and 187 transitions. [2019-01-14 04:21:05,550 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:21:05,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 187 transitions. [2019-01-14 04:21:05,553 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-01-14 04:21:05,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:21:05,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:21:05,554 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:05,555 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:05,555 INFO L794 eck$LassoCheckResult]: Stem: 418#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~cleanupTimeShifts~0 := 4;~methAndRunningLastTime~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(110, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string25.base, #t~string25.offset, 1);call write~init~int(80, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(117, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(109, #t~string25.base, 3 + #t~string25.offset, 1);call write~init~int(112, #t~string25.base, 4 + #t~string25.offset, 1);call write~init~int(58, #t~string25.base, 5 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 6 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string31.base, #t~string31.offset, 1);call write~init~int(32, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 2 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string33.base, #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 1 + #t~string33.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(9);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(21);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(30);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(9);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(21);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(30);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(9);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(25); 314#L-1 havoc main_#res;havoc main_#t~ret11, main_~retValue_acc~6, main_~tmp~0;havoc main_~retValue_acc~6;havoc main_~tmp~0; 315#L65 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 312#L73 main_#t~ret11 := valid_product_#res;main_~tmp~0 := main_#t~ret11;havoc main_#t~ret11; 313#L276 assume 0 != main_~tmp~0; 360#L250 ~methAndRunningLastTime~0 := 0; 390#L298 havoc test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~3, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~3;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 361#L309-1 [2019-01-14 04:21:05,555 INFO L796 eck$LassoCheckResult]: Loop: 361#L309-1 assume !false; 362#L559 assume test_~splverifierCounter~0 < 4; 345#L560 test_~tmp~7 := test_#t~nondet36;havoc test_#t~nondet36; 346#L568 assume !(0 != test_~tmp~7); 351#L568-1 test_~tmp___0~3 := test_#t~nondet37;havoc test_#t~nondet37; 354#L578 assume !(0 != test_~tmp___0~3); 383#L578-1 test_~tmp___2~0 := test_#t~nondet38;havoc test_#t~nondet38; 301#L588 assume 0 != test_~tmp___2~0; 303#L594-2 assume !(0 != ~pumpRunning~0); 316#L340 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret15, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 290#L398 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret14, processEnvironment__wrappee__highWaterSensor_~tmp~2;havoc processEnvironment__wrappee__highWaterSensor_~tmp~2; 291#L372-1 assume !(0 == ~pumpRunning~0); 295#L347 havoc __utac_acc__Specification2_spec__2_#t~ret12, __utac_acc__Specification2_spec__2_#t~ret13, __utac_acc__Specification2_spec__2_~tmp~1, __utac_acc__Specification2_spec__2_~tmp___0~0;havoc __utac_acc__Specification2_spec__2_~tmp~1;havoc __utac_acc__Specification2_spec__2_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 413#L129-2 __utac_acc__Specification2_spec__2_#t~ret12 := isMethaneLevelCritical_#res;__utac_acc__Specification2_spec__2_~tmp~1 := __utac_acc__Specification2_spec__2_#t~ret12;havoc __utac_acc__Specification2_spec__2_#t~ret12; 381#L309 assume !(0 != __utac_acc__Specification2_spec__2_~tmp~1);~methAndRunningLastTime~0 := 0; 361#L309-1 [2019-01-14 04:21:05,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:05,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-14 04:21:05,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:05,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:05,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:05,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:21:05,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:06,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:06,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1702188339, now seen corresponding path program 1 times [2019-01-14 04:21:06,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:06,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:06,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:06,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:21:06,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:21:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:21:06,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:21:06,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:21:06,096 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:21:06,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:21:06,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:21:06,097 INFO L87 Difference]: Start difference. First operand 129 states and 187 transitions. cyclomatic complexity: 60 Second operand 3 states. [2019-01-14 04:21:06,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:21:06,302 INFO L93 Difference]: Finished difference Result 173 states and 241 transitions. [2019-01-14 04:21:06,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:21:06,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 241 transitions. [2019-01-14 04:21:06,309 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 118 [2019-01-14 04:21:06,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 173 states and 241 transitions. [2019-01-14 04:21:06,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2019-01-14 04:21:06,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2019-01-14 04:21:06,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 241 transitions. [2019-01-14 04:21:06,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:21:06,314 INFO L706 BuchiCegarLoop]: Abstraction has 173 states and 241 transitions. [2019-01-14 04:21:06,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 241 transitions. [2019-01-14 04:21:06,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-01-14 04:21:06,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-14 04:21:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 241 transitions. [2019-01-14 04:21:06,326 INFO L729 BuchiCegarLoop]: Abstraction has 173 states and 241 transitions. [2019-01-14 04:21:06,326 INFO L609 BuchiCegarLoop]: Abstraction has 173 states and 241 transitions. [2019-01-14 04:21:06,327 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:21:06,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 241 transitions. [2019-01-14 04:21:06,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 118 [2019-01-14 04:21:06,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:21:06,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:21:06,332 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:06,332 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:06,333 INFO L794 eck$LassoCheckResult]: Stem: 734#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~cleanupTimeShifts~0 := 4;~methAndRunningLastTime~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(110, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string25.base, #t~string25.offset, 1);call write~init~int(80, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(117, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(109, #t~string25.base, 3 + #t~string25.offset, 1);call write~init~int(112, #t~string25.base, 4 + #t~string25.offset, 1);call write~init~int(58, #t~string25.base, 5 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 6 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string31.base, #t~string31.offset, 1);call write~init~int(32, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 2 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string33.base, #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 1 + #t~string33.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(9);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(21);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(30);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(9);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(21);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(30);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(9);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(25); 620#L-1 havoc main_#res;havoc main_#t~ret11, main_~retValue_acc~6, main_~tmp~0;havoc main_~retValue_acc~6;havoc main_~tmp~0; 621#L65 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 617#L73 main_#t~ret11 := valid_product_#res;main_~tmp~0 := main_#t~ret11;havoc main_#t~ret11; 618#L276 assume 0 != main_~tmp~0; 669#L250 ~methAndRunningLastTime~0 := 0; 702#L298 havoc test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~3, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~3;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 670#L309-1 [2019-01-14 04:21:06,333 INFO L796 eck$LassoCheckResult]: Loop: 670#L309-1 assume !false; 671#L559 assume test_~splverifierCounter~0 < 4; 652#L560 test_~tmp~7 := test_#t~nondet36;havoc test_#t~nondet36; 653#L568 assume !(0 != test_~tmp~7); 659#L568-1 test_~tmp___0~3 := test_#t~nondet37;havoc test_#t~nondet37; 663#L578 assume !(0 != test_~tmp___0~3); 693#L578-1 test_~tmp___2~0 := test_#t~nondet38;havoc test_#t~nondet38; 609#L588 assume 0 != test_~tmp___2~0; 611#L594-2 assume !(0 != ~pumpRunning~0); 619#L340 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret15, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 598#L398 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret14, processEnvironment__wrappee__highWaterSensor_~tmp~2;havoc processEnvironment__wrappee__highWaterSensor_~tmp~2; 599#L372-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret34, isHighWaterLevel_~retValue_acc~9, isHighWaterLevel_~tmp~5, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~9;havoc isHighWaterLevel_~tmp~5;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~4;havoc isHighWaterSensorDry_~retValue_acc~4; 633#L169-1 assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~4 := 0;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~4; 634#L174-1 isHighWaterLevel_#t~ret34 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~5 := isHighWaterLevel_#t~ret34;havoc isHighWaterLevel_#t~ret34; 688#L518-3 assume 0 != isHighWaterLevel_~tmp~5;isHighWaterLevel_~tmp___0~1 := 0; 689#L518-5 isHighWaterLevel_~retValue_acc~9 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~9; 665#L524-1 processEnvironment__wrappee__highWaterSensor_#t~ret14 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~2 := processEnvironment__wrappee__highWaterSensor_#t~ret14;havoc processEnvironment__wrappee__highWaterSensor_#t~ret14; 605#L376-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~2); 602#L347 havoc __utac_acc__Specification2_spec__2_#t~ret12, __utac_acc__Specification2_spec__2_#t~ret13, __utac_acc__Specification2_spec__2_~tmp~1, __utac_acc__Specification2_spec__2_~tmp___0~0;havoc __utac_acc__Specification2_spec__2_~tmp~1;havoc __utac_acc__Specification2_spec__2_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 727#L129-2 __utac_acc__Specification2_spec__2_#t~ret12 := isMethaneLevelCritical_#res;__utac_acc__Specification2_spec__2_~tmp~1 := __utac_acc__Specification2_spec__2_#t~ret12;havoc __utac_acc__Specification2_spec__2_#t~ret12; 691#L309 assume !(0 != __utac_acc__Specification2_spec__2_~tmp~1);~methAndRunningLastTime~0 := 0; 670#L309-1 [2019-01-14 04:21:06,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:06,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-14 04:21:06,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:06,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:06,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:06,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:21:06,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:06,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:06,723 INFO L82 PathProgramCache]: Analyzing trace with hash -926194367, now seen corresponding path program 1 times [2019-01-14 04:21:06,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:06,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:06,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:06,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:21:06,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:21:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:21:06,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:21:06,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:21:06,860 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:21:06,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:21:06,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:21:06,861 INFO L87 Difference]: Start difference. First operand 173 states and 241 transitions. cyclomatic complexity: 70 Second operand 4 states. [2019-01-14 04:21:07,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:21:07,891 INFO L93 Difference]: Finished difference Result 481 states and 661 transitions. [2019-01-14 04:21:07,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:21:07,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 481 states and 661 transitions. [2019-01-14 04:21:07,907 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 338 [2019-01-14 04:21:07,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 481 states to 481 states and 661 transitions. [2019-01-14 04:21:07,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 481 [2019-01-14 04:21:07,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 481 [2019-01-14 04:21:07,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 481 states and 661 transitions. [2019-01-14 04:21:07,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:21:07,932 INFO L706 BuchiCegarLoop]: Abstraction has 481 states and 661 transitions. [2019-01-14 04:21:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states and 661 transitions. [2019-01-14 04:21:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 185. [2019-01-14 04:21:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-14 04:21:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 253 transitions. [2019-01-14 04:21:07,971 INFO L729 BuchiCegarLoop]: Abstraction has 185 states and 253 transitions. [2019-01-14 04:21:07,971 INFO L609 BuchiCegarLoop]: Abstraction has 185 states and 253 transitions. [2019-01-14 04:21:07,971 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:21:07,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 253 transitions. [2019-01-14 04:21:07,975 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 126 [2019-01-14 04:21:07,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:21:07,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:21:07,978 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:07,978 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:07,978 INFO L794 eck$LassoCheckResult]: Stem: 1405#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~cleanupTimeShifts~0 := 4;~methAndRunningLastTime~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(110, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string25.base, #t~string25.offset, 1);call write~init~int(80, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(117, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(109, #t~string25.base, 3 + #t~string25.offset, 1);call write~init~int(112, #t~string25.base, 4 + #t~string25.offset, 1);call write~init~int(58, #t~string25.base, 5 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 6 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string31.base, #t~string31.offset, 1);call write~init~int(32, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 2 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string33.base, #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 1 + #t~string33.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(9);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(21);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(30);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(9);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(21);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(30);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(9);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(25); 1284#L-1 havoc main_#res;havoc main_#t~ret11, main_~retValue_acc~6, main_~tmp~0;havoc main_~retValue_acc~6;havoc main_~tmp~0; 1285#L65 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 1281#L73 main_#t~ret11 := valid_product_#res;main_~tmp~0 := main_#t~ret11;havoc main_#t~ret11; 1282#L276 assume 0 != main_~tmp~0; 1339#L250 ~methAndRunningLastTime~0 := 0; 1372#L298 havoc test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~3, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~3;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1340#L309-1 [2019-01-14 04:21:07,978 INFO L796 eck$LassoCheckResult]: Loop: 1340#L309-1 assume !false; 1341#L559 assume test_~splverifierCounter~0 < 4; 1320#L560 test_~tmp~7 := test_#t~nondet36;havoc test_#t~nondet36; 1321#L568 assume !(0 != test_~tmp~7); 1329#L568-1 test_~tmp___0~3 := test_#t~nondet37;havoc test_#t~nondet37; 1330#L578 assume !(0 != test_~tmp___0~3); 1362#L578-1 test_~tmp___2~0 := test_#t~nondet38;havoc test_#t~nondet38; 1271#L588 assume 0 != test_~tmp___2~0; 1273#L594-2 assume !(0 != ~pumpRunning~0); 1283#L340 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret15, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 1262#L398 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret14, processEnvironment__wrappee__highWaterSensor_~tmp~2;havoc processEnvironment__wrappee__highWaterSensor_~tmp~2; 1263#L372-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret34, isHighWaterLevel_~retValue_acc~9, isHighWaterLevel_~tmp~5, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~9;havoc isHighWaterLevel_~tmp~5;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~4;havoc isHighWaterSensorDry_~retValue_acc~4; 1300#L169-1 assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~4 := 0;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~4; 1301#L174-1 isHighWaterLevel_#t~ret34 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~5 := isHighWaterLevel_#t~ret34;havoc isHighWaterLevel_#t~ret34; 1357#L518-3 assume !(0 != isHighWaterLevel_~tmp~5);isHighWaterLevel_~tmp___0~1 := 1; 1358#L518-5 isHighWaterLevel_~retValue_acc~9 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~9; 1334#L524-1 processEnvironment__wrappee__highWaterSensor_#t~ret14 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~2 := processEnvironment__wrappee__highWaterSensor_#t~ret14;havoc processEnvironment__wrappee__highWaterSensor_#t~ret14; 1269#L376-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~2); 1266#L347 havoc __utac_acc__Specification2_spec__2_#t~ret12, __utac_acc__Specification2_spec__2_#t~ret13, __utac_acc__Specification2_spec__2_~tmp~1, __utac_acc__Specification2_spec__2_~tmp___0~0;havoc __utac_acc__Specification2_spec__2_~tmp~1;havoc __utac_acc__Specification2_spec__2_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 1400#L129-2 __utac_acc__Specification2_spec__2_#t~ret12 := isMethaneLevelCritical_#res;__utac_acc__Specification2_spec__2_~tmp~1 := __utac_acc__Specification2_spec__2_#t~ret12;havoc __utac_acc__Specification2_spec__2_#t~ret12; 1360#L309 assume !(0 != __utac_acc__Specification2_spec__2_~tmp~1);~methAndRunningLastTime~0 := 0; 1340#L309-1 [2019-01-14 04:21:07,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:07,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2019-01-14 04:21:07,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:07,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:07,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:07,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:21:07,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:08,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:08,262 INFO L82 PathProgramCache]: Analyzing trace with hash 848812995, now seen corresponding path program 1 times [2019-01-14 04:21:08,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:08,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:08,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:08,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:21:08,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:21:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:21:08,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:21:08,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:21:08,576 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:21:08,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:21:08,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:21:08,578 INFO L87 Difference]: Start difference. First operand 185 states and 253 transitions. cyclomatic complexity: 70 Second operand 5 states. [2019-01-14 04:21:09,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:21:09,406 INFO L93 Difference]: Finished difference Result 545 states and 745 transitions. [2019-01-14 04:21:09,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:21:09,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 545 states and 745 transitions. [2019-01-14 04:21:09,418 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 388 [2019-01-14 04:21:09,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 545 states to 545 states and 745 transitions. [2019-01-14 04:21:09,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 545 [2019-01-14 04:21:09,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 545 [2019-01-14 04:21:09,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 545 states and 745 transitions. [2019-01-14 04:21:09,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:21:09,426 INFO L706 BuchiCegarLoop]: Abstraction has 545 states and 745 transitions. [2019-01-14 04:21:09,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states and 745 transitions. [2019-01-14 04:21:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 203. [2019-01-14 04:21:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-14 04:21:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 271 transitions. [2019-01-14 04:21:09,452 INFO L729 BuchiCegarLoop]: Abstraction has 203 states and 271 transitions. [2019-01-14 04:21:09,452 INFO L609 BuchiCegarLoop]: Abstraction has 203 states and 271 transitions. [2019-01-14 04:21:09,453 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:21:09,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 271 transitions. [2019-01-14 04:21:09,454 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 138 [2019-01-14 04:21:09,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:21:09,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:21:09,455 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:09,455 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:09,456 INFO L794 eck$LassoCheckResult]: Stem: 2162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~cleanupTimeShifts~0 := 4;~methAndRunningLastTime~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(110, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string25.base, #t~string25.offset, 1);call write~init~int(80, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(117, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(109, #t~string25.base, 3 + #t~string25.offset, 1);call write~init~int(112, #t~string25.base, 4 + #t~string25.offset, 1);call write~init~int(58, #t~string25.base, 5 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 6 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string31.base, #t~string31.offset, 1);call write~init~int(32, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 2 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string33.base, #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 1 + #t~string33.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(9);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(21);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(30);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(9);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(21);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(30);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(9);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(25); 2025#L-1 havoc main_#res;havoc main_#t~ret11, main_~retValue_acc~6, main_~tmp~0;havoc main_~retValue_acc~6;havoc main_~tmp~0; 2026#L65 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 2023#L73 main_#t~ret11 := valid_product_#res;main_~tmp~0 := main_#t~ret11;havoc main_#t~ret11; 2024#L276 assume 0 != main_~tmp~0; 2089#L250 ~methAndRunningLastTime~0 := 0; 2124#L298 havoc test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~3, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~3;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 2090#L309-1 [2019-01-14 04:21:09,456 INFO L796 eck$LassoCheckResult]: Loop: 2090#L309-1 assume !false; 2091#L559 assume test_~splverifierCounter~0 < 4; 2159#L560 test_~tmp~7 := test_#t~nondet36;havoc test_#t~nondet36; 2190#L568 assume !(0 != test_~tmp~7); 2075#L568-1 test_~tmp___0~3 := test_#t~nondet37;havoc test_#t~nondet37; 2076#L578 assume !(0 != test_~tmp___0~3); 2118#L578-1 test_~tmp___2~0 := test_#t~nondet38;havoc test_#t~nondet38; 2014#L588 assume 0 != test_~tmp___2~0; 2016#L594-2 assume !(0 != ~pumpRunning~0); 2027#L340 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret15, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 2006#L398 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret14, processEnvironment__wrappee__highWaterSensor_~tmp~2;havoc processEnvironment__wrappee__highWaterSensor_~tmp~2; 2007#L372-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret34, isHighWaterLevel_~retValue_acc~9, isHighWaterLevel_~tmp~5, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~9;havoc isHighWaterLevel_~tmp~5;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~4;havoc isHighWaterSensorDry_~retValue_acc~4; 2044#L169-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~4 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~4; 2046#L174-1 isHighWaterLevel_#t~ret34 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~5 := isHighWaterLevel_#t~ret34;havoc isHighWaterLevel_#t~ret34; 2138#L518-3 assume 0 != isHighWaterLevel_~tmp~5;isHighWaterLevel_~tmp___0~1 := 0; 2175#L518-5 isHighWaterLevel_~retValue_acc~9 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~9; 2081#L524-1 processEnvironment__wrappee__highWaterSensor_#t~ret14 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~2 := processEnvironment__wrappee__highWaterSensor_#t~ret14;havoc processEnvironment__wrappee__highWaterSensor_#t~ret14; 2082#L376-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~2); 2155#L347 havoc __utac_acc__Specification2_spec__2_#t~ret12, __utac_acc__Specification2_spec__2_#t~ret13, __utac_acc__Specification2_spec__2_~tmp~1, __utac_acc__Specification2_spec__2_~tmp___0~0;havoc __utac_acc__Specification2_spec__2_~tmp~1;havoc __utac_acc__Specification2_spec__2_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 2156#L129-2 __utac_acc__Specification2_spec__2_#t~ret12 := isMethaneLevelCritical_#res;__utac_acc__Specification2_spec__2_~tmp~1 := __utac_acc__Specification2_spec__2_#t~ret12;havoc __utac_acc__Specification2_spec__2_#t~ret12; 2115#L309 assume !(0 != __utac_acc__Specification2_spec__2_~tmp~1);~methAndRunningLastTime~0 := 0; 2090#L309-1 [2019-01-14 04:21:09,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:09,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 5 times [2019-01-14 04:21:09,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:09,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:09,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:09,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:21:09,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:09,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:09,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1606252737, now seen corresponding path program 1 times [2019-01-14 04:21:09,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:09,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:09,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:09,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:21:09,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:09,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:09,892 INFO L82 PathProgramCache]: Analyzing trace with hash 166888889, now seen corresponding path program 1 times [2019-01-14 04:21:09,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:09,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:09,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:09,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:21:09,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:10,772 WARN L181 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-01-14 04:21:10,874 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 04:21:29,612 WARN L181 SmtUtils]: Spent 18.72 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-14 04:21:41,055 WARN L181 SmtUtils]: Spent 11.43 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-14 04:21:41,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:21:41 BoogieIcfgContainer [2019-01-14 04:21:41,127 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:21:41,128 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:21:41,128 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:21:41,128 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:21:41,129 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:21:03" (3/4) ... [2019-01-14 04:21:41,134 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:21:41,223 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:21:41,224 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:21:41,225 INFO L168 Benchmark]: Toolchain (without parser) took 40049.68 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 340.8 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -63.3 MB). Peak memory consumption was 277.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:41,228 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-14 04:21:41,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 629.96 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:41,229 INFO L168 Benchmark]: Boogie Procedure Inliner took 183.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -209.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:41,230 INFO L168 Benchmark]: Boogie Preprocessor took 52.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:41,230 INFO L168 Benchmark]: RCFGBuilder took 1522.84 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: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:41,239 INFO L168 Benchmark]: BuchiAutomizer took 37559.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.2 MB). Peak memory consumption was 389.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:41,240 INFO L168 Benchmark]: Witness Printer took 96.08 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-14 04:21:41,244 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 629.96 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 183.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -209.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1522.84 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: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 37559.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.2 MB). Peak memory consumption was 389.3 MB. Max. memory is 11.5 GB. * Witness Printer took 96.08 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 203 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 37.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 34.7s. Construction of modules took 1.7s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 638 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 203 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1024 SDtfs, 1677 SDslu, 1179 SDs, 0 SdLazy, 189 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s 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: 558]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {NULL=0, NULL=0, NULL=-2, NULL=0, NULL=0, NULL=-25, retValue_acc=0, NULL=0, NULL=0, NULL=-16, NULL=-21, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@665890dc=0, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@509d8d8b=0, NULL=-4, tmp___0=0, NULL=0, NULL=0, NULL=-15, retValue_acc=0, tmp=0, NULL=-20, NULL=0, NULL=-3, tmp___1=0, NULL=-6, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@34f5f631=0, NULL=-9, NULL=0, NULL=0, NULL=0, NULL=0, cleanupTimeShifts=4, NULL=-8, NULL=-5, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@540d89d8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@47f191=68, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@467023a7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31ad0037=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, NULL=-10, NULL=-23, \result=0, retValue_acc=0, NULL=0, NULL=-19, NULL=0, NULL=-1, \result=1, head=0, pumpRunning=0, tmp=1, \result=0, NULL=-7, retValue_acc=1, NULL=0, NULL=0, NULL=0, \result=1, tmp___0=0, NULL=-12, NULL=-13, NULL=0, NULL=0, retValue_acc=1, tmp___0=0, tmp___2=68, tmp=1, splverifierCounter=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61407ecc=0, methAndRunningLastTime=0, \result=0, NULL=-11, NULL=-17, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54157179=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a278132=0, NULL=-18, tmp=0, head=0, NULL=-22, NULL=-24, NULL=0, tmp=0, NULL=-14} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L86] int waterLevel = 1; [L87] int methaneLevelCritical = 0; [L189] int cleanupTimeShifts = 4; [L292] int methAndRunningLastTime ; [L333] int pumpRunning = 0; [L334] int systemActive = 1; [L782] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L267] int retValue_acc ; [L268] int tmp ; [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); [L274] tmp = valid_product() [L276] COND TRUE \read(tmp) [L297] methAndRunningLastTime = 0 [L549] int splverifierCounter ; [L550] int tmp ; [L551] int tmp___0 ; [L552] int tmp___1 ; [L553] int tmp___2 ; [L556] splverifierCounter = 0 Loop: [L558] COND TRUE 1 [L560] COND TRUE splverifierCounter < 4 [L566] tmp = __VERIFIER_nondet_int() [L568] COND FALSE !(\read(tmp)) [L576] tmp___0 = __VERIFIER_nondet_int() [L578] COND FALSE !(\read(tmp___0)) [L586] tmp___2 = __VERIFIER_nondet_int() [L588] COND TRUE \read(tmp___2) [L340] COND FALSE !(\read(pumpRunning)) [L347] COND TRUE \read(systemActive) [L395] int tmp ; [L398] COND FALSE !(\read(pumpRunning)) [L369] int tmp ; [L372] COND TRUE ! pumpRunning [L510] int retValue_acc ; [L511] int tmp ; [L512] int tmp___0 ; [L166] int retValue_acc ; [L169] COND TRUE waterLevel < 2 [L170] retValue_acc = 1 [L171] return (retValue_acc); [L516] tmp = isHighWaterSensorDry() [L518] COND TRUE \read(tmp) [L519] tmp___0 = 0 [L523] retValue_acc = tmp___0 [L524] return (retValue_acc); [L374] tmp = isHighWaterLevel() [L376] COND FALSE !(\read(tmp)) [L302] int tmp ; [L303] int tmp___0 ; [L125] int retValue_acc ; [L128] retValue_acc = methaneLevelCritical [L129] return (retValue_acc); [L307] tmp = isMethaneLevelCritical() [L309] COND FALSE !(\read(tmp)) [L325] methAndRunningLastTime = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...