./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product37_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_product37_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 6a5b3ee1add5adeacf75c411f0af51a190ac6f33 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:30:59,417 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:30:59,419 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:30:59,431 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:30:59,431 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:30:59,432 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:30:59,434 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:30:59,436 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:30:59,438 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:30:59,439 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:30:59,440 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:30:59,440 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:30:59,442 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:30:59,443 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:30:59,444 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:30:59,445 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:30:59,446 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:30:59,448 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:30:59,450 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:30:59,452 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:30:59,453 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:30:59,455 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:30:59,458 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:30:59,458 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:30:59,458 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:30:59,459 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:30:59,461 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:30:59,461 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:30:59,462 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:30:59,464 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:30:59,464 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:30:59,465 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:30:59,465 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:30:59,466 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:30:59,467 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:30:59,468 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:30:59,468 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:30:59,487 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:30:59,487 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:30:59,489 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:30:59,489 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:30:59,489 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:30:59,489 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:30:59,490 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:30:59,490 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:30:59,490 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:30:59,490 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:30:59,490 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:30:59,490 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:30:59,491 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:30:59,492 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:30:59,492 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:30:59,492 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:30:59,492 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:30:59,493 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:30:59,493 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:30:59,493 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:30:59,494 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:30:59,494 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:30:59,494 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:30:59,494 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:30:59,494 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:30:59,495 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:30:59,495 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:30:59,495 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:30:59,495 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:30:59,495 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:30:59,496 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:30:59,498 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:30:59,498 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 -> 6a5b3ee1add5adeacf75c411f0af51a190ac6f33 [2019-01-14 04:30:59,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:30:59,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:30:59,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:30:59,568 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:30:59,568 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:30:59,569 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product37_true-unreach-call_false-termination.cil.c [2019-01-14 04:30:59,634 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d68c10fe/22344c42a344429da48800ddf1df1c7a/FLAGf7e5a3474 [2019-01-14 04:31:00,076 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:31:00,077 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product37_true-unreach-call_false-termination.cil.c [2019-01-14 04:31:00,093 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d68c10fe/22344c42a344429da48800ddf1df1c7a/FLAGf7e5a3474 [2019-01-14 04:31:00,391 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d68c10fe/22344c42a344429da48800ddf1df1c7a [2019-01-14 04:31:00,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:31:00,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:31:00,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:31:00,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:31:00,404 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:31:00,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:31:00" (1/1) ... [2019-01-14 04:31:00,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38c77b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:31:00, skipping insertion in model container [2019-01-14 04:31:00,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:31:00" (1/1) ... [2019-01-14 04:31:00,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:31:00,476 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:31:00,899 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:31:00,931 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:31:01,011 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:31:01,125 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:31:01,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:31:01 WrapperNode [2019-01-14 04:31:01,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:31:01,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:31:01,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:31:01,126 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:31:01,132 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:01" (1/1) ... [2019-01-14 04:31:01,150 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:01" (1/1) ... [2019-01-14 04:31:01,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:31:01,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:31:01,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:31:01,197 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:31:01,208 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:01" (1/1) ... [2019-01-14 04:31:01,209 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:01" (1/1) ... [2019-01-14 04:31:01,214 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:01" (1/1) ... [2019-01-14 04:31:01,214 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:01" (1/1) ... [2019-01-14 04:31:01,226 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:01" (1/1) ... [2019-01-14 04:31:01,235 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:01" (1/1) ... [2019-01-14 04:31:01,239 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:01" (1/1) ... [2019-01-14 04:31:01,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:31:01,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:31:01,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:31:01,246 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:31:01,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:31:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:31:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:31:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:31:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:31:01,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:31:02,500 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:31:02,501 INFO L286 CfgBuilder]: Removed 170 assue(true) statements. [2019-01-14 04:31:02,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:31:02 BoogieIcfgContainer [2019-01-14 04:31:02,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:31:02,504 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:31:02,504 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:31:02,508 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:31:02,509 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:31:02,509 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:31:00" (1/3) ... [2019-01-14 04:31:02,511 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7603f98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:31:02, skipping insertion in model container [2019-01-14 04:31:02,511 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:31:02,511 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:31:01" (2/3) ... [2019-01-14 04:31:02,512 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7603f98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:31:02, skipping insertion in model container [2019-01-14 04:31:02,512 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:31:02,512 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:31:02" (3/3) ... [2019-01-14 04:31:02,515 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product37_true-unreach-call_false-termination.cil.c [2019-01-14 04:31:02,569 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:31:02,570 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:31:02,570 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:31:02,570 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:31:02,572 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:31:02,572 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:31:02,572 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:31:02,572 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:31:02,573 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:31:02,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states. [2019-01-14 04:31:02,621 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2019-01-14 04:31:02,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:31:02,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:31:02,630 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:31:02,630 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:02,630 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:31:02,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states. [2019-01-14 04:31:02,638 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2019-01-14 04:31:02,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:31:02,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:31:02,641 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:31:02,641 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:02,646 INFO L794 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(30);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(9);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(25); 7#L-1true havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~3, main_~tmp~1;havoc main_~retValue_acc~3;havoc main_~tmp~1; 9#L574true havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 18#L582true main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 78#L281true assume 0 != main_~tmp~1; 82#L253true ~switchedOnBeforeTS~0 := 0; 69#L149true havoc test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 107#L170-1true [2019-01-14 04:31:02,647 INFO L796 eck$LassoCheckResult]: Loop: 107#L170-1true assume !false; 88#L498true assume test_~splverifierCounter~0 < 4; 33#L499true test_~tmp~5 := test_#t~nondet34;havoc test_#t~nondet34; 52#L507true assume !(0 != test_~tmp~5); 54#L507-1true test_~tmp___0~2 := test_#t~nondet35;havoc test_#t~nondet35; 111#L517true assume !(0 != test_~tmp___0~2); 94#L517-1true test_~tmp___2~0 := test_#t~nondet36;havoc test_#t~nondet36; 22#L527true assume 0 != test_~tmp___2~0; 117#L533-2true havoc __utac_acc__Specification5_spec__2_#t~ret10;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 62#L427true __utac_acc__Specification5_spec__2_#t~ret10 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret10;havoc __utac_acc__Specification5_spec__2_#t~ret10; 115#L159true assume !(0 != ~pumpRunning~0); 109#L316true assume !(0 != ~systemActive~0); 26#L323true havoc __utac_acc__Specification5_spec__3_#t~ret11, __utac_acc__Specification5_spec__3_#t~ret12, __utac_acc__Specification5_spec__3_~tmp~0, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~0;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 25#L122true __utac_acc__Specification5_spec__3_#t~ret11 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~0 := __utac_acc__Specification5_spec__3_#t~ret11;havoc __utac_acc__Specification5_spec__3_#t~ret11; 116#L170true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~0); 107#L170-1true [2019-01-14 04:31:02,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:31:02,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-14 04:31:02,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:31:02,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:31:02,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:02,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:31:02,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:31:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:31:03,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:31:03,518 INFO L82 PathProgramCache]: Analyzing trace with hash 95890028, now seen corresponding path program 1 times [2019-01-14 04:31:03,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:31:03,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:31:03,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:03,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:31:03,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:31:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:31:03,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:31:03,552 INFO L82 PathProgramCache]: Analyzing trace with hash 2029915238, now seen corresponding path program 1 times [2019-01-14 04:31:03,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:31:03,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:31:03,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:03,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:31:03,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:31:03,835 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:31:03,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:31:03,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:31:04,037 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 04:31:04,157 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 04:31:04,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:31:04,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:31:04,182 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 6 states. [2019-01-14 04:31:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:31:04,467 INFO L93 Difference]: Finished difference Result 117 states and 166 transitions. [2019-01-14 04:31:04,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:31:04,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 166 transitions. [2019-01-14 04:31:04,477 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 73 [2019-01-14 04:31:04,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 110 states and 159 transitions. [2019-01-14 04:31:04,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 110 [2019-01-14 04:31:04,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2019-01-14 04:31:04,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 159 transitions. [2019-01-14 04:31:04,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:31:04,490 INFO L706 BuchiCegarLoop]: Abstraction has 110 states and 159 transitions. [2019-01-14 04:31:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 159 transitions. [2019-01-14 04:31:04,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-14 04:31:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-14 04:31:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2019-01-14 04:31:04,530 INFO L729 BuchiCegarLoop]: Abstraction has 110 states and 159 transitions. [2019-01-14 04:31:04,530 INFO L609 BuchiCegarLoop]: Abstraction has 110 states and 159 transitions. [2019-01-14 04:31:04,530 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:31:04,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 159 transitions. [2019-01-14 04:31:04,533 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 73 [2019-01-14 04:31:04,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:31:04,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:31:04,534 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:31:04,534 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:31:04,534 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(30);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(9);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(25); 259#L-1 havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~3, main_~tmp~1;havoc main_~retValue_acc~3;havoc main_~tmp~1; 260#L574 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 261#L582 main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 279#L281 assume 0 != main_~tmp~1; 346#L253 ~switchedOnBeforeTS~0 := 0; 342#L149 havoc test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 255#L170-1 [2019-01-14 04:31:04,535 INFO L796 eck$LassoCheckResult]: Loop: 255#L170-1 assume !false; 351#L498 assume test_~splverifierCounter~0 < 4; 298#L499 test_~tmp~5 := test_#t~nondet34;havoc test_#t~nondet34; 299#L507 assume !(0 != test_~tmp~5); 265#L507-1 test_~tmp___0~2 := test_#t~nondet35;havoc test_#t~nondet35; 322#L517 assume !(0 != test_~tmp___0~2); 354#L517-1 test_~tmp___2~0 := test_#t~nondet36;havoc test_#t~nondet36; 285#L527 assume 0 != test_~tmp___2~0; 258#L533-2 havoc __utac_acc__Specification5_spec__2_#t~ret10;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 333#L427 __utac_acc__Specification5_spec__2_#t~ret10 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret10;havoc __utac_acc__Specification5_spec__2_#t~ret10; 334#L159 assume !(0 != ~pumpRunning~0); 309#L316 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret15, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 357#L374 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret14, processEnvironment__wrappee__highWaterSensor_~tmp~2;havoc processEnvironment__wrappee__highWaterSensor_~tmp~2; 281#L348-1 assume !(0 == ~pumpRunning~0); 277#L323 havoc __utac_acc__Specification5_spec__3_#t~ret11, __utac_acc__Specification5_spec__3_#t~ret12, __utac_acc__Specification5_spec__3_~tmp~0, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~0;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 289#L122 __utac_acc__Specification5_spec__3_#t~ret11 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~0 := __utac_acc__Specification5_spec__3_#t~ret11;havoc __utac_acc__Specification5_spec__3_#t~ret11; 290#L170 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~0); 255#L170-1 [2019-01-14 04:31:04,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:31:04,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-14 04:31:04,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:31:04,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:31:04,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:04,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:31:04,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:31:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:31:04,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:31:04,820 INFO L82 PathProgramCache]: Analyzing trace with hash -484283837, now seen corresponding path program 1 times [2019-01-14 04:31:04,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:31:04,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:31:04,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:04,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:31:04,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:31:04,889 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:31:04,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:31:04,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:31:04,890 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:31:04,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:31:04,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:31:04,891 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. cyclomatic complexity: 51 Second operand 3 states. [2019-01-14 04:31:05,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:31:05,505 INFO L93 Difference]: Finished difference Result 159 states and 218 transitions. [2019-01-14 04:31:05,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:31:05,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 218 transitions. [2019-01-14 04:31:05,509 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 110 [2019-01-14 04:31:05,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 218 transitions. [2019-01-14 04:31:05,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2019-01-14 04:31:05,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2019-01-14 04:31:05,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 218 transitions. [2019-01-14 04:31:05,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:31:05,514 INFO L706 BuchiCegarLoop]: Abstraction has 159 states and 218 transitions. [2019-01-14 04:31:05,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 218 transitions. [2019-01-14 04:31:05,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-01-14 04:31:05,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-14 04:31:05,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 218 transitions. [2019-01-14 04:31:05,532 INFO L729 BuchiCegarLoop]: Abstraction has 159 states and 218 transitions. [2019-01-14 04:31:05,532 INFO L609 BuchiCegarLoop]: Abstraction has 159 states and 218 transitions. [2019-01-14 04:31:05,532 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:31:05,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 218 transitions. [2019-01-14 04:31:05,534 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 110 [2019-01-14 04:31:05,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:31:05,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:31:05,537 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:31:05,538 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:31:05,538 INFO L794 eck$LassoCheckResult]: Stem: 630#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(30);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(9);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(25); 534#L-1 havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~3, main_~tmp~1;havoc main_~retValue_acc~3;havoc main_~tmp~1; 535#L574 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 536#L582 main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 553#L281 assume 0 != main_~tmp~1; 627#L253 ~switchedOnBeforeTS~0 := 0; 623#L149 havoc test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 530#L170-1 [2019-01-14 04:31:05,538 INFO L796 eck$LassoCheckResult]: Loop: 530#L170-1 assume !false; 631#L498 assume test_~splverifierCounter~0 < 4; 576#L499 test_~tmp~5 := test_#t~nondet34;havoc test_#t~nondet34; 577#L507 assume !(0 != test_~tmp~5); 540#L507-1 test_~tmp___0~2 := test_#t~nondet35;havoc test_#t~nondet35; 603#L517 assume !(0 != test_~tmp___0~2); 634#L517-1 test_~tmp___2~0 := test_#t~nondet36;havoc test_#t~nondet36; 560#L527 assume 0 != test_~tmp___2~0; 533#L533-2 havoc __utac_acc__Specification5_spec__2_#t~ret10;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 614#L427 __utac_acc__Specification5_spec__2_#t~ret10 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret10;havoc __utac_acc__Specification5_spec__2_#t~ret10; 615#L159 assume !(0 != ~pumpRunning~0); 644#L316 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret15, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 637#L374 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret14, processEnvironment__wrappee__highWaterSensor_~tmp~2;havoc processEnvironment__wrappee__highWaterSensor_~tmp~2; 555#L348-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret33, isHighWaterLevel_~retValue_acc~6, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~6;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 556#L130-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 596#L135-1 isHighWaterLevel_#t~ret33 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret33;havoc isHighWaterLevel_#t~ret33; 606#L476-3 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 628#L476-5 isHighWaterLevel_~retValue_acc~6 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~6; 612#L482-1 processEnvironment__wrappee__highWaterSensor_#t~ret14 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~2 := processEnvironment__wrappee__highWaterSensor_#t~ret14;havoc processEnvironment__wrappee__highWaterSensor_#t~ret14; 613#L352-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~2); 567#L323 havoc __utac_acc__Specification5_spec__3_#t~ret11, __utac_acc__Specification5_spec__3_#t~ret12, __utac_acc__Specification5_spec__3_~tmp~0, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~0;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 563#L122 __utac_acc__Specification5_spec__3_#t~ret11 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~0 := __utac_acc__Specification5_spec__3_#t~ret11;havoc __utac_acc__Specification5_spec__3_#t~ret11; 564#L170 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~0); 530#L170-1 [2019-01-14 04:31:05,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:31:05,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-14 04:31:05,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:31:05,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:31:05,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:05,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:31:05,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:31:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:31:05,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:31:05,855 INFO L82 PathProgramCache]: Analyzing trace with hash 459590415, now seen corresponding path program 1 times [2019-01-14 04:31:05,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:31:05,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:31:05,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:05,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:31:05,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:31:06,074 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2019-01-14 04:31:06,250 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:31:06,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:31:06,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:31:06,251 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:31:06,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:31:06,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:31:06,252 INFO L87 Difference]: Start difference. First operand 159 states and 218 transitions. cyclomatic complexity: 61 Second operand 5 states. [2019-01-14 04:31:07,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:31:07,205 INFO L93 Difference]: Finished difference Result 664 states and 921 transitions. [2019-01-14 04:31:07,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 04:31:07,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 664 states and 921 transitions. [2019-01-14 04:31:07,217 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 457 [2019-01-14 04:31:07,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 664 states to 664 states and 921 transitions. [2019-01-14 04:31:07,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 664 [2019-01-14 04:31:07,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 664 [2019-01-14 04:31:07,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 664 states and 921 transitions. [2019-01-14 04:31:07,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:31:07,232 INFO L706 BuchiCegarLoop]: Abstraction has 664 states and 921 transitions. [2019-01-14 04:31:07,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states and 921 transitions. [2019-01-14 04:31:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 308. [2019-01-14 04:31:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-01-14 04:31:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 417 transitions. [2019-01-14 04:31:07,259 INFO L729 BuchiCegarLoop]: Abstraction has 308 states and 417 transitions. [2019-01-14 04:31:07,259 INFO L609 BuchiCegarLoop]: Abstraction has 308 states and 417 transitions. [2019-01-14 04:31:07,259 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:31:07,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 308 states and 417 transitions. [2019-01-14 04:31:07,263 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 218 [2019-01-14 04:31:07,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:31:07,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:31:07,264 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:31:07,264 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:31:07,264 INFO L794 eck$LassoCheckResult]: Stem: 1483#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(30);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(9);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(25); 1376#L-1 havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~3, main_~tmp~1;havoc main_~retValue_acc~3;havoc main_~tmp~1; 1377#L574 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 1378#L582 main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 1396#L281 assume 0 != main_~tmp~1; 1478#L253 ~switchedOnBeforeTS~0 := 0; 1473#L149 havoc test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1474#L170-1 [2019-01-14 04:31:07,265 INFO L796 eck$LassoCheckResult]: Loop: 1474#L170-1 assume !false; 1597#L498 assume test_~splverifierCounter~0 < 4; 1598#L499 test_~tmp~5 := test_#t~nondet34;havoc test_#t~nondet34; 1667#L507 assume !(0 != test_~tmp~5); 1664#L507-1 test_~tmp___0~2 := test_#t~nondet35;havoc test_#t~nondet35; 1663#L517 assume !(0 != test_~tmp___0~2); 1661#L517-1 test_~tmp___2~0 := test_#t~nondet36;havoc test_#t~nondet36; 1660#L527 assume 0 != test_~tmp___2~0; 1658#L533-2 havoc __utac_acc__Specification5_spec__2_#t~ret10;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 1657#L427 __utac_acc__Specification5_spec__2_#t~ret10 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret10;havoc __utac_acc__Specification5_spec__2_#t~ret10; 1646#L159 assume !(0 != ~pumpRunning~0); 1644#L316 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret15, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 1641#L374 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret14, processEnvironment__wrappee__highWaterSensor_~tmp~2;havoc processEnvironment__wrappee__highWaterSensor_~tmp~2; 1640#L348-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret33, isHighWaterLevel_~retValue_acc~6, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~6;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 1639#L130-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 1444#L135-1 isHighWaterLevel_#t~ret33 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret33;havoc isHighWaterLevel_#t~ret33; 1638#L476-3 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 1637#L476-5 isHighWaterLevel_~retValue_acc~6 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~6; 1461#L482-1 processEnvironment__wrappee__highWaterSensor_#t~ret14 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~2 := processEnvironment__wrappee__highWaterSensor_#t~ret14;havoc processEnvironment__wrappee__highWaterSensor_#t~ret14; 1462#L352-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~2); 1410#L323 havoc __utac_acc__Specification5_spec__3_#t~ret11, __utac_acc__Specification5_spec__3_#t~ret12, __utac_acc__Specification5_spec__3_~tmp~0, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~0;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 1411#L122 __utac_acc__Specification5_spec__3_#t~ret11 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~0 := __utac_acc__Specification5_spec__3_#t~ret11;havoc __utac_acc__Specification5_spec__3_#t~ret11; 1532#L170 assume 2 != __utac_acc__Specification5_spec__3_~tmp~0;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 1530#L427-1 __utac_acc__Specification5_spec__3_#t~ret12 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~0 := __utac_acc__Specification5_spec__3_#t~ret12;havoc __utac_acc__Specification5_spec__3_#t~ret12; 1531#L174 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~0); 1474#L170-1 [2019-01-14 04:31:07,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:31:07,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2019-01-14 04:31:07,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:31:07,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:31:07,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:07,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:31:07,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:31:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:31:07,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:31:07,479 INFO L82 PathProgramCache]: Analyzing trace with hash -715255062, now seen corresponding path program 1 times [2019-01-14 04:31:07,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:31:07,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:31:07,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:07,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:31:07,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:31:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:31:07,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:31:07,491 INFO L82 PathProgramCache]: Analyzing trace with hash -778681244, now seen corresponding path program 1 times [2019-01-14 04:31:07,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:31:07,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:31:07,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:07,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:31:07,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:31:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:31:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:31:08,768 WARN L181 SmtUtils]: Spent 983.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-01-14 04:31:38,500 WARN L181 SmtUtils]: Spent 29.62 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-14 04:31:52,906 WARN L181 SmtUtils]: Spent 14.40 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-14 04:31:53,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:31:53 BoogieIcfgContainer [2019-01-14 04:31:53,024 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:31:53,024 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:31:53,024 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:31:53,024 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:31:53,025 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:02" (3/4) ... [2019-01-14 04:31:53,028 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:31:53,117 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:31:53,117 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:31:53,118 INFO L168 Benchmark]: Toolchain (without parser) took 52722.79 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 337.6 MB). Free memory was 951.3 MB in the beginning and 1.3 GB in the end (delta: -378.3 MB). Peak memory consumption was 443.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:53,119 INFO L168 Benchmark]: CDTParser took 0.20 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:31:53,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:53,120 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.98 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:31:53,121 INFO L168 Benchmark]: Boogie Preprocessor took 46.46 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:31:53,121 INFO L168 Benchmark]: RCFGBuilder took 1256.67 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.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:53,122 INFO L168 Benchmark]: BuchiAutomizer took 50519.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.0 GB in the beginning and 824.1 MB in the end (delta: 223.1 MB). Peak memory consumption was 419.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:53,123 INFO L168 Benchmark]: Witness Printer took 93.14 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 25.7 MB). Free memory was 824.1 MB in the beginning and 1.3 GB in the end (delta: -505.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:53,127 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.20 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 728.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.98 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 46.46 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 1256.67 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.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 50519.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.0 GB in the beginning and 824.1 MB in the end (delta: 223.1 MB). Peak memory consumption was 419.3 MB. Max. memory is 11.5 GB. * Witness Printer took 93.14 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 25.7 MB). Free memory was 824.1 MB in the beginning and 1.3 GB in the end (delta: -505.5 MB). Peak memory consumption was 4.5 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 6 locations. The remainder module has 308 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 50.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 48.2s. Construction of modules took 1.3s. 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, 356 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 308 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 567 SDtfs, 1500 SDslu, 775 SDs, 0 SdLazy, 172 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time LassoAnalysisResults: nont1 unkn0 SFLI2 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: 497]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, NULL=0, NULL=-12, NULL=1, retValue_acc=0, NULL=-24, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7acd3ef3=0, NULL=-11, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@222911c1=0, NULL=0, NULL=0, methaneLevelCritical=0, tmp___0=0, NULL=0, tmp=0, NULL=0, NULL=0, NULL=-1, NULL=0, tmp___1=0, tmp=1, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12551c54=0, NULL=-4, NULL=-22, cleanupTimeShifts=4, switchedOnBeforeTS=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b1ae264=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2eeab9d3=57, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@564297bf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2dc0e5c5=0, NULL=0, systemActive=1, waterLevel=1, NULL=-13, \result=1, NULL=0, NULL=0, NULL=-17, \result=0, NULL=-20, NULL=0, NULL=0, tmp___0=0, \result=1, retValue_acc=1, NULL=-14, head=0, pumpRunning=0, NULL=-9, \result=0, NULL=-16, tmp=1, retValue_acc=1, NULL=0, NULL=0, \result=1, NULL=-21, NULL=-23, NULL=-3, retValue_acc=1, NULL=0, tmp=1, NULL=-8, tmp___2=57, tmp___0=0, NULL=-6, NULL=-10, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ca7ec0a=0, splverifierCounter=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5290254c=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-15, NULL=-25, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@477cf10e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c08fdbb=0, NULL=-18, tmp=0, head=0, NULL=0, NULL=0, NULL=-5, NULL=0, NULL=0, NULL=-2, NULL=-7, NULL=0, NULL=-19, retValue_acc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L143] int switchedOnBeforeTS ; [L192] int cleanupTimeShifts = 4; [L306] int pumpRunning = 0; [L307] int systemActive = 1; [L756] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L272] int retValue_acc ; [L273] int tmp ; [L578] int retValue_acc ; [L581] retValue_acc = 1 [L582] return (retValue_acc); [L279] tmp = valid_product() [L281] COND TRUE \read(tmp) [L148] switchedOnBeforeTS = 0 [L488] int splverifierCounter ; [L489] int tmp ; [L490] int tmp___0 ; [L491] int tmp___1 ; [L492] int tmp___2 ; [L495] splverifierCounter = 0 Loop: [L497] COND TRUE 1 [L499] COND TRUE splverifierCounter < 4 [L505] tmp = __VERIFIER_nondet_int() [L507] COND FALSE !(\read(tmp)) [L515] tmp___0 = __VERIFIER_nondet_int() [L517] COND FALSE !(\read(tmp___0)) [L525] tmp___2 = __VERIFIER_nondet_int() [L527] COND TRUE \read(tmp___2) [L423] int retValue_acc ; [L426] retValue_acc = pumpRunning [L427] return (retValue_acc); [L157] switchedOnBeforeTS = isPumpRunning() [L316] COND FALSE !(\read(pumpRunning)) [L323] COND TRUE \read(systemActive) [L371] int tmp ; [L374] COND FALSE !(\read(pumpRunning)) [L345] int tmp ; [L348] COND TRUE ! pumpRunning [L468] int retValue_acc ; [L469] int tmp ; [L470] int tmp___0 ; [L127] int retValue_acc ; [L130] COND TRUE waterLevel < 2 [L131] retValue_acc = 1 [L132] return (retValue_acc); [L474] tmp = isHighWaterSensorDry() [L476] COND TRUE \read(tmp) [L477] tmp___0 = 0 [L481] retValue_acc = tmp___0 [L482] return (retValue_acc); [L350] tmp = isHighWaterLevel() [L352] COND FALSE !(\read(tmp)) [L163] int tmp ; [L164] int tmp___0 ; [L118] int retValue_acc ; [L121] retValue_acc = waterLevel [L122] return (retValue_acc); [L168] tmp = getWaterLevel() [L170] COND TRUE tmp != 2 [L423] int retValue_acc ; [L426] retValue_acc = pumpRunning [L427] return (retValue_acc); [L172] tmp___0 = isPumpRunning() [L174] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...