./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product16_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_product16_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 6e1f2dc26efb42c99cbde86e46132dc40752e9dc .................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:29:44,585 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:29:44,588 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:29:44,607 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:29:44,608 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:29:44,609 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:29:44,611 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:29:44,613 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:29:44,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:29:44,616 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:29:44,619 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:29:44,619 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:29:44,620 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:29:44,622 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:29:44,623 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:29:44,624 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:29:44,624 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:29:44,626 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:29:44,628 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:29:44,634 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:29:44,635 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:29:44,636 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:29:44,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:29:44,643 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:29:44,643 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:29:44,644 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:29:44,645 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:29:44,648 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:29:44,650 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:29:44,652 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:29:44,654 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:29:44,655 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:29:44,655 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:29:44,655 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:29:44,656 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:29:44,659 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:29:44,659 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:29:44,688 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:29:44,689 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:29:44,691 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:29:44,691 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:29:44,691 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:29:44,692 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:29:44,692 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:29:44,692 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:29:44,692 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:29:44,693 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:29:44,693 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:29:44,693 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:29:44,693 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:29:44,693 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:29:44,694 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:29:44,694 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:29:44,694 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:29:44,694 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:29:44,694 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:29:44,694 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:29:44,695 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:29:44,696 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:29:44,697 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:29:44,697 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:29:44,697 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:29:44,697 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:29:44,698 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:29:44,698 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:29:44,698 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:29:44,698 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:29:44,698 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:29:44,699 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:29:44,699 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 -> 6e1f2dc26efb42c99cbde86e46132dc40752e9dc [2019-01-14 04:29:44,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:29:44,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:29:44,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:29:44,779 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:29:44,780 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:29:44,780 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product16_true-unreach-call_false-termination.cil.c [2019-01-14 04:29:44,847 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d45aa723/7cd0c32fdd244364ba5a9c52f48b0d3a/FLAG03f4c2294 [2019-01-14 04:29:45,362 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:29:45,363 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product16_true-unreach-call_false-termination.cil.c [2019-01-14 04:29:45,376 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d45aa723/7cd0c32fdd244364ba5a9c52f48b0d3a/FLAG03f4c2294 [2019-01-14 04:29:45,625 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d45aa723/7cd0c32fdd244364ba5a9c52f48b0d3a [2019-01-14 04:29:45,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:29:45,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:29:45,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:29:45,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:29:45,637 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:29:45,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:29:45" (1/1) ... [2019-01-14 04:29:45,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5af229c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:45, skipping insertion in model container [2019-01-14 04:29:45,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:29:45" (1/1) ... [2019-01-14 04:29:45,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:29:45,705 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:29:46,075 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:29:46,090 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:29:46,293 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:29:46,331 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:29:46,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:46 WrapperNode [2019-01-14 04:29:46,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:29:46,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:29:46,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:29:46,333 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:29:46,340 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:29:46" (1/1) ... [2019-01-14 04:29:46,358 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:29:46" (1/1) ... [2019-01-14 04:29:46,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:29:46,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:29:46,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:29:46,401 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:29:46,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:46" (1/1) ... [2019-01-14 04:29:46,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:46" (1/1) ... [2019-01-14 04:29:46,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:46" (1/1) ... [2019-01-14 04:29:46,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:46" (1/1) ... [2019-01-14 04:29:46,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:46" (1/1) ... [2019-01-14 04:29:46,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:46" (1/1) ... [2019-01-14 04:29:46,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:46" (1/1) ... [2019-01-14 04:29:46,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:29:46,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:29:46,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:29:46,458 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:29:46,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:46" (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:29:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:29:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:29:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:29:46,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:29:47,635 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:29:47,635 INFO L286 CfgBuilder]: Removed 116 assue(true) statements. [2019-01-14 04:29:47,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:29:47 BoogieIcfgContainer [2019-01-14 04:29:47,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:29:47,637 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:29:47,637 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:29:47,641 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:29:47,642 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:29:47,642 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:29:45" (1/3) ... [2019-01-14 04:29:47,643 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58a082fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:29:47, skipping insertion in model container [2019-01-14 04:29:47,643 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:29:47,643 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:46" (2/3) ... [2019-01-14 04:29:47,644 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58a082fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:29:47, skipping insertion in model container [2019-01-14 04:29:47,644 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:29:47,644 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:29:47" (3/3) ... [2019-01-14 04:29:47,646 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product16_true-unreach-call_false-termination.cil.c [2019-01-14 04:29:47,699 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:29:47,700 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:29:47,700 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:29:47,700 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:29:47,700 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:29:47,701 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:29:47,701 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:29:47,701 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:29:47,701 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:29:47,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states. [2019-01-14 04:29:47,743 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2019-01-14 04:29:47,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:29:47,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:29:47,752 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:29:47,752 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:29:47,752 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:29:47,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states. [2019-01-14 04:29:47,759 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2019-01-14 04:29:47,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:29:47,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:29:47,760 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:29:47,761 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:29:47,765 INFO L794 eck$LassoCheckResult]: Stem: 20#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);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(13);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(110, #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(4);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(102, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(102, #t~string48.base, 2 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 3 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string50.base, #t~string50.offset, 1);call write~init~int(80, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(117, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(109, #t~string50.base, 3 + #t~string50.offset, 1);call write~init~int(112, #t~string50.base, 4 + #t~string50.offset, 1);call write~init~int(58, #t~string50.base, 5 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 6 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string52.base, #t~string52.offset, 1);call write~init~int(110, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 2 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(102, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(102, #t~string54.base, 2 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 3 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string56.base, #t~string56.offset, 1);call write~init~int(32, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 2 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string58.base, #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 1 + #t~string58.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(13);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string66.base, #t~string66.offset, 1);call write~init~int(77, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(101, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(116, #t~string66.base, 3 + #t~string66.offset, 1);call write~init~int(104, #t~string66.base, 4 + #t~string66.offset, 1);call write~init~int(58, #t~string66.base, 5 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 6 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string68.base, #t~string68.offset, 1);call write~init~int(82, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(73, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(84, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 4 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string70.base, #t~string70.offset, 1);call write~init~int(75, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 2 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string72.base, #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 1 + #t~string72.offset, 1); 5#L-1true havoc main_#res;havoc main_#t~ret38, main_~retValue_acc~3, main_~tmp~4;havoc main_~retValue_acc~3;havoc main_~tmp~4; 6#L585true havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 26#L593true main_#t~ret38 := valid_product_#res;main_~tmp~4 := main_#t~ret38;havoc main_#t~ret38; 30#L549true assume 0 != main_~tmp~4; 41#L521true ~switchedOnBeforeTS~0 := 0; 73#L415true havoc test_#t~nondet59, test_#t~nondet60, test_#t~nondet61, test_#t~nondet62, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 21#L436-1true [2019-01-14 04:29:47,766 INFO L796 eck$LassoCheckResult]: Loop: 21#L436-1true assume !false; 14#L801true assume test_~splverifierCounter~0 < 4; 36#L802true test_~tmp~7 := test_#t~nondet59;havoc test_#t~nondet59; 72#L810true assume !(0 != test_~tmp~7); 42#L810-1true test_~tmp___0~1 := test_#t~nondet60;havoc test_#t~nondet60; 16#L820true assume !(0 != test_~tmp___0~1); 22#L820-1true test_~tmp___2~0 := test_#t~nondet61;havoc test_#t~nondet61; 7#L830true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 31#L838-1true havoc __utac_acc__Specification5_spec__2_#t~ret35;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~7;havoc isPumpRunning_~retValue_acc~7;isPumpRunning_~retValue_acc~7 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~7; 68#L726true __utac_acc__Specification5_spec__2_#t~ret35 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret35;havoc __utac_acc__Specification5_spec__2_#t~ret35; 19#L425true assume !(0 != ~pumpRunning~0); 75#L624true assume !(0 != ~systemActive~0); 64#L631true havoc __utac_acc__Specification5_spec__3_#t~ret36, __utac_acc__Specification5_spec__3_#t~ret37, __utac_acc__Specification5_spec__3_~tmp~3, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~3;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~9;havoc getWaterLevel_~retValue_acc~9;getWaterLevel_~retValue_acc~9 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~9; 50#L934true __utac_acc__Specification5_spec__3_#t~ret36 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~3 := __utac_acc__Specification5_spec__3_#t~ret36;havoc __utac_acc__Specification5_spec__3_#t~ret36; 17#L436true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~3); 21#L436-1true [2019-01-14 04:29:47,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:29:47,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-14 04:29:47,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:29:47,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:29:47,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:47,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:29:47,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:48,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:29:48,693 INFO L82 PathProgramCache]: Analyzing trace with hash 674918198, now seen corresponding path program 1 times [2019-01-14 04:29:48,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:29:48,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:29:48,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:48,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:29:48,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:29:48,816 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:29:48,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:29:48,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:29:48,824 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:29:48,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:29:48,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:29:48,847 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 3 states. [2019-01-14 04:29:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:29:48,991 INFO L93 Difference]: Finished difference Result 147 states and 203 transitions. [2019-01-14 04:29:48,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:29:48,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 203 transitions. [2019-01-14 04:29:49,003 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 94 [2019-01-14 04:29:49,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 133 states and 188 transitions. [2019-01-14 04:29:49,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2019-01-14 04:29:49,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2019-01-14 04:29:49,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 188 transitions. [2019-01-14 04:29:49,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:29:49,015 INFO L706 BuchiCegarLoop]: Abstraction has 133 states and 188 transitions. [2019-01-14 04:29:49,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 188 transitions. [2019-01-14 04:29:49,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2019-01-14 04:29:49,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-14 04:29:49,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 185 transitions. [2019-01-14 04:29:49,064 INFO L729 BuchiCegarLoop]: Abstraction has 131 states and 185 transitions. [2019-01-14 04:29:49,064 INFO L609 BuchiCegarLoop]: Abstraction has 131 states and 185 transitions. [2019-01-14 04:29:49,064 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:29:49,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 185 transitions. [2019-01-14 04:29:49,067 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 92 [2019-01-14 04:29:49,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:29:49,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:29:49,069 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:29:49,069 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:29:49,069 INFO L794 eck$LassoCheckResult]: Stem: 264#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);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(13);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(110, #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(4);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(102, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(102, #t~string48.base, 2 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 3 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string50.base, #t~string50.offset, 1);call write~init~int(80, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(117, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(109, #t~string50.base, 3 + #t~string50.offset, 1);call write~init~int(112, #t~string50.base, 4 + #t~string50.offset, 1);call write~init~int(58, #t~string50.base, 5 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 6 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string52.base, #t~string52.offset, 1);call write~init~int(110, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 2 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(102, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(102, #t~string54.base, 2 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 3 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string56.base, #t~string56.offset, 1);call write~init~int(32, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 2 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string58.base, #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 1 + #t~string58.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(13);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string66.base, #t~string66.offset, 1);call write~init~int(77, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(101, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(116, #t~string66.base, 3 + #t~string66.offset, 1);call write~init~int(104, #t~string66.base, 4 + #t~string66.offset, 1);call write~init~int(58, #t~string66.base, 5 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 6 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string68.base, #t~string68.offset, 1);call write~init~int(82, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(73, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(84, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 4 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string70.base, #t~string70.offset, 1);call write~init~int(75, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 2 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string72.base, #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 1 + #t~string72.offset, 1); 237#L-1 havoc main_#res;havoc main_#t~ret38, main_~retValue_acc~3, main_~tmp~4;havoc main_~retValue_acc~3;havoc main_~tmp~4; 238#L585 havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 239#L593 main_#t~ret38 := valid_product_#res;main_~tmp~4 := main_#t~ret38;havoc main_#t~ret38; 274#L549 assume 0 != main_~tmp~4; 279#L521 ~switchedOnBeforeTS~0 := 0; 292#L415 havoc test_#t~nondet59, test_#t~nondet60, test_#t~nondet61, test_#t~nondet62, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 257#L436-1 [2019-01-14 04:29:49,070 INFO L796 eck$LassoCheckResult]: Loop: 257#L436-1 assume !false; 249#L801 assume test_~splverifierCounter~0 < 4; 250#L802 test_~tmp~7 := test_#t~nondet59;havoc test_#t~nondet59; 287#L810 assume !(0 != test_~tmp~7); 234#L810-1 test_~tmp___0~1 := test_#t~nondet60;havoc test_#t~nondet60; 254#L820 assume !(0 != test_~tmp___0~1); 244#L820-1 test_~tmp___2~0 := test_#t~nondet61;havoc test_#t~nondet61; 240#L830 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 242#L838-1 havoc __utac_acc__Specification5_spec__2_#t~ret35;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~7;havoc isPumpRunning_~retValue_acc~7;isPumpRunning_~retValue_acc~7 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~7; 280#L726 __utac_acc__Specification5_spec__2_#t~ret35 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret35;havoc __utac_acc__Specification5_spec__2_#t~ret35; 261#L425 assume !(0 != ~pumpRunning~0); 262#L624 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret40, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 296#L656 assume !(0 != ~pumpRunning~0); 291#L631 havoc __utac_acc__Specification5_spec__3_#t~ret36, __utac_acc__Specification5_spec__3_#t~ret37, __utac_acc__Specification5_spec__3_~tmp~3, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~3;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~9;havoc getWaterLevel_~retValue_acc~9;getWaterLevel_~retValue_acc~9 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~9; 295#L934 __utac_acc__Specification5_spec__3_#t~ret36 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~3 := __utac_acc__Specification5_spec__3_#t~ret36;havoc __utac_acc__Specification5_spec__3_#t~ret36; 255#L436 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~3); 257#L436-1 [2019-01-14 04:29:49,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:29:49,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-14 04:29:49,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:29:49,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:29:49,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:49,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:29:49,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:49,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:29:49,359 INFO L82 PathProgramCache]: Analyzing trace with hash -572900797, now seen corresponding path program 1 times [2019-01-14 04:29:49,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:29:49,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:29:49,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:49,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:29:49,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:49,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:29:49,373 INFO L82 PathProgramCache]: Analyzing trace with hash -747661431, now seen corresponding path program 1 times [2019-01-14 04:29:49,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:29:49,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:29:49,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:49,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:29:49,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:29:49,600 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:29:49,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:29:49,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:29:49,852 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-14 04:29:50,044 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 04:29:50,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:29:50,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:29:50,055 INFO L87 Difference]: Start difference. First operand 131 states and 185 transitions. cyclomatic complexity: 57 Second operand 5 states. [2019-01-14 04:29:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:29:50,844 INFO L93 Difference]: Finished difference Result 356 states and 495 transitions. [2019-01-14 04:29:50,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:29:50,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 356 states and 495 transitions. [2019-01-14 04:29:50,853 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 178 [2019-01-14 04:29:50,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 356 states to 356 states and 495 transitions. [2019-01-14 04:29:50,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 356 [2019-01-14 04:29:50,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 356 [2019-01-14 04:29:50,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 356 states and 495 transitions. [2019-01-14 04:29:50,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:29:50,863 INFO L706 BuchiCegarLoop]: Abstraction has 356 states and 495 transitions. [2019-01-14 04:29:50,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states and 495 transitions. [2019-01-14 04:29:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 255. [2019-01-14 04:29:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-01-14 04:29:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 349 transitions. [2019-01-14 04:29:50,888 INFO L729 BuchiCegarLoop]: Abstraction has 255 states and 349 transitions. [2019-01-14 04:29:50,889 INFO L609 BuchiCegarLoop]: Abstraction has 255 states and 349 transitions. [2019-01-14 04:29:50,889 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:29:50,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 255 states and 349 transitions. [2019-01-14 04:29:50,895 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 178 [2019-01-14 04:29:50,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:29:50,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:29:50,899 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:29:50,899 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:29:50,900 INFO L794 eck$LassoCheckResult]: Stem: 768#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);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(13);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(110, #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(4);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(102, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(102, #t~string48.base, 2 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 3 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string50.base, #t~string50.offset, 1);call write~init~int(80, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(117, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(109, #t~string50.base, 3 + #t~string50.offset, 1);call write~init~int(112, #t~string50.base, 4 + #t~string50.offset, 1);call write~init~int(58, #t~string50.base, 5 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 6 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string52.base, #t~string52.offset, 1);call write~init~int(110, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 2 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(102, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(102, #t~string54.base, 2 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 3 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string56.base, #t~string56.offset, 1);call write~init~int(32, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 2 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string58.base, #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 1 + #t~string58.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(13);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string66.base, #t~string66.offset, 1);call write~init~int(77, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(101, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(116, #t~string66.base, 3 + #t~string66.offset, 1);call write~init~int(104, #t~string66.base, 4 + #t~string66.offset, 1);call write~init~int(58, #t~string66.base, 5 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 6 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string68.base, #t~string68.offset, 1);call write~init~int(82, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(73, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(84, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 4 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string70.base, #t~string70.offset, 1);call write~init~int(75, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 2 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string72.base, #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 1 + #t~string72.offset, 1); 740#L-1 havoc main_#res;havoc main_#t~ret38, main_~retValue_acc~3, main_~tmp~4;havoc main_~retValue_acc~3;havoc main_~tmp~4; 741#L585 havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 742#L593 main_#t~ret38 := valid_product_#res;main_~tmp~4 := main_#t~ret38;havoc main_#t~ret38; 779#L549 assume 0 != main_~tmp~4; 785#L521 ~switchedOnBeforeTS~0 := 0; 799#L415 havoc test_#t~nondet59, test_#t~nondet60, test_#t~nondet61, test_#t~nondet62, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 828#L436-1 [2019-01-14 04:29:50,901 INFO L796 eck$LassoCheckResult]: Loop: 828#L436-1 assume !false; 883#L801 assume test_~splverifierCounter~0 < 4; 882#L802 test_~tmp~7 := test_#t~nondet59;havoc test_#t~nondet59; 881#L810 assume !(0 != test_~tmp~7); 880#L810-1 test_~tmp___0~1 := test_#t~nondet60;havoc test_#t~nondet60; 879#L820 assume !(0 != test_~tmp___0~1); 877#L820-1 test_~tmp___2~0 := test_#t~nondet61;havoc test_#t~nondet61; 876#L830 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 868#L838-1 havoc __utac_acc__Specification5_spec__2_#t~ret35;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~7;havoc isPumpRunning_~retValue_acc~7;isPumpRunning_~retValue_acc~7 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~7; 901#L726 __utac_acc__Specification5_spec__2_#t~ret35 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret35;havoc __utac_acc__Specification5_spec__2_#t~ret35; 900#L425 assume !(0 != ~pumpRunning~0); 898#L624 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret40, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 894#L656 assume !(0 != ~pumpRunning~0); 890#L631 havoc __utac_acc__Specification5_spec__3_#t~ret36, __utac_acc__Specification5_spec__3_#t~ret37, __utac_acc__Specification5_spec__3_~tmp~3, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~3;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~9;havoc getWaterLevel_~retValue_acc~9;getWaterLevel_~retValue_acc~9 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~9; 889#L934 __utac_acc__Specification5_spec__3_#t~ret36 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~3 := __utac_acc__Specification5_spec__3_#t~ret36;havoc __utac_acc__Specification5_spec__3_#t~ret36; 888#L436 assume 2 != __utac_acc__Specification5_spec__3_~tmp~3;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~7;havoc isPumpRunning_~retValue_acc~7;isPumpRunning_~retValue_acc~7 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~7; 887#L726-1 __utac_acc__Specification5_spec__3_#t~ret37 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~0 := __utac_acc__Specification5_spec__3_#t~ret37;havoc __utac_acc__Specification5_spec__3_#t~ret37; 885#L440 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~0); 828#L436-1 [2019-01-14 04:29:50,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:29:50,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-14 04:29:50,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:29:50,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:29:50,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:50,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:29:50,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:51,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:29:51,213 INFO L82 PathProgramCache]: Analyzing trace with hash -801866082, now seen corresponding path program 1 times [2019-01-14 04:29:51,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:29:51,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:29:51,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:51,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:29:51,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:51,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:29:51,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1243110812, now seen corresponding path program 1 times [2019-01-14 04:29:51,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:29:51,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:29:51,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:51,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:29:51,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:52,504 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-01-14 04:29:52,690 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 04:30:20,188 WARN L181 SmtUtils]: Spent 27.49 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-14 04:30:32,645 WARN L181 SmtUtils]: Spent 12.44 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-14 04:30:32,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:30:32 BoogieIcfgContainer [2019-01-14 04:30:32,747 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:30:32,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:30:32,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:30:32,747 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:30:32,748 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:29:47" (3/4) ... [2019-01-14 04:30:32,752 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:30:32,821 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:30:32,821 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:30:32,822 INFO L168 Benchmark]: Toolchain (without parser) took 47190.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.4 MB). Free memory was 952.7 MB in the beginning and 882.4 MB in the end (delta: 70.4 MB). Peak memory consumption was 380.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:30:32,823 INFO L168 Benchmark]: CDTParser took 0.18 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:30:32,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:30:32,824 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:30:32,826 INFO L168 Benchmark]: Boogie Preprocessor took 56.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:30:32,826 INFO L168 Benchmark]: RCFGBuilder took 1178.61 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: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:30:32,827 INFO L168 Benchmark]: BuchiAutomizer took 45109.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 885.6 MB in the end (delta: 167.9 MB). Peak memory consumption was 423.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:30:32,828 INFO L168 Benchmark]: Witness Printer took 73.74 ms. Allocated memory is still 1.3 GB. Free memory was 885.6 MB in the beginning and 882.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:30:32,838 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.18 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 699.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1178.61 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: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 45109.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 885.6 MB in the end (delta: 167.9 MB). Peak memory consumption was 423.8 MB. Max. memory is 11.5 GB. * Witness Printer took 73.74 ms. Allocated memory is still 1.3 GB. Free memory was 885.6 MB in the beginning and 882.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 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 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 255 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 45.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 43.8s. Construction of modules took 0.6s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 103 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 255 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 259 SDtfs, 404 SDslu, 387 SDs, 0 SdLazy, 77 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont1 unkn0 SFLI1 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: 800]: 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=0, NULL=0, NULL=-18, retValue_acc=0, NULL=0, NULL=-25, NULL=-23, NULL=-3, methaneLevelCritical=0, tmp=1, NULL=0, NULL=0, tmp=0, NULL=-22, tmp___1=0, NULL=-4, NULL=-10, NULL=-6, NULL=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12ca7f45=0, cleanupTimeShifts=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4cf306b2=0, switchedOnBeforeTS=0, NULL=-14, NULL=-20, \result=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3156a126=0, NULL=-19, NULL=-11, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, tmp___0=0, \result=1, NULL=-2, head=0, pumpRunning=0, \result=0, NULL=-21, NULL=-9, tmp=1, NULL=0, NULL=-24, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@284b449a=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f0ba4b1=0, retValue_acc=1, NULL=-1, NULL=-8, NULL=0, retValue_acc=1, tmp___2=72, NULL=-12, tmp___0=0, splverifierCounter=0, NULL=-26, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4376a754=0, head=0, NULL=0, tmp=0, NULL=-13, NULL=-15, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@46503b29=0, NULL=-17, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f7264f4=72, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b099d04=0, NULL=0, NULL=-7, NULL=0, retValue_acc=0} - 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; [L409] int switchedOnBeforeTS ; [L458] int cleanupTimeShifts = 4; [L614] int pumpRunning = 0; [L615] int systemActive = 1; [L859] int waterLevel = 1; [L860] int methaneLevelCritical = 0; [L540] int retValue_acc ; [L541] int tmp ; [L589] int retValue_acc ; [L592] retValue_acc = 1 [L593] return (retValue_acc); [L547] tmp = valid_product() [L549] COND TRUE \read(tmp) [L414] switchedOnBeforeTS = 0 [L791] int splverifierCounter ; [L792] int tmp ; [L793] int tmp___0 ; [L794] int tmp___1 ; [L795] int tmp___2 ; [L798] splverifierCounter = 0 Loop: [L800] COND TRUE 1 [L802] COND TRUE splverifierCounter < 4 [L808] tmp = __VERIFIER_nondet_int() [L810] COND FALSE !(\read(tmp)) [L818] tmp___0 = __VERIFIER_nondet_int() [L820] COND FALSE !(\read(tmp___0)) [L828] tmp___2 = __VERIFIER_nondet_int() [L830] COND TRUE \read(tmp___2) [L785] systemActive = 1 [L722] int retValue_acc ; [L725] retValue_acc = pumpRunning [L726] return (retValue_acc); [L423] switchedOnBeforeTS = isPumpRunning() [L624] COND FALSE !(\read(pumpRunning)) [L631] COND TRUE \read(systemActive) [L653] int tmp ; [L656] COND FALSE !(\read(pumpRunning)) [L429] int tmp ; [L430] int tmp___0 ; [L930] int retValue_acc ; [L933] retValue_acc = waterLevel [L934] return (retValue_acc); [L434] tmp = getWaterLevel() [L436] COND TRUE tmp != 2 [L722] int retValue_acc ; [L725] retValue_acc = pumpRunning [L726] return (retValue_acc); [L438] tmp___0 = isPumpRunning() [L440] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...