./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product52_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_spec5_product52_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 9fc6dbbcfa33ba532c22e3e2a2682304ea7cf29d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:31:55,504 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:31:55,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:31:55,517 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:31:55,518 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:31:55,519 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:31:55,520 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:31:55,522 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:31:55,523 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:31:55,524 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:31:55,525 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:31:55,525 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:31:55,526 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:31:55,527 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:31:55,528 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:31:55,529 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:31:55,530 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:31:55,532 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:31:55,534 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:31:55,535 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:31:55,536 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:31:55,537 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:31:55,540 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:31:55,540 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:31:55,540 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:31:55,542 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:31:55,543 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:31:55,543 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:31:55,544 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:31:55,545 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:31:55,545 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:31:55,546 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:31:55,546 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:31:55,547 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:31:55,548 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:31:55,548 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:31:55,549 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:31:55,565 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:31:55,565 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:31:55,566 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:31:55,567 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:31:55,567 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:31:55,567 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:31:55,567 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:31:55,567 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:31:55,568 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:31:55,568 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:31:55,568 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:31:55,568 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:31:55,568 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:31:55,568 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:31:55,569 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:31:55,569 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:31:55,569 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:31:55,569 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:31:55,569 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:31:55,569 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:31:55,570 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:31:55,570 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:31:55,570 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:31:55,570 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:31:55,570 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:31:55,571 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:31:55,571 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:31:55,571 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:31:55,571 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:31:55,571 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:31:55,571 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:31:55,572 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:31:55,572 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 -> 9fc6dbbcfa33ba532c22e3e2a2682304ea7cf29d [2019-01-14 04:31:55,605 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:31:55,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:31:55,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:31:55,621 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:31:55,621 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:31:55,622 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product52_true-unreach-call_false-termination.cil.c [2019-01-14 04:31:55,668 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf03a300d/82837766d6244c6b97c6526aa2df80a3/FLAG42ebf6164 [2019-01-14 04:31:56,185 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:31:56,186 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product52_true-unreach-call_false-termination.cil.c [2019-01-14 04:31:56,206 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf03a300d/82837766d6244c6b97c6526aa2df80a3/FLAG42ebf6164 [2019-01-14 04:31:56,483 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf03a300d/82837766d6244c6b97c6526aa2df80a3 [2019-01-14 04:31:56,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:31:56,491 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:31:56,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:31:56,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:31:56,500 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:31:56,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:31:56" (1/1) ... [2019-01-14 04:31:56,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199daf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:31:56, skipping insertion in model container [2019-01-14 04:31:56,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:31:56" (1/1) ... [2019-01-14 04:31:56,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:31:56,575 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:31:56,953 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:31:56,969 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:31:57,066 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:31:57,194 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:31:57,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:31:57 WrapperNode [2019-01-14 04:31:57,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:31:57,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:31:57,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:31:57,196 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:31:57,205 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:31:57" (1/1) ... [2019-01-14 04:31:57,224 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:31:57" (1/1) ... [2019-01-14 04:31:57,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:31:57,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:31:57,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:31:57,287 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:31:57,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:31:57" (1/1) ... [2019-01-14 04:31:57,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:31:57" (1/1) ... [2019-01-14 04:31:57,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:31:57" (1/1) ... [2019-01-14 04:31:57,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:31:57" (1/1) ... [2019-01-14 04:31:57,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:31:57" (1/1) ... [2019-01-14 04:31:57,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:31:57" (1/1) ... [2019-01-14 04:31:57,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:31:57" (1/1) ... [2019-01-14 04:31:57,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:31:57,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:31:57,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:31:57,342 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:31:57,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:31:57" (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:31:57,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:31:57,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:31:57,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:31:57,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:31:58,800 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:31:58,801 INFO L286 CfgBuilder]: Removed 176 assue(true) statements. [2019-01-14 04:31:58,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:31:58 BoogieIcfgContainer [2019-01-14 04:31:58,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:31:58,803 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:31:58,803 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:31:58,806 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:31:58,807 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:31:58,807 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:31:56" (1/3) ... [2019-01-14 04:31:58,808 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@653d8a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:31:58, skipping insertion in model container [2019-01-14 04:31:58,808 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:31:58,809 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:31:57" (2/3) ... [2019-01-14 04:31:58,809 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@653d8a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:31:58, skipping insertion in model container [2019-01-14 04:31:58,809 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:31:58,809 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:31:58" (3/3) ... [2019-01-14 04:31:58,811 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product52_true-unreach-call_false-termination.cil.c [2019-01-14 04:31:58,870 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:31:58,871 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:31:58,872 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:31:58,872 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:31:58,872 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:31:58,872 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:31:58,872 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:31:58,873 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:31:58,873 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:31:58,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2019-01-14 04:31:58,926 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2019-01-14 04:31:58,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:31:58,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:31:58,935 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:31:58,935 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:31:58,935 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:31:58,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2019-01-14 04:31:58,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2019-01-14 04:31:58,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:31:58,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:31:58,946 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:31:58,946 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:31:58,951 INFO L794 eck$LassoCheckResult]: Stem: 85#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(13);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string42.base, #t~string42.offset, 1);call write~init~int(77, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(101, #t~string42.base, 2 + #t~string42.offset, 1);call write~init~int(116, #t~string42.base, 3 + #t~string42.offset, 1);call write~init~int(104, #t~string42.base, 4 + #t~string42.offset, 1);call write~init~int(58, #t~string42.base, 5 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 6 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string44.base, #t~string44.offset, 1);call write~init~int(82, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(73, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(84, #t~string44.base, 3 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 4 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(75, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 2 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string48.base, #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 1 + #t~string48.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(13);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(80, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(117, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(109, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(112, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(110, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 3 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(32, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 9#L-1true havoc main_#res;havoc main_#t~ret35, main_~retValue_acc~3, main_~tmp~3;havoc main_~retValue_acc~3;havoc main_~tmp~3; 16#L998true havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 21#L1006true main_#t~ret35 := valid_product_#res;main_~tmp~3 := main_#t~ret35;havoc main_#t~ret35; 86#L498true assume 0 != main_~tmp~3; 42#L469true ~switchedOnBeforeTS~0 := 0; 75#L529true havoc test_#t~nondet49, test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 112#L550-1true [2019-01-14 04:31:58,952 INFO L796 eck$LassoCheckResult]: Loop: 112#L550-1true assume !false; 122#L693true assume test_~splverifierCounter~0 < 4; 80#L694true test_~tmp~5 := test_#t~nondet49;havoc test_#t~nondet49; 81#L702true assume !(0 != test_~tmp~5); 82#L702-1true test_~tmp___0~1 := test_#t~nondet50;havoc test_#t~nondet50; 125#L712true assume !(0 != test_~tmp___0~1); 126#L712-1true test_~tmp___2~0 := test_#t~nondet51;havoc test_#t~nondet51; 51#L722true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 62#L730-1true havoc __utac_acc__Specification5_spec__2_#t~ret36;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~9;havoc isPumpRunning_~retValue_acc~9;isPumpRunning_~retValue_acc~9 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~9; 28#L874true __utac_acc__Specification5_spec__2_#t~ret36 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret36;havoc __utac_acc__Specification5_spec__2_#t~ret36; 109#L539true assume !(0 != ~pumpRunning~0); 77#L763true assume !(0 != ~systemActive~0); 118#L770true havoc __utac_acc__Specification5_spec__3_#t~ret37, __utac_acc__Specification5_spec__3_#t~ret38, __utac_acc__Specification5_spec__3_~tmp~4, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~4;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~5;havoc getWaterLevel_~retValue_acc~5;getWaterLevel_~retValue_acc~5 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~5; 96#L652true __utac_acc__Specification5_spec__3_#t~ret37 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~4 := __utac_acc__Specification5_spec__3_#t~ret37;havoc __utac_acc__Specification5_spec__3_#t~ret37; 108#L550true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~4); 112#L550-1true [2019-01-14 04:31:58,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:31:58,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-14 04:31:58,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:31:58,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:31:59,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:59,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:31:59,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:31:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:31:59,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:31:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash 677042294, now seen corresponding path program 1 times [2019-01-14 04:31:59,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:31:59,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:31:59,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:59,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:31:59,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:32:00,089 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:32:00,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:32:00,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:32:00,099 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:32:00,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:32:00,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:32:00,127 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2019-01-14 04:32:00,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:32:00,406 INFO L93 Difference]: Finished difference Result 243 states and 353 transitions. [2019-01-14 04:32:00,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:32:00,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 243 states and 353 transitions. [2019-01-14 04:32:00,430 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 158 [2019-01-14 04:32:00,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 243 states to 229 states and 338 transitions. [2019-01-14 04:32:00,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 229 [2019-01-14 04:32:00,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 229 [2019-01-14 04:32:00,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 229 states and 338 transitions. [2019-01-14 04:32:00,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:32:00,458 INFO L706 BuchiCegarLoop]: Abstraction has 229 states and 338 transitions. [2019-01-14 04:32:00,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states and 338 transitions. [2019-01-14 04:32:00,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2019-01-14 04:32:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-14 04:32:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 335 transitions. [2019-01-14 04:32:00,518 INFO L729 BuchiCegarLoop]: Abstraction has 227 states and 335 transitions. [2019-01-14 04:32:00,518 INFO L609 BuchiCegarLoop]: Abstraction has 227 states and 335 transitions. [2019-01-14 04:32:00,518 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:32:00,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states and 335 transitions. [2019-01-14 04:32:00,524 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 156 [2019-01-14 04:32:00,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:32:00,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:32:00,526 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:32:00,527 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:32:00,527 INFO L794 eck$LassoCheckResult]: Stem: 479#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(13);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string42.base, #t~string42.offset, 1);call write~init~int(77, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(101, #t~string42.base, 2 + #t~string42.offset, 1);call write~init~int(116, #t~string42.base, 3 + #t~string42.offset, 1);call write~init~int(104, #t~string42.base, 4 + #t~string42.offset, 1);call write~init~int(58, #t~string42.base, 5 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 6 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string44.base, #t~string44.offset, 1);call write~init~int(82, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(73, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(84, #t~string44.base, 3 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 4 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(75, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 2 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string48.base, #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 1 + #t~string48.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(13);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(80, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(117, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(109, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(112, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(110, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 3 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(32, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 389#L-1 havoc main_#res;havoc main_#t~ret35, main_~retValue_acc~3, main_~tmp~3;havoc main_~retValue_acc~3;havoc main_~tmp~3; 390#L998 havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 403#L1006 main_#t~ret35 := valid_product_#res;main_~tmp~3 := main_#t~ret35;havoc main_#t~ret35; 409#L498 assume 0 != main_~tmp~3; 433#L469 ~switchedOnBeforeTS~0 := 0; 434#L529 havoc test_#t~nondet49, test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 472#L550-1 [2019-01-14 04:32:00,531 INFO L796 eck$LassoCheckResult]: Loop: 472#L550-1 assume !false; 548#L693 assume test_~splverifierCounter~0 < 4; 546#L694 test_~tmp~5 := test_#t~nondet49;havoc test_#t~nondet49; 544#L702 assume !(0 != test_~tmp~5); 541#L702-1 test_~tmp___0~1 := test_#t~nondet50;havoc test_#t~nondet50; 540#L712 assume !(0 != test_~tmp___0~1); 530#L712-1 test_~tmp___2~0 := test_#t~nondet51;havoc test_#t~nondet51; 528#L722 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 450#L730-1 havoc __utac_acc__Specification5_spec__2_#t~ret36;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~9;havoc isPumpRunning_~retValue_acc~9;isPumpRunning_~retValue_acc~9 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~9; 417#L874 __utac_acc__Specification5_spec__2_#t~ret36 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret36;havoc __utac_acc__Specification5_spec__2_#t~ret36; 418#L539 assume !(0 != ~pumpRunning~0); 473#L763 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret54, processEnvironment_~tmp~7;havoc processEnvironment_~tmp~7; 474#L821 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret53, processEnvironment__wrappee__highWaterSensor_~tmp~6;havoc processEnvironment__wrappee__highWaterSensor_~tmp~6; 560#L795-1 assume !(0 == ~pumpRunning~0); 555#L770 havoc __utac_acc__Specification5_spec__3_#t~ret37, __utac_acc__Specification5_spec__3_#t~ret38, __utac_acc__Specification5_spec__3_~tmp~4, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~4;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~5;havoc getWaterLevel_~retValue_acc~5;getWaterLevel_~retValue_acc~5 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~5; 554#L652 __utac_acc__Specification5_spec__3_#t~ret37 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~4 := __utac_acc__Specification5_spec__3_#t~ret37;havoc __utac_acc__Specification5_spec__3_#t~ret37; 552#L550 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~4); 472#L550-1 [2019-01-14 04:32:00,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:32:00,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-14 04:32:00,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:32:00,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:32:00,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:32:00,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:32:00,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:32:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:32:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:32:00,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:32:00,951 INFO L82 PathProgramCache]: Analyzing trace with hash -543108204, now seen corresponding path program 1 times [2019-01-14 04:32:00,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:32:00,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:32:00,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:32:00,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:32:00,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:32:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:32:01,016 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:32:01,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:32:01,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:32:01,019 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:32:01,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:32:01,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:32:01,020 INFO L87 Difference]: Start difference. First operand 227 states and 335 transitions. cyclomatic complexity: 111 Second operand 3 states. [2019-01-14 04:32:01,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:32:01,534 INFO L93 Difference]: Finished difference Result 326 states and 457 transitions. [2019-01-14 04:32:01,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:32:01,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 326 states and 457 transitions. [2019-01-14 04:32:01,545 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 231 [2019-01-14 04:32:01,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 326 states to 326 states and 457 transitions. [2019-01-14 04:32:01,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 326 [2019-01-14 04:32:01,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 326 [2019-01-14 04:32:01,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 326 states and 457 transitions. [2019-01-14 04:32:01,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:32:01,564 INFO L706 BuchiCegarLoop]: Abstraction has 326 states and 457 transitions. [2019-01-14 04:32:01,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states and 457 transitions. [2019-01-14 04:32:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2019-01-14 04:32:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-01-14 04:32:01,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 457 transitions. [2019-01-14 04:32:01,591 INFO L729 BuchiCegarLoop]: Abstraction has 326 states and 457 transitions. [2019-01-14 04:32:01,591 INFO L609 BuchiCegarLoop]: Abstraction has 326 states and 457 transitions. [2019-01-14 04:32:01,591 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:32:01,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 326 states and 457 transitions. [2019-01-14 04:32:01,595 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 231 [2019-01-14 04:32:01,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:32:01,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:32:01,596 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:32:01,596 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:32:01,596 INFO L794 eck$LassoCheckResult]: Stem: 1043#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(13);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string42.base, #t~string42.offset, 1);call write~init~int(77, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(101, #t~string42.base, 2 + #t~string42.offset, 1);call write~init~int(116, #t~string42.base, 3 + #t~string42.offset, 1);call write~init~int(104, #t~string42.base, 4 + #t~string42.offset, 1);call write~init~int(58, #t~string42.base, 5 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 6 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string44.base, #t~string44.offset, 1);call write~init~int(82, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(73, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(84, #t~string44.base, 3 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 4 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(75, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 2 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string48.base, #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 1 + #t~string48.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(13);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(80, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(117, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(109, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(112, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(110, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 3 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(32, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 948#L-1 havoc main_#res;havoc main_#t~ret35, main_~retValue_acc~3, main_~tmp~3;havoc main_~retValue_acc~3;havoc main_~tmp~3; 949#L998 havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 962#L1006 main_#t~ret35 := valid_product_#res;main_~tmp~3 := main_#t~ret35;havoc main_#t~ret35; 968#L498 assume 0 != main_~tmp~3; 993#L469 ~switchedOnBeforeTS~0 := 0; 994#L529 havoc test_#t~nondet49, test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 945#L550-1 [2019-01-14 04:32:01,601 INFO L796 eck$LassoCheckResult]: Loop: 945#L550-1 assume !false; 1073#L693 assume test_~splverifierCounter~0 < 4; 1040#L694 test_~tmp~5 := test_#t~nondet49;havoc test_#t~nondet49; 1041#L702 assume !(0 != test_~tmp~5); 1036#L702-1 test_~tmp___0~1 := test_#t~nondet50;havoc test_#t~nondet50; 1042#L712 assume !(0 != test_~tmp___0~1); 979#L712-1 test_~tmp___2~0 := test_#t~nondet51;havoc test_#t~nondet51; 1008#L722 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 1010#L730-1 havoc __utac_acc__Specification5_spec__2_#t~ret36;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~9;havoc isPumpRunning_~retValue_acc~9;isPumpRunning_~retValue_acc~9 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~9; 1150#L874 __utac_acc__Specification5_spec__2_#t~ret36 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret36;havoc __utac_acc__Specification5_spec__2_#t~ret36; 1070#L539 assume !(0 != ~pumpRunning~0); 1037#L763 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret54, processEnvironment_~tmp~7;havoc processEnvironment_~tmp~7; 1033#L821 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret53, processEnvironment__wrappee__highWaterSensor_~tmp~6;havoc processEnvironment__wrappee__highWaterSensor_~tmp~6; 1034#L795-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret72, isHighWaterLevel_~retValue_acc~10, isHighWaterLevel_~tmp~8, isHighWaterLevel_~tmp___0~2;havoc isHighWaterLevel_~retValue_acc~10;havoc isHighWaterLevel_~tmp~8;havoc isHighWaterLevel_~tmp___0~2;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~6;havoc isHighWaterSensorDry_~retValue_acc~6; 1066#L660-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~6 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~6; 938#L665-1 isHighWaterLevel_#t~ret72 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~8 := isHighWaterLevel_#t~ret72;havoc isHighWaterLevel_#t~ret72; 939#L923-3 assume 0 != isHighWaterLevel_~tmp~8;isHighWaterLevel_~tmp___0~2 := 0; 992#L923-5 isHighWaterLevel_~retValue_acc~10 := isHighWaterLevel_~tmp___0~2;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~10; 974#L929-1 processEnvironment__wrappee__highWaterSensor_#t~ret53 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~6 := processEnvironment__wrappee__highWaterSensor_#t~ret53;havoc processEnvironment__wrappee__highWaterSensor_#t~ret53; 975#L799-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~6); 999#L770 havoc __utac_acc__Specification5_spec__3_#t~ret37, __utac_acc__Specification5_spec__3_#t~ret38, __utac_acc__Specification5_spec__3_~tmp~4, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~4;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~5;havoc getWaterLevel_~retValue_acc~5;getWaterLevel_~retValue_acc~5 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~5; 1058#L652 __utac_acc__Specification5_spec__3_#t~ret37 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~4 := __utac_acc__Specification5_spec__3_#t~ret37;havoc __utac_acc__Specification5_spec__3_#t~ret37; 1059#L550 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~4); 945#L550-1 [2019-01-14 04:32:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:32:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-14 04:32:01,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:32:01,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:32:01,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:32:01,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:32:01,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:32:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:32:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:32:02,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:32:02,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1971117568, now seen corresponding path program 1 times [2019-01-14 04:32:02,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:32:02,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:32:02,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:32:02,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:32:02,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:32:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:32:02,276 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:32:02,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:32:02,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:32:02,277 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:32:02,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:32:02,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:32:02,278 INFO L87 Difference]: Start difference. First operand 326 states and 457 transitions. cyclomatic complexity: 134 Second operand 5 states. [2019-01-14 04:32:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:32:03,581 INFO L93 Difference]: Finished difference Result 902 states and 1237 transitions. [2019-01-14 04:32:03,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:32:03,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 902 states and 1237 transitions. [2019-01-14 04:32:03,592 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 599 [2019-01-14 04:32:03,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 902 states to 902 states and 1237 transitions. [2019-01-14 04:32:03,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 902 [2019-01-14 04:32:03,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 902 [2019-01-14 04:32:03,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 902 states and 1237 transitions. [2019-01-14 04:32:03,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:32:03,605 INFO L706 BuchiCegarLoop]: Abstraction has 902 states and 1237 transitions. [2019-01-14 04:32:03,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states and 1237 transitions. [2019-01-14 04:32:03,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 645. [2019-01-14 04:32:03,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-01-14 04:32:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 879 transitions. [2019-01-14 04:32:03,633 INFO L729 BuchiCegarLoop]: Abstraction has 645 states and 879 transitions. [2019-01-14 04:32:03,633 INFO L609 BuchiCegarLoop]: Abstraction has 645 states and 879 transitions. [2019-01-14 04:32:03,633 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:32:03,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 645 states and 879 transitions. [2019-01-14 04:32:03,641 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 462 [2019-01-14 04:32:03,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:32:03,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:32:03,647 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:32:03,647 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:32:03,647 INFO L794 eck$LassoCheckResult]: Stem: 2288#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(13);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string42.base, #t~string42.offset, 1);call write~init~int(77, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(101, #t~string42.base, 2 + #t~string42.offset, 1);call write~init~int(116, #t~string42.base, 3 + #t~string42.offset, 1);call write~init~int(104, #t~string42.base, 4 + #t~string42.offset, 1);call write~init~int(58, #t~string42.base, 5 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 6 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string44.base, #t~string44.offset, 1);call write~init~int(82, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(73, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(84, #t~string44.base, 3 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 4 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(75, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 2 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string48.base, #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 1 + #t~string48.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(13);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(80, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(117, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(109, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(112, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(110, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 3 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(32, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 2192#L-1 havoc main_#res;havoc main_#t~ret35, main_~retValue_acc~3, main_~tmp~3;havoc main_~retValue_acc~3;havoc main_~tmp~3; 2193#L998 havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 2206#L1006 main_#t~ret35 := valid_product_#res;main_~tmp~3 := main_#t~ret35;havoc main_#t~ret35; 2212#L498 assume 0 != main_~tmp~3; 2237#L469 ~switchedOnBeforeTS~0 := 0; 2238#L529 havoc test_#t~nondet49, test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 2189#L550-1 [2019-01-14 04:32:03,648 INFO L796 eck$LassoCheckResult]: Loop: 2189#L550-1 assume !false; 2312#L693 assume test_~splverifierCounter~0 < 4; 2284#L694 test_~tmp~5 := test_#t~nondet49;havoc test_#t~nondet49; 2285#L702 assume !(0 != test_~tmp~5); 2286#L702-1 test_~tmp___0~1 := test_#t~nondet50;havoc test_#t~nondet50; 2287#L712 assume !(0 != test_~tmp___0~1); 2223#L712-1 test_~tmp___2~0 := test_#t~nondet51;havoc test_#t~nondet51; 2252#L722 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 2254#L730-1 havoc __utac_acc__Specification5_spec__2_#t~ret36;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~9;havoc isPumpRunning_~retValue_acc~9;isPumpRunning_~retValue_acc~9 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~9; 2220#L874 __utac_acc__Specification5_spec__2_#t~ret36 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret36;havoc __utac_acc__Specification5_spec__2_#t~ret36; 2221#L539 assume !(0 != ~pumpRunning~0); 2280#L763 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret54, processEnvironment_~tmp~7;havoc processEnvironment_~tmp~7; 2276#L821 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret53, processEnvironment__wrappee__highWaterSensor_~tmp~6;havoc processEnvironment__wrappee__highWaterSensor_~tmp~6; 2277#L795-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret72, isHighWaterLevel_~retValue_acc~10, isHighWaterLevel_~tmp~8, isHighWaterLevel_~tmp___0~2;havoc isHighWaterLevel_~retValue_acc~10;havoc isHighWaterLevel_~tmp~8;havoc isHighWaterLevel_~tmp___0~2;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~6;havoc isHighWaterSensorDry_~retValue_acc~6; 2308#L660-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~6 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~6; 2182#L665-1 isHighWaterLevel_#t~ret72 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~8 := isHighWaterLevel_#t~ret72;havoc isHighWaterLevel_#t~ret72; 2183#L923-3 assume 0 != isHighWaterLevel_~tmp~8;isHighWaterLevel_~tmp___0~2 := 0; 2236#L923-5 isHighWaterLevel_~retValue_acc~10 := isHighWaterLevel_~tmp___0~2;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~10; 2218#L929-1 processEnvironment__wrappee__highWaterSensor_#t~ret53 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~6 := processEnvironment__wrappee__highWaterSensor_#t~ret53;havoc processEnvironment__wrappee__highWaterSensor_#t~ret53; 2219#L799-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~6); 2243#L770 havoc __utac_acc__Specification5_spec__3_#t~ret37, __utac_acc__Specification5_spec__3_#t~ret38, __utac_acc__Specification5_spec__3_~tmp~4, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~4;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~5;havoc getWaterLevel_~retValue_acc~5;getWaterLevel_~retValue_acc~5 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~5; 2299#L652 __utac_acc__Specification5_spec__3_#t~ret37 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~4 := __utac_acc__Specification5_spec__3_#t~ret37;havoc __utac_acc__Specification5_spec__3_#t~ret37; 2300#L550 assume 2 != __utac_acc__Specification5_spec__3_~tmp~4;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~9;havoc isPumpRunning_~retValue_acc~9;isPumpRunning_~retValue_acc~9 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~9; 2194#L874-1 __utac_acc__Specification5_spec__3_#t~ret38 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~0 := __utac_acc__Specification5_spec__3_#t~ret38;havoc __utac_acc__Specification5_spec__3_#t~ret38; 2195#L554 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~0); 2189#L550-1 [2019-01-14 04:32:03,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:32:03,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2019-01-14 04:32:03,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:32:03,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:32:03,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:32:03,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:32:03,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:32:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:32:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:32:03,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:32:03,929 INFO L82 PathProgramCache]: Analyzing trace with hash -163417157, now seen corresponding path program 1 times [2019-01-14 04:32:03,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:32:03,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:32:03,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:32:03,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:32:03,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:32:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:32:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:32:03,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:32:03,955 INFO L82 PathProgramCache]: Analyzing trace with hash -226843339, now seen corresponding path program 1 times [2019-01-14 04:32:03,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:32:03,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:32:03,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:32:03,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:32:03,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:32:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:32:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:32:05,377 WARN L181 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-01-14 04:32:05,507 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-14 04:32:32,121 WARN L181 SmtUtils]: Spent 26.59 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-14 04:32:45,492 WARN L181 SmtUtils]: Spent 13.36 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-14 04:32:45,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:32:45 BoogieIcfgContainer [2019-01-14 04:32:45,570 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:32:45,571 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:32:45,571 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:32:45,571 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:32:45,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:31:58" (3/4) ... [2019-01-14 04:32:45,577 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:32:45,685 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:32:45,686 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:32:45,688 INFO L168 Benchmark]: Toolchain (without parser) took 49198.69 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 326.6 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -300.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:32:45,693 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:32:45,695 INFO L168 Benchmark]: CACSL2BoogieTranslator took 703.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:32:45,698 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.11 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:32:45,698 INFO L168 Benchmark]: Boogie Preprocessor took 53.95 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:32:45,699 INFO L168 Benchmark]: RCFGBuilder took 1461.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:32:45,699 INFO L168 Benchmark]: BuchiAutomizer took 46767.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.0 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -208.2 MB). Peak memory consumption was 415.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:32:45,700 INFO L168 Benchmark]: Witness Printer took 115.78 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:32:45,708 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 703.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.11 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.95 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1461.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 46767.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.0 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -208.2 MB). Peak memory consumption was 415.4 MB. Max. memory is 11.5 GB. * Witness Printer took 115.78 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 645 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 46.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 44.2s. Construction of modules took 1.6s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 259 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 645 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 613 SDtfs, 861 SDslu, 835 SDs, 0 SdLazy, 145 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc0 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: 692]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=9873} State at position 1 is {NULL=0, NULL=0, NULL=0, NULL=9873, NULL=-15, NULL=0, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65ece323=0, NULL=9872, NULL=0, NULL=0, NULL=-18, NULL=0, retValue_acc=1, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c5fd1b4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25e6b0a5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3638be1b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@685657b1=57, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7cac5add=0, tmp___0=0, NULL=0, NULL=0, tmp=0, tmp=1, NULL=0, tmp___1=0, NULL=-13, NULL=-8, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37c543f6=0, NULL=-5, NULL=-10, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7763b2e0=0, cleanupTimeShifts=4, switchedOnBeforeTS=0, NULL=-11, NULL=-4, tmp=0, \result=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, NULL=9871, \result=1, NULL=0, NULL=0, \result=0, NULL=-14, NULL=0, tmp___0=0, \result=1, NULL=-2, head=0, pumpRunning=0, NULL=-16, \result=0, retValue_acc=1, NULL=-21, tmp=1, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@571ad696=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ce1f3c5=0, \result=1, NULL=-23, NULL=-20, NULL=-22, NULL=-6, NULL=0, retValue_acc=0, tmp=1, tmp___2=57, NULL=-7, tmp___0=0, retValue_acc=1, splverifierCounter=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71be27c8=0, NULL=-17, head=0, NULL=0, NULL=-1, NULL=-3, NULL=0, NULL=-9, tmp=0, NULL=0, NULL=0, NULL=-12, retValue_acc=0, NULL=0, NULL=-19} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L406] int cleanupTimeShifts = 4; [L523] int switchedOnBeforeTS ; [L577] int waterLevel = 1; [L578] int methaneLevelCritical = 0; [L753] int pumpRunning = 0; [L754] int systemActive = 1; [L489] int retValue_acc ; [L490] int tmp ; [L1002] int retValue_acc ; [L1005] retValue_acc = 1 [L1006] return (retValue_acc); [L496] tmp = valid_product() [L498] COND TRUE \read(tmp) [L528] switchedOnBeforeTS = 0 [L683] int splverifierCounter ; [L684] int tmp ; [L685] int tmp___0 ; [L686] int tmp___1 ; [L687] int tmp___2 ; [L690] splverifierCounter = 0 Loop: [L692] COND TRUE 1 [L694] COND TRUE splverifierCounter < 4 [L700] tmp = __VERIFIER_nondet_int() [L702] COND FALSE !(\read(tmp)) [L710] tmp___0 = __VERIFIER_nondet_int() [L712] COND FALSE !(\read(tmp___0)) [L720] tmp___2 = __VERIFIER_nondet_int() [L722] COND TRUE \read(tmp___2) [L971] systemActive = 1 [L870] int retValue_acc ; [L873] retValue_acc = pumpRunning [L874] return (retValue_acc); [L537] switchedOnBeforeTS = isPumpRunning() [L763] COND FALSE !(\read(pumpRunning)) [L770] COND TRUE \read(systemActive) [L818] int tmp ; [L821] COND FALSE !(\read(pumpRunning)) [L792] int tmp ; [L795] COND TRUE ! pumpRunning [L915] int retValue_acc ; [L916] int tmp ; [L917] int tmp___0 ; [L657] int retValue_acc ; [L660] COND TRUE waterLevel < 2 [L661] retValue_acc = 1 [L662] return (retValue_acc); [L921] tmp = isHighWaterSensorDry() [L923] COND TRUE \read(tmp) [L924] tmp___0 = 0 [L928] retValue_acc = tmp___0 [L929] return (retValue_acc); [L797] tmp = isHighWaterLevel() [L799] COND FALSE !(\read(tmp)) [L543] int tmp ; [L544] int tmp___0 ; [L648] int retValue_acc ; [L651] retValue_acc = waterLevel [L652] return (retValue_acc); [L548] tmp = getWaterLevel() [L550] COND TRUE tmp != 2 [L870] int retValue_acc ; [L873] retValue_acc = pumpRunning [L874] return (retValue_acc); [L552] tmp___0 = isPumpRunning() [L554] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...