./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product19_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec5_product19_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 9c314d63250cd17d6a50b1f2df9a5a3ff1e733f7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:50:22,436 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:50:22,438 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:50:22,455 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:50:22,456 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:50:22,458 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:50:22,461 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:50:22,464 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:50:22,466 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:50:22,468 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:50:22,469 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:50:22,471 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:50:22,472 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:50:22,473 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:50:22,477 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:50:22,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:50:22,479 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:50:22,484 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:50:22,487 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:50:22,489 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:50:22,490 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:50:22,491 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:50:22,493 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:50:22,494 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:50:22,494 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:50:22,495 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:50:22,496 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:50:22,497 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:50:22,497 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:50:22,498 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:50:22,499 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:50:22,499 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:50:22,500 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:50:22,500 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:50:22,501 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:50:22,501 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:50:22,502 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:50:22,535 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:50:22,536 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:50:22,538 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:50:22,539 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:50:22,539 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:50:22,540 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:50:22,540 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:50:22,540 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:50:22,540 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:50:22,540 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:50:22,540 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:50:22,541 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:50:22,541 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:50:22,541 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:50:22,541 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:50:22,541 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:50:22,544 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:50:22,544 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:50:22,544 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:50:22,545 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:50:22,545 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:50:22,545 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:50:22,545 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:50:22,545 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:50:22,545 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:50:22,546 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:50:22,546 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:50:22,546 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:50:22,546 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:50:22,546 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:50:22,549 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:50:22,551 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:50:22,554 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 -> 9c314d63250cd17d6a50b1f2df9a5a3ff1e733f7 [2019-01-01 23:50:22,618 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:50:22,635 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:50:22,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:50:22,645 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:50:22,645 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:50:22,647 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product19_true-unreach-call_false-termination.cil.c [2019-01-01 23:50:22,704 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d785416d8/50eaed0145244643bc3a014cd4250e82/FLAG1d2dfb6ed [2019-01-01 23:50:23,224 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:50:23,225 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product19_true-unreach-call_false-termination.cil.c [2019-01-01 23:50:23,239 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d785416d8/50eaed0145244643bc3a014cd4250e82/FLAG1d2dfb6ed [2019-01-01 23:50:23,492 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d785416d8/50eaed0145244643bc3a014cd4250e82 [2019-01-01 23:50:23,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:50:23,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:50:23,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:50:23,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:50:23,504 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:50:23,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:50:23" (1/1) ... [2019-01-01 23:50:23,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3277d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:23, skipping insertion in model container [2019-01-01 23:50:23,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:50:23" (1/1) ... [2019-01-01 23:50:23,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:50:23,584 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:50:23,926 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:50:23,942 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:50:24,032 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:50:24,073 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:50:24,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:24 WrapperNode [2019-01-01 23:50:24,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:50:24,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:50:24,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:50:24,075 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:50:24,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:24" (1/1) ... [2019-01-01 23:50:24,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:24" (1/1) ... [2019-01-01 23:50:24,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:50:24,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:50:24,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:50:24,245 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:50:24,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:24" (1/1) ... [2019-01-01 23:50:24,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:24" (1/1) ... [2019-01-01 23:50:24,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:24" (1/1) ... [2019-01-01 23:50:24,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:24" (1/1) ... [2019-01-01 23:50:24,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:24" (1/1) ... [2019-01-01 23:50:24,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:24" (1/1) ... [2019-01-01 23:50:24,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:24" (1/1) ... [2019-01-01 23:50:24,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:50:24,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:50:24,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:50:24,294 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:50:24,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:50:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:50:24,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:50:24,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:50:24,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:50:25,611 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:50:25,611 INFO L280 CfgBuilder]: Removed 114 assue(true) statements. [2019-01-01 23:50:25,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:50:25 BoogieIcfgContainer [2019-01-01 23:50:25,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:50:25,612 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:50:25,612 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:50:25,617 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:50:25,620 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:50:25,621 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:50:23" (1/3) ... [2019-01-01 23:50:25,622 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@462e9b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:50:25, skipping insertion in model container [2019-01-01 23:50:25,622 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:50:25,622 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:24" (2/3) ... [2019-01-01 23:50:25,623 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@462e9b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:50:25, skipping insertion in model container [2019-01-01 23:50:25,623 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:50:25,623 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:50:25" (3/3) ... [2019-01-01 23:50:25,626 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product19_true-unreach-call_false-termination.cil.c [2019-01-01 23:50:25,685 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:50:25,686 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:50:25,686 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:50:25,687 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:50:25,687 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:50:25,687 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:50:25,687 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:50:25,687 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:50:25,687 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:50:25,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states. [2019-01-01 23:50:25,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-01-01 23:50:25,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:25,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:25,751 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:25,752 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:25,752 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:50:25,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states. [2019-01-01 23:50:25,758 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-01-01 23:50:25,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:25,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:25,760 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:25,760 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:25,766 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(13);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(110, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 2 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 3 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(80, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(117, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(109, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(112, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(110, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 2 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 3 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(32, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string21.base, #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 1 + #t~string21.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(30);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(9);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(21);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(21);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(30);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(9);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(25);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(30);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(13);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string61.base, #t~string61.offset, 1);call write~init~int(77, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(101, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(116, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(104, #t~string61.base, 4 + #t~string61.offset, 1);call write~init~int(58, #t~string61.base, 5 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 6 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string63.base, #t~string63.offset, 1);call write~init~int(82, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(73, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(84, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 4 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(75, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string67.base, #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 1 + #t~string67.offset, 1);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4; 20#L-1true havoc main_#res;havoc main_#t~ret72, main_~retValue_acc~11, main_~tmp~7;havoc main_~retValue_acc~11;havoc main_~tmp~7; 4#L782true havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 40#L790true main_#t~ret72 := valid_product_#res;main_~tmp~7 := main_#t~ret72;havoc main_#t~ret72; 71#L927true assume 0 != main_~tmp~7; 25#L903true ~switchedOnBeforeTS~0 := 0; 39#L801true havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 16#L822-1true [2019-01-01 23:50:25,767 INFO L796 eck$LassoCheckResult]: Loop: 16#L822-1true assume !false; 62#L56true assume test_~splverifierCounter~0 < 4; 83#L57true test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 24#L65true assume !(0 != test_~tmp~0); 22#L65-1true test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 76#L75true assume !(0 != test_~tmp___0~0); 73#L75-1true test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 58#L85true assume 0 != test_~tmp___2~0; 3#L91-1true havoc __utac_acc__Specification5_spec__2_#t~ret69;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 65#L217true __utac_acc__Specification5_spec__2_#t~ret69 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret69;havoc __utac_acc__Specification5_spec__2_#t~ret69; 13#L811true assume !(0 != ~pumpRunning~0); 52#L132true assume !(0 != ~systemActive~0); 44#L139true havoc __utac_acc__Specification5_spec__3_#t~ret70, __utac_acc__Specification5_spec__3_#t~ret71, __utac_acc__Specification5_spec__3_~tmp~6, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~6;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 45#L743true __utac_acc__Specification5_spec__3_#t~ret70 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~6 := __utac_acc__Specification5_spec__3_#t~ret70;havoc __utac_acc__Specification5_spec__3_#t~ret70; 11#L822true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~6); 16#L822-1true [2019-01-01 23:50:25,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:25,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-01 23:50:25,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:25,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:25,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:25,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:25,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:26,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:26,649 INFO L82 PathProgramCache]: Analyzing trace with hash -241953451, now seen corresponding path program 1 times [2019-01-01 23:50:26,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:26,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:26,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:26,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:26,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:26,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:26,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1692071759, now seen corresponding path program 1 times [2019-01-01 23:50:26,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:26,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:26,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:26,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:26,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:50:26,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:50:26,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:50:26,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:50:27,064 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 23:50:27,176 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 23:50:27,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:50:27,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:50:27,215 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 6 states. [2019-01-01 23:50:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:50:27,699 INFO L93 Difference]: Finished difference Result 217 states and 298 transitions. [2019-01-01 23:50:27,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:50:27,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217 states and 298 transitions. [2019-01-01 23:50:27,726 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 139 [2019-01-01 23:50:27,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217 states to 196 states and 277 transitions. [2019-01-01 23:50:27,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 196 [2019-01-01 23:50:27,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196 [2019-01-01 23:50:27,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 277 transitions. [2019-01-01 23:50:27,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:50:27,751 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 277 transitions. [2019-01-01 23:50:27,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 277 transitions. [2019-01-01 23:50:27,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 125. [2019-01-01 23:50:27,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-01 23:50:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 176 transitions. [2019-01-01 23:50:27,823 INFO L728 BuchiCegarLoop]: Abstraction has 125 states and 176 transitions. [2019-01-01 23:50:27,823 INFO L608 BuchiCegarLoop]: Abstraction has 125 states and 176 transitions. [2019-01-01 23:50:27,823 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:50:27,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 176 transitions. [2019-01-01 23:50:27,826 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 88 [2019-01-01 23:50:27,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:27,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:27,828 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:27,828 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:27,828 INFO L794 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(13);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(110, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 2 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 3 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(80, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(117, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(109, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(112, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(110, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 2 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 3 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(32, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string21.base, #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 1 + #t~string21.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(30);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(9);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(21);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(21);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(30);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(9);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(25);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(30);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(13);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string61.base, #t~string61.offset, 1);call write~init~int(77, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(101, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(116, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(104, #t~string61.base, 4 + #t~string61.offset, 1);call write~init~int(58, #t~string61.base, 5 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 6 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string63.base, #t~string63.offset, 1);call write~init~int(82, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(73, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(84, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 4 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(75, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string67.base, #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 1 + #t~string67.offset, 1);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4; 349#L-1 havoc main_#res;havoc main_#t~ret72, main_~retValue_acc~11, main_~tmp~7;havoc main_~retValue_acc~11;havoc main_~tmp~7; 320#L782 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 321#L790 main_#t~ret72 := valid_product_#res;main_~tmp~7 := main_#t~ret72;havoc main_#t~ret72; 373#L927 assume 0 != main_~tmp~7; 356#L903 ~switchedOnBeforeTS~0 := 0; 357#L801 havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 333#L822-1 [2019-01-01 23:50:27,828 INFO L796 eck$LassoCheckResult]: Loop: 333#L822-1 assume !false; 342#L56 assume test_~splverifierCounter~0 < 4; 387#L57 test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 354#L65 assume !(0 != test_~tmp~0); 352#L65-1 test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 353#L75 assume !(0 != test_~tmp___0~0); 365#L75-1 test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 384#L85 assume 0 != test_~tmp___2~0; 318#L91-1 havoc __utac_acc__Specification5_spec__2_#t~ret69;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 319#L217 __utac_acc__Specification5_spec__2_#t~ret69 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret69;havoc __utac_acc__Specification5_spec__2_#t~ret69; 337#L811 assume !(0 != ~pumpRunning~0); 339#L132 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret4, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 369#L164 assume !(0 != ~pumpRunning~0); 341#L139 havoc __utac_acc__Specification5_spec__3_#t~ret70, __utac_acc__Specification5_spec__3_#t~ret71, __utac_acc__Specification5_spec__3_~tmp~6, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~6;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 377#L743 __utac_acc__Specification5_spec__3_#t~ret70 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~6 := __utac_acc__Specification5_spec__3_#t~ret70;havoc __utac_acc__Specification5_spec__3_#t~ret70; 331#L822 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~6); 333#L822-1 [2019-01-01 23:50:27,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:27,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-01 23:50:27,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:27,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:27,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:27,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:27,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:28,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:28,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1062384515, now seen corresponding path program 1 times [2019-01-01 23:50:28,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:28,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:28,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:28,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:50:28,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:28,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:28,184 INFO L82 PathProgramCache]: Analyzing trace with hash 887623881, now seen corresponding path program 1 times [2019-01-01 23:50:28,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:28,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:28,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:28,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:28,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:50:28,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:50:28,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:50:28,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:50:28,639 WARN L181 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 23:50:28,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:50:28,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:50:28,692 INFO L87 Difference]: Start difference. First operand 125 states and 176 transitions. cyclomatic complexity: 54 Second operand 5 states. [2019-01-01 23:50:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:50:29,435 INFO L93 Difference]: Finished difference Result 338 states and 468 transitions. [2019-01-01 23:50:29,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:50:29,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 468 transitions. [2019-01-01 23:50:29,442 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 170 [2019-01-01 23:50:29,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 338 states and 468 transitions. [2019-01-01 23:50:29,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2019-01-01 23:50:29,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2019-01-01 23:50:29,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 468 transitions. [2019-01-01 23:50:29,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:50:29,451 INFO L705 BuchiCegarLoop]: Abstraction has 338 states and 468 transitions. [2019-01-01 23:50:29,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 468 transitions. [2019-01-01 23:50:29,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 243. [2019-01-01 23:50:29,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-01-01 23:50:29,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 331 transitions. [2019-01-01 23:50:29,474 INFO L728 BuchiCegarLoop]: Abstraction has 243 states and 331 transitions. [2019-01-01 23:50:29,474 INFO L608 BuchiCegarLoop]: Abstraction has 243 states and 331 transitions. [2019-01-01 23:50:29,474 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:50:29,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 243 states and 331 transitions. [2019-01-01 23:50:29,476 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 170 [2019-01-01 23:50:29,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:29,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:29,477 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:29,478 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:29,478 INFO L794 eck$LassoCheckResult]: Stem: 862#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(13);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(110, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 2 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 3 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(80, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(117, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(109, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(112, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(110, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 2 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 3 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(32, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string21.base, #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 1 + #t~string21.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(30);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(9);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(21);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(21);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(30);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(9);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(25);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(30);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(13);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string61.base, #t~string61.offset, 1);call write~init~int(77, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(101, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(116, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(104, #t~string61.base, 4 + #t~string61.offset, 1);call write~init~int(58, #t~string61.base, 5 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 6 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string63.base, #t~string63.offset, 1);call write~init~int(82, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(73, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(84, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 4 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(75, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string67.base, #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 1 + #t~string67.offset, 1);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4; 830#L-1 havoc main_#res;havoc main_#t~ret72, main_~retValue_acc~11, main_~tmp~7;havoc main_~retValue_acc~11;havoc main_~tmp~7; 799#L782 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 800#L790 main_#t~ret72 := valid_product_#res;main_~tmp~7 := main_#t~ret72;havoc main_#t~ret72; 858#L927 assume 0 != main_~tmp~7; 837#L903 ~switchedOnBeforeTS~0 := 0; 838#L801 havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 857#L822-1 [2019-01-01 23:50:29,478 INFO L796 eck$LassoCheckResult]: Loop: 857#L822-1 assume !false; 937#L56 assume test_~splverifierCounter~0 < 4; 938#L57 test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 967#L65 assume !(0 != test_~tmp~0); 966#L65-1 test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 965#L75 assume !(0 != test_~tmp___0~0); 963#L75-1 test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 962#L85 assume 0 != test_~tmp___2~0; 806#L91-1 havoc __utac_acc__Specification5_spec__2_#t~ret69;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 959#L217 __utac_acc__Specification5_spec__2_#t~ret69 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret69;havoc __utac_acc__Specification5_spec__2_#t~ret69; 958#L811 assume !(0 != ~pumpRunning~0); 948#L132 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret4, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 929#L164 assume !(0 != ~pumpRunning~0); 946#L139 havoc __utac_acc__Specification5_spec__3_#t~ret70, __utac_acc__Specification5_spec__3_#t~ret71, __utac_acc__Specification5_spec__3_~tmp~6, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~6;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 945#L743 __utac_acc__Specification5_spec__3_#t~ret70 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~6 := __utac_acc__Specification5_spec__3_#t~ret70;havoc __utac_acc__Specification5_spec__3_#t~ret70; 944#L822 assume 2 != __utac_acc__Specification5_spec__3_~tmp~6;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 943#L217-1 __utac_acc__Specification5_spec__3_#t~ret71 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~2 := __utac_acc__Specification5_spec__3_#t~ret71;havoc __utac_acc__Specification5_spec__3_#t~ret71; 942#L826 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~2); 857#L822-1 [2019-01-01 23:50:29,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:29,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-01 23:50:29,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:29,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:29,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:29,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:29,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:29,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:29,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1250711394, now seen corresponding path program 1 times [2019-01-01 23:50:29,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:29,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:29,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:29,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:50:29,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:29,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:29,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1691956124, now seen corresponding path program 1 times [2019-01-01 23:50:29,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:29,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:29,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:29,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:29,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:31,041 WARN L181 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-01-01 23:50:31,537 WARN L181 SmtUtils]: Spent 488.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 23:50:59,632 WARN L181 SmtUtils]: Spent 28.08 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-01 23:51:13,814 WARN L181 SmtUtils]: Spent 14.17 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-01 23:51:13,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:51:13 BoogieIcfgContainer [2019-01-01 23:51:13,891 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:51:13,892 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:51:13,892 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:51:13,892 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:51:13,893 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:50:25" (3/4) ... [2019-01-01 23:51:13,898 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:51:14,001 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:51:14,002 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:51:14,004 INFO L168 Benchmark]: Toolchain (without parser) took 50508.38 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.1 MB). Free memory was 952.7 MB in the beginning and 868.8 MB in the end (delta: 83.9 MB). Peak memory consumption was 400.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:14,005 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:51:14,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 575.51 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:14,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 169.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:14,009 INFO L168 Benchmark]: Boogie Preprocessor took 47.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:51:14,009 INFO L168 Benchmark]: RCFGBuilder took 1318.65 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: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:14,010 INFO L168 Benchmark]: BuchiAutomizer took 48278.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 872.0 MB in the end (delta: 190.4 MB). Peak memory consumption was 430.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:14,011 INFO L168 Benchmark]: Witness Printer took 111.86 ms. Allocated memory is still 1.3 GB. Free memory was 872.0 MB in the beginning and 868.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:14,025 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.36 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 575.51 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 169.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.93 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 1318.65 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: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 48278.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 872.0 MB in the end (delta: 190.4 MB). Peak memory consumption was 430.8 MB. Max. memory is 11.5 GB. * Witness Printer took 111.86 ms. Allocated memory is still 1.3 GB. Free memory was 872.0 MB in the beginning and 868.8 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 6 locations. The remainder module has 243 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 48.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 46.6s. Construction of modules took 0.8s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 166 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 243 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 278 SDtfs, 861 SDslu, 849 SDs, 0 SdLazy, 120 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 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: 55]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=9837} State at position 1 is {NULL=-11, NULL=0, NULL=-18, NULL=0, NULL=0, NULL=9837, NULL=-12, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16b03e89=0, NULL=-1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5cfc5dc4=63, NULL=-16, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@145a873d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7fbb15a0=0, NULL=0, NULL=0, NULL=-10, methaneLevelCritical=0, tmp=1, retValue_acc=1, NULL=0, NULL=-5, NULL=0, tmp___1=0, cleanupTimeShifts=4, tmp=0, switchedOnBeforeTS=0, NULL=-21, NULL=-15, NULL=-3, \result=0, NULL=-24, NULL=-9, NULL=0, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=-4, NULL=0, tmp___0=0, NULL=0, NULL=0, NULL=0, retValue_acc=0, NULL=0, \result=1, head=0, pumpRunning=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ef6248e=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@509f1983=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40fde8ac=0, NULL=-17, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e1d64e=0, NULL=-8, NULL=0, NULL=0, tmp=1, NULL=0, NULL=0, NULL=-20, NULL=-6, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8b3332=0, retValue_acc=1, tmp___2=63, splverifierCounter=0, NULL=0, NULL=0, NULL=0, NULL=-13, NULL=-19, tmp=0, head=0, retValue_acc=0, NULL=-14, NULL=9836, NULL=0, NULL=0, NULL=-2, NULL=-23, NULL=-22, NULL=-7} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L120] int pumpRunning = 0; [L121] int systemActive = 1; [L470] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L668] int waterLevel = 1; [L669] int methaneLevelCritical = 0; [L795] int switchedOnBeforeTS ; [L844] int cleanupTimeShifts = 4; [L918] int retValue_acc ; [L919] int tmp ; [L786] int retValue_acc ; [L789] retValue_acc = 1 [L790] return (retValue_acc); [L925] tmp = valid_product() [L927] COND TRUE \read(tmp) [L800] switchedOnBeforeTS = 0 [L46] int splverifierCounter ; [L47] int tmp ; [L48] int tmp___0 ; [L49] int tmp___1 ; [L50] int tmp___2 ; [L53] splverifierCounter = 0 Loop: [L55] COND TRUE 1 [L57] COND TRUE splverifierCounter < 4 [L63] tmp = __VERIFIER_nondet_int() [L65] COND FALSE !(\read(tmp)) [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp___0)) [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___2) [L213] int retValue_acc ; [L216] retValue_acc = pumpRunning [L217] return (retValue_acc); [L809] switchedOnBeforeTS = isPumpRunning() [L132] COND FALSE !(\read(pumpRunning)) [L139] COND TRUE \read(systemActive) [L161] int tmp ; [L164] COND FALSE !(\read(pumpRunning)) [L815] int tmp ; [L816] int tmp___0 ; [L739] int retValue_acc ; [L742] retValue_acc = waterLevel [L743] return (retValue_acc); [L820] tmp = getWaterLevel() [L822] COND TRUE tmp != 2 [L213] int retValue_acc ; [L216] retValue_acc = pumpRunning [L217] return (retValue_acc); [L824] tmp___0 = isPumpRunning() [L826] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...