./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product36_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_product36_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 69211a6a9810795915a638c419bc12fc6aa00ac5 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:51:28,694 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:51:28,696 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:51:28,709 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:51:28,709 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:51:28,710 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:51:28,712 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:51:28,715 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:51:28,717 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:51:28,718 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:51:28,719 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:51:28,720 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:51:28,721 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:51:28,722 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:51:28,724 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:51:28,725 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:51:28,726 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:51:28,728 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:51:28,731 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:51:28,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:51:28,734 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:51:28,736 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:51:28,739 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:51:28,739 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:51:28,740 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:51:28,741 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:51:28,742 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:51:28,743 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:51:28,744 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:51:28,746 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:51:28,746 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:51:28,747 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:51:28,748 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:51:28,748 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:51:28,749 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:51:28,751 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:51:28,751 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:51:28,776 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:51:28,777 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:51:28,778 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:51:28,779 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:51:28,779 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:51:28,779 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:51:28,779 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:51:28,779 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:51:28,780 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:51:28,780 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:51:28,780 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:51:28,780 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:51:28,780 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:51:28,782 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:51:28,782 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:51:28,782 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:51:28,782 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:51:28,782 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:51:28,783 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:51:28,783 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:51:28,784 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:51:28,784 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:51:28,784 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:51:28,784 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:51:28,784 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:51:28,785 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:51:28,786 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:51:28,786 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:51:28,786 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:51:28,786 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:51:28,787 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:51:28,788 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:51:28,788 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 -> 69211a6a9810795915a638c419bc12fc6aa00ac5 [2019-01-01 23:51:28,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:51:28,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:51:28,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:51:28,845 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:51:28,845 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:51:28,846 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product36_true-unreach-call_false-termination.cil.c [2019-01-01 23:51:28,908 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15ecfbc34/92b5aa2cd36b45698e63a4afc497116f/FLAGa4f8228c9 [2019-01-01 23:51:29,442 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:51:29,444 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product36_true-unreach-call_false-termination.cil.c [2019-01-01 23:51:29,462 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15ecfbc34/92b5aa2cd36b45698e63a4afc497116f/FLAGa4f8228c9 [2019-01-01 23:51:29,732 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15ecfbc34/92b5aa2cd36b45698e63a4afc497116f [2019-01-01 23:51:29,737 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:51:29,739 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:51:29,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:51:29,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:51:29,744 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:51:29,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:51:29" (1/1) ... [2019-01-01 23:51:29,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74fb2347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:29, skipping insertion in model container [2019-01-01 23:51:29,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:51:29" (1/1) ... [2019-01-01 23:51:29,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:51:29,812 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:51:30,239 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:51:30,271 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:51:30,365 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:51:30,484 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:51:30,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:30 WrapperNode [2019-01-01 23:51:30,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:51:30,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:51:30,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:51:30,486 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:51:30,497 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:51:30" (1/1) ... [2019-01-01 23:51:30,517 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:51:30" (1/1) ... [2019-01-01 23:51:30,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:51:30,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:51:30,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:51:30,567 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:51:30,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:30" (1/1) ... [2019-01-01 23:51:30,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:30" (1/1) ... [2019-01-01 23:51:30,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:30" (1/1) ... [2019-01-01 23:51:30,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:30" (1/1) ... [2019-01-01 23:51:30,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:30" (1/1) ... [2019-01-01 23:51:30,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:30" (1/1) ... [2019-01-01 23:51:30,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:30" (1/1) ... [2019-01-01 23:51:30,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:51:30,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:51:30,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:51:30,646 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:51:30,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:30" (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:51:30,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:51:30,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:51:30,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:51:30,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:51:31,894 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:51:31,894 INFO L280 CfgBuilder]: Removed 116 assue(true) statements. [2019-01-01 23:51:31,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:51:31 BoogieIcfgContainer [2019-01-01 23:51:31,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:51:31,896 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:51:31,896 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:51:31,900 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:51:31,901 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:51:31,902 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:51:29" (1/3) ... [2019-01-01 23:51:31,903 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cfcac54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:51:31, skipping insertion in model container [2019-01-01 23:51:31,904 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:51:31,904 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:30" (2/3) ... [2019-01-01 23:51:31,905 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cfcac54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:51:31, skipping insertion in model container [2019-01-01 23:51:31,905 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:51:31,905 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:51:31" (3/3) ... [2019-01-01 23:51:31,908 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product36_true-unreach-call_false-termination.cil.c [2019-01-01 23:51:31,965 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:51:31,966 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:51:31,966 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:51:31,966 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:51:31,966 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:51:31,966 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:51:31,967 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:51:31,967 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:51:31,967 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:51:31,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states. [2019-01-01 23:51:32,012 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 55 [2019-01-01 23:51:32,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:32,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:32,022 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:32,023 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:51:32,023 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:51:32,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states. [2019-01-01 23:51:32,030 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 55 [2019-01-01 23:51:32,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:32,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:32,032 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:32,032 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:51:32,039 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string6.base, #t~string6.offset, 1);call write~init~int(110, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 2 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 3 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(80, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(117, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(109, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(112, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(110, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 3 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(32, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string18.base, #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 1 + #t~string18.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(30);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(9);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(21);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~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(25);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);~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(13);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string66.base, #t~string66.offset, 1);call write~init~int(77, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(101, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(116, #t~string66.base, 3 + #t~string66.offset, 1);call write~init~int(104, #t~string66.base, 4 + #t~string66.offset, 1);call write~init~int(58, #t~string66.base, 5 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 6 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string68.base, #t~string68.offset, 1);call write~init~int(82, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(73, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(84, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 4 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string70.base, #t~string70.offset, 1);call write~init~int(75, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 2 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string72.base, #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 1 + #t~string72.offset, 1); 16#L-1true havoc main_#res;havoc main_#t~ret59, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 18#L65true havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 12#L73true main_#t~ret59 := valid_product_#res;main_~tmp~6 := main_#t~ret59;havoc main_#t~ret59; 8#L800true assume 0 != main_~tmp~6; 21#L775true ~switchedOnBeforeTS~0 := 0; 81#L821true havoc test_#t~nondet55, test_#t~nondet56, test_#t~nondet57, test_#t~nondet58, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 38#L842-1true [2019-01-01 23:51:32,040 INFO L796 eck$LassoCheckResult]: Loop: 38#L842-1true assume !false; 19#L658true assume test_~splverifierCounter~0 < 4; 42#L659true test_~tmp~5 := test_#t~nondet55;havoc test_#t~nondet55; 71#L667true assume !(0 != test_~tmp~5); 74#L667-1true test_~tmp___0~1 := test_#t~nondet56;havoc test_#t~nondet56; 50#L677true assume !(0 != test_~tmp___0~1); 32#L677-1true test_~tmp___2~0 := test_#t~nondet57;havoc test_#t~nondet57; 31#L687true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 35#L695-1true havoc __utac_acc__Specification5_spec__2_#t~ret60;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~3;havoc isPumpRunning_~retValue_acc~3;isPumpRunning_~retValue_acc~3 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~3; 73#L195true __utac_acc__Specification5_spec__2_#t~ret60 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret60;havoc __utac_acc__Specification5_spec__2_#t~ret60; 65#L831true assume !(0 != ~pumpRunning~0); 51#L110true assume !(0 != ~systemActive~0); 40#L117true havoc __utac_acc__Specification5_spec__3_#t~ret61, __utac_acc__Specification5_spec__3_#t~ret62, __utac_acc__Specification5_spec__3_~tmp~7, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~7;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 7#L939true __utac_acc__Specification5_spec__3_#t~ret61 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~7 := __utac_acc__Specification5_spec__3_#t~ret61;havoc __utac_acc__Specification5_spec__3_#t~ret61; 63#L842true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~7); 38#L842-1true [2019-01-01 23:51:32,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:32,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-01 23:51:32,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:32,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:32,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:32,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:32,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:32,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:32,835 INFO L82 PathProgramCache]: Analyzing trace with hash 675287606, now seen corresponding path program 1 times [2019-01-01 23:51:32,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:32,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:32,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:32,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:32,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:51:32,944 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:51:32,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:51:32,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:51:32,953 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:51:32,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:51:32,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:51:32,976 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-01-01 23:51:33,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:51:33,154 INFO L93 Difference]: Finished difference Result 165 states and 233 transitions. [2019-01-01 23:51:33,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:51:33,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 233 transitions. [2019-01-01 23:51:33,165 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 106 [2019-01-01 23:51:33,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 151 states and 218 transitions. [2019-01-01 23:51:33,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2019-01-01 23:51:33,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2019-01-01 23:51:33,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 218 transitions. [2019-01-01 23:51:33,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:51:33,180 INFO L705 BuchiCegarLoop]: Abstraction has 151 states and 218 transitions. [2019-01-01 23:51:33,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 218 transitions. [2019-01-01 23:51:33,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2019-01-01 23:51:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-01 23:51:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 215 transitions. [2019-01-01 23:51:33,220 INFO L728 BuchiCegarLoop]: Abstraction has 149 states and 215 transitions. [2019-01-01 23:51:33,220 INFO L608 BuchiCegarLoop]: Abstraction has 149 states and 215 transitions. [2019-01-01 23:51:33,220 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:51:33,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 215 transitions. [2019-01-01 23:51:33,224 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 104 [2019-01-01 23:51:33,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:33,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:33,225 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:33,225 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:51:33,225 INFO L794 eck$LassoCheckResult]: Stem: 315#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string6.base, #t~string6.offset, 1);call write~init~int(110, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 2 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 3 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(80, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(117, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(109, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(112, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(110, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 3 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(32, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string18.base, #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 1 + #t~string18.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(30);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(9);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(21);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~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(25);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);~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(13);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string66.base, #t~string66.offset, 1);call write~init~int(77, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(101, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(116, #t~string66.base, 3 + #t~string66.offset, 1);call write~init~int(104, #t~string66.base, 4 + #t~string66.offset, 1);call write~init~int(58, #t~string66.base, 5 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 6 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string68.base, #t~string68.offset, 1);call write~init~int(82, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(73, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(84, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 4 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string70.base, #t~string70.offset, 1);call write~init~int(75, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 2 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string72.base, #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 1 + #t~string72.offset, 1); 281#L-1 havoc main_#res;havoc main_#t~ret59, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 282#L65 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 278#L73 main_#t~ret59 := valid_product_#res;main_~tmp~6 := main_#t~ret59;havoc main_#t~ret59; 270#L800 assume 0 != main_~tmp~6; 271#L775 ~switchedOnBeforeTS~0 := 0; 290#L821 havoc test_#t~nondet55, test_#t~nondet56, test_#t~nondet57, test_#t~nondet58, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 358#L842-1 [2019-01-01 23:51:33,226 INFO L796 eck$LassoCheckResult]: Loop: 358#L842-1 assume !false; 372#L658 assume test_~splverifierCounter~0 < 4; 316#L659 test_~tmp~5 := test_#t~nondet55;havoc test_#t~nondet55; 317#L667 assume !(0 != test_~tmp~5); 352#L667-1 test_~tmp___0~1 := test_#t~nondet56;havoc test_#t~nondet56; 353#L677 assume !(0 != test_~tmp___0~1); 369#L677-1 test_~tmp___2~0 := test_#t~nondet57;havoc test_#t~nondet57; 368#L687 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 305#L695-1 havoc __utac_acc__Specification5_spec__2_#t~ret60;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~3;havoc isPumpRunning_~retValue_acc~3;isPumpRunning_~retValue_acc~3 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~3; 350#L195 __utac_acc__Specification5_spec__2_#t~ret60 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret60;havoc __utac_acc__Specification5_spec__2_#t~ret60; 351#L831 assume !(0 != ~pumpRunning~0); 330#L110 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret1, processEnvironment_~tmp~0;havoc processEnvironment_~tmp~0; 300#L142 assume !(0 == ~pumpRunning~0); 267#L117 havoc __utac_acc__Specification5_spec__3_#t~ret61, __utac_acc__Specification5_spec__3_#t~ret62, __utac_acc__Specification5_spec__3_~tmp~7, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~7;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 268#L939 __utac_acc__Specification5_spec__3_#t~ret61 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~7 := __utac_acc__Specification5_spec__3_#t~ret61;havoc __utac_acc__Specification5_spec__3_#t~ret61; 269#L842 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~7); 358#L842-1 [2019-01-01 23:51:33,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:33,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-01 23:51:33,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:33,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:33,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:33,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:33,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:33,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:33,536 INFO L82 PathProgramCache]: Analyzing trace with hash -572531389, now seen corresponding path program 1 times [2019-01-01 23:51:33,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:33,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:33,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:33,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:51:33,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:51:33,599 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:51:33,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:51:33,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:51:33,600 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:51:33,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:51:33,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:51:33,601 INFO L87 Difference]: Start difference. First operand 149 states and 215 transitions. cyclomatic complexity: 69 Second operand 3 states. [2019-01-01 23:51:33,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:51:33,861 INFO L93 Difference]: Finished difference Result 248 states and 343 transitions. [2019-01-01 23:51:33,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:51:33,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 343 transitions. [2019-01-01 23:51:33,868 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 179 [2019-01-01 23:51:33,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 248 states and 343 transitions. [2019-01-01 23:51:33,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 248 [2019-01-01 23:51:33,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 248 [2019-01-01 23:51:33,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 248 states and 343 transitions. [2019-01-01 23:51:33,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:51:33,876 INFO L705 BuchiCegarLoop]: Abstraction has 248 states and 343 transitions. [2019-01-01 23:51:33,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states and 343 transitions. [2019-01-01 23:51:33,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-01-01 23:51:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-01 23:51:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 343 transitions. [2019-01-01 23:51:33,895 INFO L728 BuchiCegarLoop]: Abstraction has 248 states and 343 transitions. [2019-01-01 23:51:33,895 INFO L608 BuchiCegarLoop]: Abstraction has 248 states and 343 transitions. [2019-01-01 23:51:33,895 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:51:33,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 248 states and 343 transitions. [2019-01-01 23:51:33,899 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 179 [2019-01-01 23:51:33,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:33,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:33,900 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:33,900 INFO L867 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] [2019-01-01 23:51:33,901 INFO L794 eck$LassoCheckResult]: Stem: 724#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string6.base, #t~string6.offset, 1);call write~init~int(110, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 2 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 3 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(80, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(117, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(109, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(112, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(110, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 3 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(32, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string18.base, #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 1 + #t~string18.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(30);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(9);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(21);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~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(25);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);~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(13);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string66.base, #t~string66.offset, 1);call write~init~int(77, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(101, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(116, #t~string66.base, 3 + #t~string66.offset, 1);call write~init~int(104, #t~string66.base, 4 + #t~string66.offset, 1);call write~init~int(58, #t~string66.base, 5 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 6 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string68.base, #t~string68.offset, 1);call write~init~int(82, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(73, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(84, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 4 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string70.base, #t~string70.offset, 1);call write~init~int(75, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 2 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string72.base, #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 1 + #t~string72.offset, 1); 686#L-1 havoc main_#res;havoc main_#t~ret59, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 687#L65 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 685#L73 main_#t~ret59 := valid_product_#res;main_~tmp~6 := main_#t~ret59;havoc main_#t~ret59; 679#L800 assume 0 != main_~tmp~6; 680#L775 ~switchedOnBeforeTS~0 := 0; 697#L821 havoc test_#t~nondet55, test_#t~nondet56, test_#t~nondet57, test_#t~nondet58, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 767#L842-1 [2019-01-01 23:51:33,902 INFO L796 eck$LassoCheckResult]: Loop: 767#L842-1 assume !false; 842#L658 assume test_~splverifierCounter~0 < 4; 841#L659 test_~tmp~5 := test_#t~nondet55;havoc test_#t~nondet55; 815#L667 assume !(0 != test_~tmp~5); 814#L667-1 test_~tmp___0~1 := test_#t~nondet56;havoc test_#t~nondet56; 808#L677 assume !(0 != test_~tmp___0~1); 807#L677-1 test_~tmp___2~0 := test_#t~nondet57;havoc test_#t~nondet57; 707#L687 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 709#L695-1 havoc __utac_acc__Specification5_spec__2_#t~ret60;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~3;havoc isPumpRunning_~retValue_acc~3;isPumpRunning_~retValue_acc~3 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~3; 837#L195 __utac_acc__Specification5_spec__2_#t~ret60 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret60;havoc __utac_acc__Specification5_spec__2_#t~ret60; 751#L831 assume !(0 != ~pumpRunning~0); 752#L110 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret1, processEnvironment_~tmp~0;havoc processEnvironment_~tmp~0; 704#L142 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret19, isHighWaterLevel_~retValue_acc~4, isHighWaterLevel_~tmp~1, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~4;havoc isHighWaterLevel_~tmp~1;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 705#L947 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 742#L952 isHighWaterLevel_#t~ret19 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~1 := isHighWaterLevel_#t~ret19;havoc isHighWaterLevel_#t~ret19; 743#L244 assume 0 != isHighWaterLevel_~tmp~1;isHighWaterLevel_~tmp___0~0 := 0; 765#L244-2 isHighWaterLevel_~retValue_acc~4 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~4; 766#L250 processEnvironment_#t~ret1 := isHighWaterLevel_#res;processEnvironment_~tmp~0 := processEnvironment_#t~ret1;havoc processEnvironment_#t~ret1; 671#L146 assume !(0 != processEnvironment_~tmp~0); 673#L117 havoc __utac_acc__Specification5_spec__3_#t~ret61, __utac_acc__Specification5_spec__3_#t~ret62, __utac_acc__Specification5_spec__3_~tmp~7, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~7;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 674#L939 __utac_acc__Specification5_spec__3_#t~ret61 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~7 := __utac_acc__Specification5_spec__3_#t~ret61;havoc __utac_acc__Specification5_spec__3_#t~ret61; 675#L842 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~7); 767#L842-1 [2019-01-01 23:51:33,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:33,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-01 23:51:33,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:33,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:33,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:33,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:33,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:34,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:34,132 INFO L82 PathProgramCache]: Analyzing trace with hash -535419313, now seen corresponding path program 1 times [2019-01-01 23:51:34,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:34,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:34,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:34,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:51:34,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:51:34,355 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2019-01-01 23:51:34,511 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:51:34,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:51:34,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:51:34,516 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:51:34,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:51:34,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:51:34,517 INFO L87 Difference]: Start difference. First operand 248 states and 343 transitions. cyclomatic complexity: 98 Second operand 5 states. [2019-01-01 23:51:35,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:51:35,360 INFO L93 Difference]: Finished difference Result 923 states and 1283 transitions. [2019-01-01 23:51:35,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 23:51:35,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 923 states and 1283 transitions. [2019-01-01 23:51:35,372 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 662 [2019-01-01 23:51:35,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 923 states to 923 states and 1283 transitions. [2019-01-01 23:51:35,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 923 [2019-01-01 23:51:35,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 923 [2019-01-01 23:51:35,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 923 states and 1283 transitions. [2019-01-01 23:51:35,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:51:35,391 INFO L705 BuchiCegarLoop]: Abstraction has 923 states and 1283 transitions. [2019-01-01 23:51:35,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states and 1283 transitions. [2019-01-01 23:51:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 483. [2019-01-01 23:51:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-01-01 23:51:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 655 transitions. [2019-01-01 23:51:35,424 INFO L728 BuchiCegarLoop]: Abstraction has 483 states and 655 transitions. [2019-01-01 23:51:35,424 INFO L608 BuchiCegarLoop]: Abstraction has 483 states and 655 transitions. [2019-01-01 23:51:35,424 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:51:35,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 483 states and 655 transitions. [2019-01-01 23:51:35,429 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 354 [2019-01-01 23:51:35,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:35,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:35,430 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:35,430 INFO L867 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] [2019-01-01 23:51:35,431 INFO L794 eck$LassoCheckResult]: Stem: 1916#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string6.base, #t~string6.offset, 1);call write~init~int(110, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 2 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 3 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(80, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(117, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(109, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(112, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(110, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 3 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(32, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string18.base, #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 1 + #t~string18.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(30);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(9);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(21);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~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(25);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);~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(13);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string66.base, #t~string66.offset, 1);call write~init~int(77, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(101, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(116, #t~string66.base, 3 + #t~string66.offset, 1);call write~init~int(104, #t~string66.base, 4 + #t~string66.offset, 1);call write~init~int(58, #t~string66.base, 5 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 6 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string68.base, #t~string68.offset, 1);call write~init~int(82, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(73, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(84, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 4 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string70.base, #t~string70.offset, 1);call write~init~int(75, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 2 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string72.base, #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 1 + #t~string72.offset, 1); 1879#L-1 havoc main_#res;havoc main_#t~ret59, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 1880#L65 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 1875#L73 main_#t~ret59 := valid_product_#res;main_~tmp~6 := main_#t~ret59;havoc main_#t~ret59; 1867#L800 assume 0 != main_~tmp~6; 1868#L775 ~switchedOnBeforeTS~0 := 0; 1889#L821 havoc test_#t~nondet55, test_#t~nondet56, test_#t~nondet57, test_#t~nondet58, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1957#L842-1 [2019-01-01 23:51:35,432 INFO L796 eck$LassoCheckResult]: Loop: 1957#L842-1 assume !false; 2121#L658 assume test_~splverifierCounter~0 < 4; 2120#L659 test_~tmp~5 := test_#t~nondet55;havoc test_#t~nondet55; 2119#L667 assume !(0 != test_~tmp~5); 2117#L667-1 test_~tmp___0~1 := test_#t~nondet56;havoc test_#t~nondet56; 2116#L677 assume !(0 != test_~tmp___0~1); 2114#L677-1 test_~tmp___2~0 := test_#t~nondet57;havoc test_#t~nondet57; 2097#L687 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 2060#L695-1 havoc __utac_acc__Specification5_spec__2_#t~ret60;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~3;havoc isPumpRunning_~retValue_acc~3;isPumpRunning_~retValue_acc~3 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~3; 2058#L195 __utac_acc__Specification5_spec__2_#t~ret60 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret60;havoc __utac_acc__Specification5_spec__2_#t~ret60; 2056#L831 assume !(0 != ~pumpRunning~0); 2055#L110 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret1, processEnvironment_~tmp~0;havoc processEnvironment_~tmp~0; 2054#L142 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret19, isHighWaterLevel_~retValue_acc~4, isHighWaterLevel_~tmp~1, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~4;havoc isHighWaterLevel_~tmp~1;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 2030#L947 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 2049#L952 isHighWaterLevel_#t~ret19 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~1 := isHighWaterLevel_#t~ret19;havoc isHighWaterLevel_#t~ret19; 2037#L244 assume 0 != isHighWaterLevel_~tmp~1;isHighWaterLevel_~tmp___0~0 := 0; 2036#L244-2 isHighWaterLevel_~retValue_acc~4 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~4; 2035#L250 processEnvironment_#t~ret1 := isHighWaterLevel_#res;processEnvironment_~tmp~0 := processEnvironment_#t~ret1;havoc processEnvironment_#t~ret1; 2031#L146 assume !(0 != processEnvironment_~tmp~0); 2032#L117 havoc __utac_acc__Specification5_spec__3_#t~ret61, __utac_acc__Specification5_spec__3_#t~ret62, __utac_acc__Specification5_spec__3_~tmp~7, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~7;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 2127#L939 __utac_acc__Specification5_spec__3_#t~ret61 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~7 := __utac_acc__Specification5_spec__3_#t~ret61;havoc __utac_acc__Specification5_spec__3_#t~ret61; 2126#L842 assume 2 != __utac_acc__Specification5_spec__3_~tmp~7;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~3;havoc isPumpRunning_~retValue_acc~3;isPumpRunning_~retValue_acc~3 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~3; 2125#L195-1 __utac_acc__Specification5_spec__3_#t~ret62 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~2 := __utac_acc__Specification5_spec__3_#t~ret62;havoc __utac_acc__Specification5_spec__3_#t~ret62; 2124#L846 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~2); 1957#L842-1 [2019-01-01 23:51:35,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:35,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2019-01-01 23:51:35,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:35,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:35,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:35,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:35,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:35,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:35,660 INFO L82 PathProgramCache]: Analyzing trace with hash 858102058, now seen corresponding path program 1 times [2019-01-01 23:51:35,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:35,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:35,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:35,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:51:35,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:35,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:35,676 INFO L82 PathProgramCache]: Analyzing trace with hash 717508720, now seen corresponding path program 1 times [2019-01-01 23:51:35,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:35,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:35,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:35,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:35,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:37,083 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-01-01 23:51:37,203 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 23:52:00,983 WARN L181 SmtUtils]: Spent 23.76 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-01 23:52:15,107 WARN L181 SmtUtils]: Spent 14.12 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-01 23:52:15,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:52:15 BoogieIcfgContainer [2019-01-01 23:52:15,203 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:52:15,204 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:52:15,204 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:52:15,204 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:52:15,206 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:51:31" (3/4) ... [2019-01-01 23:52:15,211 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:52:15,299 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:52:15,299 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:52:15,301 INFO L168 Benchmark]: Toolchain (without parser) took 45562.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.2 MB). Free memory was 952.7 MB in the beginning and 836.6 MB in the end (delta: 116.1 MB). Peak memory consumption was 390.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:15,302 INFO L168 Benchmark]: CDTParser took 0.17 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:52:15,302 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -139.5 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:15,304 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:15,305 INFO L168 Benchmark]: Boogie Preprocessor took 78.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:52:15,305 INFO L168 Benchmark]: RCFGBuilder took 1248.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:15,305 INFO L168 Benchmark]: BuchiAutomizer took 43307.59 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 1.0 GB in the beginning and 848.2 MB in the end (delta: 182.3 MB). Peak memory consumption was 430.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:15,307 INFO L168 Benchmark]: Witness Printer took 95.63 ms. Allocated memory is still 1.3 GB. Free memory was 848.2 MB in the beginning and 836.6 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:15,311 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.17 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 745.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -139.5 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1248.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 43307.59 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 1.0 GB in the beginning and 848.2 MB in the end (delta: 182.3 MB). Peak memory consumption was 430.0 MB. Max. memory is 11.5 GB. * Witness Printer took 95.63 ms. Allocated memory is still 1.3 GB. Free memory was 848.2 MB in the beginning and 836.6 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 483 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 43.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 41.6s. Construction of modules took 0.9s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 442 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 483 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 404 SDtfs, 684 SDslu, 647 SDs, 0 SdLazy, 136 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 657]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=6662} State at position 1 is {NULL=0, NULL=0, NULL=0, NULL=-2, retValue_acc=1, NULL=6662, NULL=0, NULL=0, NULL=-7, retValue_acc=0, NULL=0, NULL=0, NULL=-16, NULL=-22, methaneLevelCritical=0, NULL=-6, tmp=1, tmp___0=0, retValue_acc=0, tmp=0, NULL=-10, NULL=0, NULL=0, NULL=-1, tmp___1=0, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50c5a15e=0, NULL=-12, cleanupTimeShifts=4, switchedOnBeforeTS=0, NULL=-13, NULL=-19, NULL=-3, \result=0, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-11, \result=0, NULL=0, NULL=-17, NULL=0, NULL=0, NULL=-4, \result=1, NULL=-8, head=0, pumpRunning=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d7c4b8b=0, NULL=-18, \result=0, NULL=-21, NULL=-23, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19780827=0, NULL=0, NULL=0, tmp=1, \result=1, NULL=6661, NULL=0, tmp=1, retValue_acc=1, tmp___2=68, retValue_acc=1, tmp___0=0, splverifierCounter=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6305ec84=0, NULL=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@736f6958=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@36e16d4e=0, NULL=6660, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@927fe11=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@33c59702=68, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5702b6fa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@33e591c=0, head=0, NULL=0, NULL=-15, NULL=-14, NULL=-9, NULL=0, NULL=-20, retValue_acc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L98] int pumpRunning = 0; [L99] int systemActive = 1; [L447] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L716] int cleanupTimeShifts = 4; [L815] int switchedOnBeforeTS ; [L864] int waterLevel = 1; [L865] int methaneLevelCritical = 0; [L791] int retValue_acc ; [L792] int tmp ; [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); [L798] tmp = valid_product() [L800] COND TRUE \read(tmp) [L820] switchedOnBeforeTS = 0 [L648] int splverifierCounter ; [L649] int tmp ; [L650] int tmp___0 ; [L651] int tmp___1 ; [L652] int tmp___2 ; [L655] splverifierCounter = 0 Loop: [L657] COND TRUE 1 [L659] COND TRUE splverifierCounter < 4 [L665] tmp = __VERIFIER_nondet_int() [L667] COND FALSE !(\read(tmp)) [L675] tmp___0 = __VERIFIER_nondet_int() [L677] COND FALSE !(\read(tmp___0)) [L685] tmp___2 = __VERIFIER_nondet_int() [L687] COND TRUE \read(tmp___2) [L273] systemActive = 1 [L191] int retValue_acc ; [L194] retValue_acc = pumpRunning [L195] return (retValue_acc); [L829] switchedOnBeforeTS = isPumpRunning() [L110] COND FALSE !(\read(pumpRunning)) [L117] COND TRUE \read(systemActive) [L139] int tmp ; [L142] COND TRUE ! pumpRunning [L236] int retValue_acc ; [L237] int tmp ; [L238] int tmp___0 ; [L944] int retValue_acc ; [L947] COND TRUE waterLevel < 2 [L948] retValue_acc = 1 [L949] return (retValue_acc); [L242] tmp = isHighWaterSensorDry() [L244] COND TRUE \read(tmp) [L245] tmp___0 = 0 [L249] retValue_acc = tmp___0 [L250] return (retValue_acc); [L144] tmp = isHighWaterLevel() [L146] COND FALSE !(\read(tmp)) [L835] int tmp ; [L836] int tmp___0 ; [L935] int retValue_acc ; [L938] retValue_acc = waterLevel [L939] return (retValue_acc); [L840] tmp = getWaterLevel() [L842] COND TRUE tmp != 2 [L191] int retValue_acc ; [L194] retValue_acc = pumpRunning [L195] return (retValue_acc); [L844] tmp___0 = isPumpRunning() [L846] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...