./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product34_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_product34_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 ae55322c9e2147e3768d03287d4758f350a7d088 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:20,138 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:51:20,140 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:51:20,156 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:51:20,156 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:51:20,157 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:51:20,160 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:51:20,162 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:51:20,165 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:51:20,171 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:51:20,172 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:51:20,173 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:51:20,177 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:51:20,178 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:51:20,179 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:51:20,180 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:51:20,181 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:51:20,183 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:51:20,185 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:51:20,186 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:51:20,188 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:51:20,189 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:51:20,191 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:51:20,192 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:51:20,192 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:51:20,193 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:51:20,194 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:51:20,194 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:51:20,196 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:51:20,197 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:51:20,197 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:51:20,198 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:51:20,198 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:51:20,198 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:51:20,199 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:51:20,200 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:51:20,201 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:20,220 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:51:20,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:51:20,221 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:51:20,221 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:51:20,221 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:51:20,222 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:51:20,222 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:51:20,223 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:51:20,223 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:51:20,223 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:51:20,223 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:51:20,223 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:51:20,223 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:51:20,224 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:51:20,224 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:51:20,225 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:51:20,225 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:51:20,225 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:51:20,225 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:51:20,226 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:51:20,226 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:51:20,226 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:51:20,226 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:51:20,226 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:51:20,226 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:51:20,227 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:51:20,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:51:20,227 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:51:20,227 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:51:20,227 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:51:20,228 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:51:20,230 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:51:20,230 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 -> ae55322c9e2147e3768d03287d4758f350a7d088 [2019-01-01 23:51:20,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:51:20,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:51:20,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:51:20,312 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:51:20,312 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:51:20,313 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product34_true-unreach-call_false-termination.cil.c [2019-01-01 23:51:20,378 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/670b09e6f/9973f02c9eb44ddda4746c31ab066840/FLAG387947f86 [2019-01-01 23:51:20,924 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:51:20,925 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product34_true-unreach-call_false-termination.cil.c [2019-01-01 23:51:20,937 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/670b09e6f/9973f02c9eb44ddda4746c31ab066840/FLAG387947f86 [2019-01-01 23:51:21,167 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/670b09e6f/9973f02c9eb44ddda4746c31ab066840 [2019-01-01 23:51:21,173 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:51:21,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:51:21,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:51:21,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:51:21,180 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:51:21,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:51:21" (1/1) ... [2019-01-01 23:51:21,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@457b6fbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:21, skipping insertion in model container [2019-01-01 23:51:21,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:51:21" (1/1) ... [2019-01-01 23:51:21,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:51:21,254 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:51:21,692 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:51:21,708 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:51:21,825 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:51:21,942 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:51:21,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:21 WrapperNode [2019-01-01 23:51:21,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:51:21,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:51:21,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:51:21,945 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:51:21,955 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:21" (1/1) ... [2019-01-01 23:51:21,976 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:21" (1/1) ... [2019-01-01 23:51:22,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:51:22,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:51:22,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:51:22,025 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:51:22,036 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:21" (1/1) ... [2019-01-01 23:51:22,036 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:21" (1/1) ... [2019-01-01 23:51:22,045 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:21" (1/1) ... [2019-01-01 23:51:22,049 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:21" (1/1) ... [2019-01-01 23:51:22,069 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:21" (1/1) ... [2019-01-01 23:51:22,082 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:21" (1/1) ... [2019-01-01 23:51:22,085 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:21" (1/1) ... [2019-01-01 23:51:22,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:51:22,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:51:22,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:51:22,091 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:51:22,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:21" (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:22,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:51:22,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:51:22,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:51:22,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:51:23,375 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:51:23,375 INFO L280 CfgBuilder]: Removed 112 assue(true) statements. [2019-01-01 23:51:23,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:51:23 BoogieIcfgContainer [2019-01-01 23:51:23,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:51:23,377 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:51:23,377 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:51:23,381 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:51:23,382 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:51:23,382 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:51:21" (1/3) ... [2019-01-01 23:51:23,383 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32727f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:51:23, skipping insertion in model container [2019-01-01 23:51:23,383 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:51:23,383 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:21" (2/3) ... [2019-01-01 23:51:23,384 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32727f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:51:23, skipping insertion in model container [2019-01-01 23:51:23,384 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:51:23,384 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:51:23" (3/3) ... [2019-01-01 23:51:23,386 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product34_true-unreach-call_false-termination.cil.c [2019-01-01 23:51:23,445 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:51:23,446 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:51:23,446 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:51:23,446 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:51:23,446 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:51:23,446 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:51:23,447 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:51:23,447 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:51:23,447 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:51:23,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states. [2019-01-01 23:51:23,495 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-01-01 23:51:23,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:23,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:23,505 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:23,505 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:23,505 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:51:23,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states. [2019-01-01 23:51:23,513 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-01-01 23:51:23,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:23,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:23,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:23,515 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:23,521 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(30);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(9);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(21);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(25);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(13);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string39.base, #t~string39.offset, 1);call write~init~int(77, #t~string39.base, 1 + #t~string39.offset, 1);call write~init~int(101, #t~string39.base, 2 + #t~string39.offset, 1);call write~init~int(116, #t~string39.base, 3 + #t~string39.offset, 1);call write~init~int(104, #t~string39.base, 4 + #t~string39.offset, 1);call write~init~int(58, #t~string39.base, 5 + #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 6 + #t~string39.offset, 1);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string41.base, #t~string41.offset, 1);call write~init~int(82, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(73, #t~string41.base, 2 + #t~string41.offset, 1);call write~init~int(84, #t~string41.base, 3 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 4 + #t~string41.offset, 1);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string43.base, #t~string43.offset, 1);call write~init~int(75, #t~string43.base, 1 + #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 2 + #t~string43.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string45.base, #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 1 + #t~string45.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(13);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string55.base, #t~string55.offset, 1);call write~init~int(110, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 2 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string57.base, #t~string57.offset, 1);call write~init~int(102, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(102, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 3 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string59.base, #t~string59.offset, 1);call write~init~int(80, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(117, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(109, #t~string59.base, 3 + #t~string59.offset, 1);call write~init~int(112, #t~string59.base, 4 + #t~string59.offset, 1);call write~init~int(58, #t~string59.base, 5 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 6 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(110, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 2 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string65.base, #t~string65.offset, 1);call write~init~int(32, #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(10, #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; 14#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; 17#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~ret72 := valid_product_#res;main_~tmp~7 := main_#t~ret72;havoc main_#t~ret72; 16#L925true assume 0 != main_~tmp~7; 69#L901true ~switchedOnBeforeTS~0 := 0; 82#L799true havoc test_#t~nondet46, test_#t~nondet47, test_#t~nondet48, test_#t~nondet49, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 32#L820-1true [2019-01-01 23:51:23,521 INFO L796 eck$LassoCheckResult]: Loop: 32#L820-1true assume !false; 47#L568true assume test_~splverifierCounter~0 < 4; 72#L569true test_~tmp~3 := test_#t~nondet46;havoc test_#t~nondet46; 9#L577true assume !(0 != test_~tmp~3); 10#L577-1true test_~tmp___0~0 := test_#t~nondet47;havoc test_#t~nondet47; 78#L587true assume !(0 != test_~tmp___0~0); 81#L587-1true test_~tmp___2~0 := test_#t~nondet48;havoc test_#t~nondet48; 58#L597true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 68#L605-2true havoc __utac_acc__Specification5_spec__2_#t~ret69;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~9;havoc isPumpRunning_~retValue_acc~9;isPumpRunning_~retValue_acc~9 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~9; 59#L725true __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; 30#L809true assume !(0 != ~pumpRunning~0); 24#L640true assume !(0 != ~systemActive~0); 18#L647true 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~6;havoc getWaterLevel_~retValue_acc~6;getWaterLevel_~retValue_acc~6 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~6; 51#L535true __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; 27#L820true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~6); 32#L820-1true [2019-01-01 23:51:23,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:23,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-01 23:51:23,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:23,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:23,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:23,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:23,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:24,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:24,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1011437965, now seen corresponding path program 1 times [2019-01-01 23:51:24,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:24,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:24,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:24,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:24,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:51:24,552 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:24,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:51:24,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:51:24,560 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:51:24,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:51:24,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:51:24,583 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 3 states. [2019-01-01 23:51:24,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:51:24,655 INFO L93 Difference]: Finished difference Result 84 states and 116 transitions. [2019-01-01 23:51:24,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:51:24,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 116 transitions. [2019-01-01 23:51:24,662 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-01-01 23:51:24,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 77 states and 108 transitions. [2019-01-01 23:51:24,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2019-01-01 23:51:24,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2019-01-01 23:51:24,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 108 transitions. [2019-01-01 23:51:24,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:51:24,673 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 108 transitions. [2019-01-01 23:51:24,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 108 transitions. [2019-01-01 23:51:24,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-01 23:51:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-01 23:51:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 108 transitions. [2019-01-01 23:51:24,709 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 108 transitions. [2019-01-01 23:51:24,710 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 108 transitions. [2019-01-01 23:51:24,710 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:51:24,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 108 transitions. [2019-01-01 23:51:24,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-01-01 23:51:24,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:24,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:24,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:24,713 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:24,714 INFO L794 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(30);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(9);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(21);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(25);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(13);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string39.base, #t~string39.offset, 1);call write~init~int(77, #t~string39.base, 1 + #t~string39.offset, 1);call write~init~int(101, #t~string39.base, 2 + #t~string39.offset, 1);call write~init~int(116, #t~string39.base, 3 + #t~string39.offset, 1);call write~init~int(104, #t~string39.base, 4 + #t~string39.offset, 1);call write~init~int(58, #t~string39.base, 5 + #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 6 + #t~string39.offset, 1);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string41.base, #t~string41.offset, 1);call write~init~int(82, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(73, #t~string41.base, 2 + #t~string41.offset, 1);call write~init~int(84, #t~string41.base, 3 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 4 + #t~string41.offset, 1);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string43.base, #t~string43.offset, 1);call write~init~int(75, #t~string43.base, 1 + #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 2 + #t~string43.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string45.base, #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 1 + #t~string45.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(13);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string55.base, #t~string55.offset, 1);call write~init~int(110, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 2 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string57.base, #t~string57.offset, 1);call write~init~int(102, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(102, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 3 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string59.base, #t~string59.offset, 1);call write~init~int(80, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(117, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(109, #t~string59.base, 3 + #t~string59.offset, 1);call write~init~int(112, #t~string59.base, 4 + #t~string59.offset, 1);call write~init~int(58, #t~string59.base, 5 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 6 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(110, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 2 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string65.base, #t~string65.offset, 1);call write~init~int(32, #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(10, #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; 199#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; 200#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; 195#L73 main_#t~ret72 := valid_product_#res;main_~tmp~7 := main_#t~ret72;havoc main_#t~ret72; 196#L925 assume 0 != main_~tmp~7; 203#L901 ~switchedOnBeforeTS~0 := 0; 251#L799 havoc test_#t~nondet46, test_#t~nondet47, test_#t~nondet48, test_#t~nondet49, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 213#L820-1 [2019-01-01 23:51:24,714 INFO L796 eck$LassoCheckResult]: Loop: 213#L820-1 assume !false; 223#L568 assume test_~splverifierCounter~0 < 4; 240#L569 test_~tmp~3 := test_#t~nondet46;havoc test_#t~nondet46; 189#L577 assume !(0 != test_~tmp~3); 191#L577-1 test_~tmp___0~0 := test_#t~nondet47;havoc test_#t~nondet47; 194#L587 assume !(0 != test_~tmp___0~0); 209#L587-1 test_~tmp___2~0 := test_#t~nondet48;havoc test_#t~nondet48; 244#L597 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 246#L605-2 havoc __utac_acc__Specification5_spec__2_#t~ret69;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~9;havoc isPumpRunning_~retValue_acc~9;isPumpRunning_~retValue_acc~9 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~9; 247#L725 __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; 218#L809 assume !(0 != ~pumpRunning~0); 207#L640 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret50, processEnvironment_~tmp~4;havoc processEnvironment_~tmp~4; 192#L672 assume !(0 == ~pumpRunning~0); 180#L647 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~6;havoc getWaterLevel_~retValue_acc~6;getWaterLevel_~retValue_acc~6 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~6; 204#L535 __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; 211#L820 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~6); 213#L820-1 [2019-01-01 23:51:24,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:24,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-01 23:51:24,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:24,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:24,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:24,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:24,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:25,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:25,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1258195139, now seen corresponding path program 1 times [2019-01-01 23:51:25,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:25,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:25,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:25,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:51:25,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:51:25,180 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:25,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:51:25,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:51:25,181 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:51:25,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:51:25,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:51:25,182 INFO L87 Difference]: Start difference. First operand 77 states and 108 transitions. cyclomatic complexity: 33 Second operand 3 states. [2019-01-01 23:51:25,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:51:25,574 INFO L93 Difference]: Finished difference Result 126 states and 170 transitions. [2019-01-01 23:51:25,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:51:25,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 170 transitions. [2019-01-01 23:51:25,579 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 88 [2019-01-01 23:51:25,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 170 transitions. [2019-01-01 23:51:25,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2019-01-01 23:51:25,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2019-01-01 23:51:25,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 170 transitions. [2019-01-01 23:51:25,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:51:25,583 INFO L705 BuchiCegarLoop]: Abstraction has 126 states and 170 transitions. [2019-01-01 23:51:25,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 170 transitions. [2019-01-01 23:51:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-01-01 23:51:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-01 23:51:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 170 transitions. [2019-01-01 23:51:25,592 INFO L728 BuchiCegarLoop]: Abstraction has 126 states and 170 transitions. [2019-01-01 23:51:25,592 INFO L608 BuchiCegarLoop]: Abstraction has 126 states and 170 transitions. [2019-01-01 23:51:25,592 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:51:25,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 170 transitions. [2019-01-01 23:51:25,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 88 [2019-01-01 23:51:25,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:25,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:25,596 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:25,597 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:25,597 INFO L794 eck$LassoCheckResult]: Stem: 431#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(30);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(9);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(21);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(25);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(13);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string39.base, #t~string39.offset, 1);call write~init~int(77, #t~string39.base, 1 + #t~string39.offset, 1);call write~init~int(101, #t~string39.base, 2 + #t~string39.offset, 1);call write~init~int(116, #t~string39.base, 3 + #t~string39.offset, 1);call write~init~int(104, #t~string39.base, 4 + #t~string39.offset, 1);call write~init~int(58, #t~string39.base, 5 + #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 6 + #t~string39.offset, 1);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string41.base, #t~string41.offset, 1);call write~init~int(82, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(73, #t~string41.base, 2 + #t~string41.offset, 1);call write~init~int(84, #t~string41.base, 3 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 4 + #t~string41.offset, 1);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string43.base, #t~string43.offset, 1);call write~init~int(75, #t~string43.base, 1 + #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 2 + #t~string43.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string45.base, #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 1 + #t~string45.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(13);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string55.base, #t~string55.offset, 1);call write~init~int(110, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 2 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string57.base, #t~string57.offset, 1);call write~init~int(102, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(102, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 3 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string59.base, #t~string59.offset, 1);call write~init~int(80, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(117, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(109, #t~string59.base, 3 + #t~string59.offset, 1);call write~init~int(112, #t~string59.base, 4 + #t~string59.offset, 1);call write~init~int(58, #t~string59.base, 5 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 6 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(110, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 2 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string65.base, #t~string65.offset, 1);call write~init~int(32, #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(10, #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; 411#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; 412#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; 407#L73 main_#t~ret72 := valid_product_#res;main_~tmp~7 := main_#t~ret72;havoc main_#t~ret72; 408#L925 assume 0 != main_~tmp~7; 415#L901 ~switchedOnBeforeTS~0 := 0; 467#L799 havoc test_#t~nondet46, test_#t~nondet47, test_#t~nondet48, test_#t~nondet49, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 425#L820-1 [2019-01-01 23:51:25,597 INFO L796 eck$LassoCheckResult]: Loop: 425#L820-1 assume !false; 432#L568 assume test_~splverifierCounter~0 < 4; 450#L569 test_~tmp~3 := test_#t~nondet46;havoc test_#t~nondet46; 511#L577 assume !(0 != test_~tmp~3); 509#L577-1 test_~tmp___0~0 := test_#t~nondet47;havoc test_#t~nondet47; 508#L587 assume !(0 != test_~tmp___0~0); 506#L587-1 test_~tmp___2~0 := test_#t~nondet48;havoc test_#t~nondet48; 505#L597 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 503#L605-2 havoc __utac_acc__Specification5_spec__2_#t~ret69;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~9;havoc isPumpRunning_~retValue_acc~9;isPumpRunning_~retValue_acc~9 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~9; 460#L725 __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; 430#L809 assume !(0 != ~pumpRunning~0); 419#L640 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret50, processEnvironment_~tmp~4;havoc processEnvironment_~tmp~4; 405#L672 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret68, isHighWaterLevel_~retValue_acc~10, isHighWaterLevel_~tmp~5, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~10;havoc isHighWaterLevel_~tmp~5;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~7;havoc isHighWaterSensorDry_~retValue_acc~7; 406#L543 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~7 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~7; 386#L548 isHighWaterLevel_#t~ret68 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~5 := isHighWaterLevel_#t~ret68;havoc isHighWaterLevel_#t~ret68; 387#L774 assume 0 != isHighWaterLevel_~tmp~5;isHighWaterLevel_~tmp___0~1 := 0; 470#L774-2 isHighWaterLevel_~retValue_acc~10 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~10; 452#L780 processEnvironment_#t~ret50 := isHighWaterLevel_#res;processEnvironment_~tmp~4 := processEnvironment_#t~ret50;havoc processEnvironment_#t~ret50; 388#L676 assume !(0 != processEnvironment_~tmp~4); 390#L647 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~6;havoc getWaterLevel_~retValue_acc~6;getWaterLevel_~retValue_acc~6 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~6; 416#L535 __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; 423#L820 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~6); 425#L820-1 [2019-01-01 23:51:25,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:25,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-01 23:51:25,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:25,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:25,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:25,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:25,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:25,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:25,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1417181585, now seen corresponding path program 1 times [2019-01-01 23:51:25,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:25,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:25,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:25,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:51:25,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:51:26,168 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2019-01-01 23:51:26,342 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:26,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:51:26,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:51:26,343 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:51:26,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:51:26,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:51:26,345 INFO L87 Difference]: Start difference. First operand 126 states and 170 transitions. cyclomatic complexity: 46 Second operand 5 states. [2019-01-01 23:51:27,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:51:27,245 INFO L93 Difference]: Finished difference Result 466 states and 633 transitions. [2019-01-01 23:51:27,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 23:51:27,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 466 states and 633 transitions. [2019-01-01 23:51:27,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 325 [2019-01-01 23:51:27,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 466 states to 466 states and 633 transitions. [2019-01-01 23:51:27,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 466 [2019-01-01 23:51:27,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 466 [2019-01-01 23:51:27,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 466 states and 633 transitions. [2019-01-01 23:51:27,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:51:27,271 INFO L705 BuchiCegarLoop]: Abstraction has 466 states and 633 transitions. [2019-01-01 23:51:27,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states and 633 transitions. [2019-01-01 23:51:27,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 242. [2019-01-01 23:51:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-01 23:51:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 321 transitions. [2019-01-01 23:51:27,311 INFO L728 BuchiCegarLoop]: Abstraction has 242 states and 321 transitions. [2019-01-01 23:51:27,311 INFO L608 BuchiCegarLoop]: Abstraction has 242 states and 321 transitions. [2019-01-01 23:51:27,311 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:51:27,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 242 states and 321 transitions. [2019-01-01 23:51:27,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 174 [2019-01-01 23:51:27,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:27,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:27,316 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:27,316 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:27,317 INFO L794 eck$LassoCheckResult]: Stem: 1043#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(30);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(9);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(21);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(25);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(13);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string39.base, #t~string39.offset, 1);call write~init~int(77, #t~string39.base, 1 + #t~string39.offset, 1);call write~init~int(101, #t~string39.base, 2 + #t~string39.offset, 1);call write~init~int(116, #t~string39.base, 3 + #t~string39.offset, 1);call write~init~int(104, #t~string39.base, 4 + #t~string39.offset, 1);call write~init~int(58, #t~string39.base, 5 + #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 6 + #t~string39.offset, 1);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string41.base, #t~string41.offset, 1);call write~init~int(82, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(73, #t~string41.base, 2 + #t~string41.offset, 1);call write~init~int(84, #t~string41.base, 3 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 4 + #t~string41.offset, 1);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string43.base, #t~string43.offset, 1);call write~init~int(75, #t~string43.base, 1 + #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 2 + #t~string43.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string45.base, #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 1 + #t~string45.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(13);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string55.base, #t~string55.offset, 1);call write~init~int(110, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 2 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string57.base, #t~string57.offset, 1);call write~init~int(102, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(102, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 3 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string59.base, #t~string59.offset, 1);call write~init~int(80, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(117, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(109, #t~string59.base, 3 + #t~string59.offset, 1);call write~init~int(112, #t~string59.base, 4 + #t~string59.offset, 1);call write~init~int(58, #t~string59.base, 5 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 6 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(110, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 2 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string65.base, #t~string65.offset, 1);call write~init~int(32, #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(10, #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; 1022#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; 1023#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; 1018#L73 main_#t~ret72 := valid_product_#res;main_~tmp~7 := main_#t~ret72;havoc main_#t~ret72; 1019#L925 assume 0 != main_~tmp~7; 1026#L901 ~switchedOnBeforeTS~0 := 0; 1087#L799 havoc test_#t~nondet46, test_#t~nondet47, test_#t~nondet48, test_#t~nondet49, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1044#L820-1 [2019-01-01 23:51:27,318 INFO L796 eck$LassoCheckResult]: Loop: 1044#L820-1 assume !false; 1045#L568 assume test_~splverifierCounter~0 < 4; 1063#L569 test_~tmp~3 := test_#t~nondet46;havoc test_#t~nondet46; 1218#L577 assume !(0 != test_~tmp~3); 1216#L577-1 test_~tmp___0~0 := test_#t~nondet47;havoc test_#t~nondet47; 1215#L587 assume !(0 != test_~tmp___0~0); 1213#L587-1 test_~tmp___2~0 := test_#t~nondet48;havoc test_#t~nondet48; 1212#L597 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 1210#L605-2 havoc __utac_acc__Specification5_spec__2_#t~ret69;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~9;havoc isPumpRunning_~retValue_acc~9;isPumpRunning_~retValue_acc~9 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~9; 1209#L725 __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; 1160#L809 assume !(0 != ~pumpRunning~0); 1152#L640 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret50, processEnvironment_~tmp~4;havoc processEnvironment_~tmp~4; 1151#L672 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret68, isHighWaterLevel_~retValue_acc~10, isHighWaterLevel_~tmp~5, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~10;havoc isHighWaterLevel_~tmp~5;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~7;havoc isHighWaterSensorDry_~retValue_acc~7; 1139#L543 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~7 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~7; 1097#L548 isHighWaterLevel_#t~ret68 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~5 := isHighWaterLevel_#t~ret68;havoc isHighWaterLevel_#t~ret68; 1148#L774 assume 0 != isHighWaterLevel_~tmp~5;isHighWaterLevel_~tmp___0~1 := 0; 1145#L774-2 isHighWaterLevel_~retValue_acc~10 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~10; 1143#L780 processEnvironment_#t~ret50 := isHighWaterLevel_#res;processEnvironment_~tmp~4 := processEnvironment_#t~ret50;havoc processEnvironment_#t~ret50; 1137#L676 assume !(0 != processEnvironment_~tmp~4); 1027#L647 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~6;havoc getWaterLevel_~retValue_acc~6;getWaterLevel_~retValue_acc~6 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~6; 1028#L535 __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; 1036#L820 assume 2 != __utac_acc__Specification5_spec__3_~tmp~6;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~9;havoc isPumpRunning_~retValue_acc~9;isPumpRunning_~retValue_acc~9 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~9; 1037#L725-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; 1038#L824 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~2); 1044#L820-1 [2019-01-01 23:51:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:27,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2019-01-01 23:51:27,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:27,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:27,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:27,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:27,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:27,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:27,608 INFO L82 PathProgramCache]: Analyzing trace with hash -406884310, now seen corresponding path program 1 times [2019-01-01 23:51:27,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:27,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:27,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:27,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:51:27,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:27,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:27,626 INFO L82 PathProgramCache]: Analyzing trace with hash -547477648, now seen corresponding path program 1 times [2019-01-01 23:51:27,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:27,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:27,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:27,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:27,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:29,069 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:29,195 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 23:52:00,158 WARN L181 SmtUtils]: Spent 30.95 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-01 23:52:15,176 WARN L181 SmtUtils]: Spent 15.01 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-01 23:52:15,270 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,271 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:52:15,272 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:52:15,272 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:52:15,272 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:52:15,273 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:23" (3/4) ... [2019-01-01 23:52:15,279 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:52:15,394 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:52:15,394 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:52:15,395 INFO L168 Benchmark]: Toolchain (without parser) took 54221.53 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.1 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -296.4 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:15,397 INFO L168 Benchmark]: CDTParser took 0.15 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,397 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:15,398 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:15,398 INFO L168 Benchmark]: Boogie Preprocessor took 66.14 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:52:15,400 INFO L168 Benchmark]: RCFGBuilder took 1285.72 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: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:15,401 INFO L168 Benchmark]: BuchiAutomizer took 51894.88 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 212.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -186.3 MB). Peak memory consumption was 424.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:15,401 INFO L168 Benchmark]: Witness Printer took 122.15 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:52:15,406 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.15 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 767.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.14 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 1285.72 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: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 51894.88 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 212.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -186.3 MB). Peak memory consumption was 424.0 MB. Max. memory is 11.5 GB. * Witness Printer took 122.15 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. 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 242 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 51.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 50.1s. Construction of modules took 1.0s. 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, 224 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 242 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 390 SDtfs, 646 SDslu, 495 SDs, 0 SdLazy, 126 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s 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: 567]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=3916} State at position 1 is {NULL=0, NULL=-15, NULL=0, NULL=3916, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@248e73c3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@541f8708=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@17f0425a=56, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25b2d67a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5551ff04=0, NULL=0, NULL=-17, NULL=0, methaneLevelCritical=0, NULL=-12, tmp=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a0f6c29=0, tmp___0=0, tmp=0, NULL=0, NULL=-11, NULL=-9, NULL=0, tmp___1=0, NULL=-14, NULL=-3, NULL=-23, NULL=-6, NULL=-10, cleanupTimeShifts=4, switchedOnBeforeTS=0, NULL=-8, NULL=942, \result=0, NULL=-4, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, NULL=0, \result=0, tmp___0=0, NULL=0, NULL=0, retValue_acc=0, NULL=0, \result=1, head=0, pumpRunning=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@280c8fe8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3914b64a=0, NULL=-13, \result=0, retValue_acc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ca3e164=0, NULL=-20, NULL=0, tmp=1, NULL=0, \result=1, NULL=-18, NULL=3915, NULL=-22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@467fa446=0, retValue_acc=0, retValue_acc=1, retValue_acc=1, tmp___2=56, tmp=1, NULL=-7, splverifierCounter=0, NULL=0, NULL=-16, head=0, tmp=0, NULL=0, NULL=-1, NULL=0, NULL=-21, NULL=0, NULL=-5, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-2, retValue_acc=0, NULL=-19} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L256] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L460] int waterLevel = 1; [L461] int methaneLevelCritical = 0; [L628] int pumpRunning = 0; [L629] int systemActive = 1; [L793] int switchedOnBeforeTS ; [L842] int cleanupTimeShifts = 4; [L916] int retValue_acc ; [L917] int tmp ; [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); [L923] tmp = valid_product() [L925] COND TRUE \read(tmp) [L798] switchedOnBeforeTS = 0 [L558] int splverifierCounter ; [L559] int tmp ; [L560] int tmp___0 ; [L561] int tmp___1 ; [L562] int tmp___2 ; [L565] splverifierCounter = 0 Loop: [L567] COND TRUE 1 [L569] COND TRUE splverifierCounter < 4 [L575] tmp = __VERIFIER_nondet_int() [L577] COND FALSE !(\read(tmp)) [L585] tmp___0 = __VERIFIER_nondet_int() [L587] COND FALSE !(\read(tmp___0)) [L595] tmp___2 = __VERIFIER_nondet_int() [L597] COND TRUE \read(tmp___2) [L788] systemActive = 1 [L721] int retValue_acc ; [L724] retValue_acc = pumpRunning [L725] return (retValue_acc); [L807] switchedOnBeforeTS = isPumpRunning() [L640] COND FALSE !(\read(pumpRunning)) [L647] COND TRUE \read(systemActive) [L669] int tmp ; [L672] COND TRUE ! pumpRunning [L766] int retValue_acc ; [L767] int tmp ; [L768] int tmp___0 ; [L540] int retValue_acc ; [L543] COND TRUE waterLevel < 2 [L544] retValue_acc = 1 [L545] return (retValue_acc); [L772] tmp = isHighWaterSensorDry() [L774] COND TRUE \read(tmp) [L775] tmp___0 = 0 [L779] retValue_acc = tmp___0 [L780] return (retValue_acc); [L674] tmp = isHighWaterLevel() [L676] COND FALSE !(\read(tmp)) [L813] int tmp ; [L814] int tmp___0 ; [L531] int retValue_acc ; [L534] retValue_acc = waterLevel [L535] return (retValue_acc); [L818] tmp = getWaterLevel() [L820] COND TRUE tmp != 2 [L721] int retValue_acc ; [L724] retValue_acc = pumpRunning [L725] return (retValue_acc); [L822] tmp___0 = isPumpRunning() [L824] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...