./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product44_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_product44_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 a22c1e90e019171affadaeb315d0122780579e6b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:44,217 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:51:44,219 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:51:44,234 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:51:44,235 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:51:44,236 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:51:44,237 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:51:44,239 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:51:44,241 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:51:44,241 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:51:44,242 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:51:44,243 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:51:44,243 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:51:44,244 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:51:44,246 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:51:44,246 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:51:44,247 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:51:44,249 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:51:44,251 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:51:44,253 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:51:44,254 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:51:44,255 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:51:44,258 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:51:44,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:51:44,258 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:51:44,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:51:44,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:51:44,261 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:51:44,262 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:51:44,263 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:51:44,263 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:51:44,269 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:51:44,271 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:51:44,271 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:51:44,272 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:51:44,274 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:51:44,274 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:44,298 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:51:44,298 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:51:44,299 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:51:44,299 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:51:44,300 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:51:44,300 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:51:44,300 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:51:44,300 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:51:44,300 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:51:44,301 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:51:44,301 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:51:44,301 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:51:44,304 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:51:44,304 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:51:44,304 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:51:44,304 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:51:44,304 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:51:44,305 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:51:44,305 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:51:44,305 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:51:44,305 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:51:44,305 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:51:44,305 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:51:44,306 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:51:44,306 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:51:44,306 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:51:44,306 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:51:44,307 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:51:44,309 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:51:44,309 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:51:44,309 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:51:44,310 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:51:44,311 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 -> a22c1e90e019171affadaeb315d0122780579e6b [2019-01-01 23:51:44,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:51:44,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:51:44,404 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:51:44,406 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:51:44,407 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:51:44,408 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product44_true-unreach-call_false-termination.cil.c [2019-01-01 23:51:44,474 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aa4957ce/6f17796bd5fa4391a419d699a7c9d441/FLAG13dcc5b9d [2019-01-01 23:51:44,951 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:51:44,952 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product44_true-unreach-call_false-termination.cil.c [2019-01-01 23:51:44,965 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aa4957ce/6f17796bd5fa4391a419d699a7c9d441/FLAG13dcc5b9d [2019-01-01 23:51:45,245 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aa4957ce/6f17796bd5fa4391a419d699a7c9d441 [2019-01-01 23:51:45,250 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:51:45,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:51:45,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:51:45,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:51:45,257 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:51:45,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:51:45" (1/1) ... [2019-01-01 23:51:45,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47438819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:45, skipping insertion in model container [2019-01-01 23:51:45,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:51:45" (1/1) ... [2019-01-01 23:51:45,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:51:45,338 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:51:45,772 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:51:45,797 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:51:45,941 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:51:46,061 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:51:46,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:46 WrapperNode [2019-01-01 23:51:46,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:51:46,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:51:46,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:51:46,063 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:51:46,074 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:46" (1/1) ... [2019-01-01 23:51:46,098 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:46" (1/1) ... [2019-01-01 23:51:46,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:51:46,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:51:46,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:51:46,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:51:46,161 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:46" (1/1) ... [2019-01-01 23:51:46,161 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:46" (1/1) ... [2019-01-01 23:51:46,175 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:46" (1/1) ... [2019-01-01 23:51:46,175 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:46" (1/1) ... [2019-01-01 23:51:46,198 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:46" (1/1) ... [2019-01-01 23:51:46,220 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:46" (1/1) ... [2019-01-01 23:51:46,226 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:46" (1/1) ... [2019-01-01 23:51:46,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:51:46,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:51:46,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:51:46,236 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:51:46,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:51:46,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:51:46,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:51:46,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:51:46,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:51:47,604 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:51:47,604 INFO L280 CfgBuilder]: Removed 134 assue(true) statements. [2019-01-01 23:51:47,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:51:47 BoogieIcfgContainer [2019-01-01 23:51:47,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:51:47,605 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:51:47,606 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:51:47,610 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:51:47,611 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:51:47,612 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:51:45" (1/3) ... [2019-01-01 23:51:47,614 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23a11da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:51:47, skipping insertion in model container [2019-01-01 23:51:47,614 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:51:47,614 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:46" (2/3) ... [2019-01-01 23:51:47,615 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23a11da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:51:47, skipping insertion in model container [2019-01-01 23:51:47,615 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:51:47,615 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:51:47" (3/3) ... [2019-01-01 23:51:47,618 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product44_true-unreach-call_false-termination.cil.c [2019-01-01 23:51:47,677 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:51:47,678 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:51:47,678 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:51:47,678 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:51:47,679 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:51:47,679 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:51:47,679 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:51:47,680 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:51:47,680 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:51:47,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states. [2019-01-01 23:51:47,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2019-01-01 23:51:47,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:47,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:47,738 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:47,738 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:47,738 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:51:47,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states. [2019-01-01 23:51:47,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2019-01-01 23:51:47,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:47,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:47,748 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:47,749 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:47,756 INFO L794 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~head~0.base, ~head~0.offset := 0, 0;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(21);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(21);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(30);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(9);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(13);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string51.base, #t~string51.offset, 1);call write~init~int(110, #t~string51.base, 1 + #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 2 + #t~string51.offset, 1);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string53.base, #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 2 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 3 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string55.base, #t~string55.offset, 1);call write~init~int(80, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(117, #t~string55.base, 2 + #t~string55.offset, 1);call write~init~int(109, #t~string55.base, 3 + #t~string55.offset, 1);call write~init~int(112, #t~string55.base, 4 + #t~string55.offset, 1);call write~init~int(58, #t~string55.base, 5 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 6 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string57.base, #t~string57.offset, 1);call write~init~int(110, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 2 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(102, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(102, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 3 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string61.base, #t~string61.offset, 1);call write~init~int(32, #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(2);call write~init~int(10, #t~string63.base, #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 1 + #t~string63.offset, 1);~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0; 17#L-1true havoc main_#res;havoc main_#t~ret70, main_~retValue_acc~11, main_~tmp~7;havoc main_~retValue_acc~11;havoc main_~tmp~7; 89#L807true havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 32#L815true main_#t~ret70 := valid_product_#res;main_~tmp~7 := main_#t~ret70;havoc main_#t~ret70; 46#L904true assume 0 != main_~tmp~7; 73#L879true ~switchedOnBeforeTS~0 := 0; 54#L933true havoc test_#t~nondet65, test_#t~nondet66, test_#t~nondet67, test_#t~nondet68, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 3#L954-1true [2019-01-01 23:51:47,760 INFO L796 eck$LassoCheckResult]: Loop: 3#L954-1true assume !false; 18#L724true assume test_~splverifierCounter~0 < 4; 65#L725true test_~tmp~6 := test_#t~nondet65;havoc test_#t~nondet65; 67#L733true assume !(0 != test_~tmp~6); 68#L733-1true test_~tmp___0~1 := test_#t~nondet66;havoc test_#t~nondet66; 50#L743true assume !(0 != test_~tmp___0~1); 52#L743-1true test_~tmp___2~0 := test_#t~nondet67;havoc test_#t~nondet67; 26#L753true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 36#L761-1true havoc __utac_acc__Specification5_spec__2_#t~ret71;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~7;havoc isPumpRunning_~retValue_acc~7;isPumpRunning_~retValue_acc~7 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~7; 40#L629true __utac_acc__Specification5_spec__2_#t~ret71 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret71;havoc __utac_acc__Specification5_spec__2_#t~ret71; 33#L943true assume !(0 != ~pumpRunning~0); 5#L526true assume !(0 != ~systemActive~0); 15#L533true havoc __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_~tmp~8, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~8;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 58#L122true __utac_acc__Specification5_spec__3_#t~ret72 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~8 := __utac_acc__Specification5_spec__3_#t~ret72;havoc __utac_acc__Specification5_spec__3_#t~ret72; 30#L954true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~8); 3#L954-1true [2019-01-01 23:51:47,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:47,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-01 23:51:47,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:47,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:47,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:47,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:47,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:48,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:48,589 INFO L82 PathProgramCache]: Analyzing trace with hash 675626230, now seen corresponding path program 1 times [2019-01-01 23:51:48,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:48,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:48,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:48,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:48,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:51:48,703 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:48,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:51:48,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:51:48,712 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:51:48,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:51:48,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:51:48,737 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 3 states. [2019-01-01 23:51:48,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:51:48,989 INFO L93 Difference]: Finished difference Result 183 states and 257 transitions. [2019-01-01 23:51:48,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:51:48,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 257 transitions. [2019-01-01 23:51:49,010 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 118 [2019-01-01 23:51:49,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 169 states and 242 transitions. [2019-01-01 23:51:49,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2019-01-01 23:51:49,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2019-01-01 23:51:49,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 242 transitions. [2019-01-01 23:51:49,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:51:49,030 INFO L705 BuchiCegarLoop]: Abstraction has 169 states and 242 transitions. [2019-01-01 23:51:49,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 242 transitions. [2019-01-01 23:51:49,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2019-01-01 23:51:49,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-01 23:51:49,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 239 transitions. [2019-01-01 23:51:49,085 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 239 transitions. [2019-01-01 23:51:49,085 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 239 transitions. [2019-01-01 23:51:49,085 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:51:49,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 239 transitions. [2019-01-01 23:51:49,090 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 116 [2019-01-01 23:51:49,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:49,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:49,091 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:49,091 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:49,092 INFO L794 eck$LassoCheckResult]: Stem: 347#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~head~0.base, ~head~0.offset := 0, 0;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(21);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(21);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(30);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(9);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(13);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string51.base, #t~string51.offset, 1);call write~init~int(110, #t~string51.base, 1 + #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 2 + #t~string51.offset, 1);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string53.base, #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 2 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 3 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string55.base, #t~string55.offset, 1);call write~init~int(80, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(117, #t~string55.base, 2 + #t~string55.offset, 1);call write~init~int(109, #t~string55.base, 3 + #t~string55.offset, 1);call write~init~int(112, #t~string55.base, 4 + #t~string55.offset, 1);call write~init~int(58, #t~string55.base, 5 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 6 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string57.base, #t~string57.offset, 1);call write~init~int(110, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 2 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(102, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(102, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 3 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string61.base, #t~string61.offset, 1);call write~init~int(32, #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(2);call write~init~int(10, #t~string63.base, #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 1 + #t~string63.offset, 1);~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0; 314#L-1 havoc main_#res;havoc main_#t~ret70, main_~retValue_acc~11, main_~tmp~7;havoc main_~retValue_acc~11;havoc main_~tmp~7; 315#L807 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 333#L815 main_#t~ret70 := valid_product_#res;main_~tmp~7 := main_#t~ret70;havoc main_#t~ret70; 334#L904 assume 0 != main_~tmp~7; 349#L879 ~switchedOnBeforeTS~0 := 0; 354#L933 havoc test_#t~nondet65, test_#t~nondet66, test_#t~nondet67, test_#t~nondet68, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 287#L954-1 [2019-01-01 23:51:49,093 INFO L796 eck$LassoCheckResult]: Loop: 287#L954-1 assume !false; 288#L724 assume test_~splverifierCounter~0 < 4; 316#L725 test_~tmp~6 := test_#t~nondet65;havoc test_#t~nondet65; 359#L733 assume !(0 != test_~tmp~6); 323#L733-1 test_~tmp___0~1 := test_#t~nondet66;havoc test_#t~nondet66; 351#L743 assume !(0 != test_~tmp___0~1); 353#L743-1 test_~tmp___2~0 := test_#t~nondet67;havoc test_#t~nondet67; 327#L753 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 329#L761-1 havoc __utac_acc__Specification5_spec__2_#t~ret71;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~7;havoc isPumpRunning_~retValue_acc~7;isPumpRunning_~retValue_acc~7 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~7; 338#L629 __utac_acc__Specification5_spec__2_#t~ret71 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret71;havoc __utac_acc__Specification5_spec__2_#t~ret71; 335#L943 assume !(0 != ~pumpRunning~0); 294#L526 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret45, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 295#L558 assume !(0 == ~pumpRunning~0); 312#L533 havoc __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_~tmp~8, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~8;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 313#L122 __utac_acc__Specification5_spec__3_#t~ret72 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~8 := __utac_acc__Specification5_spec__3_#t~ret72;havoc __utac_acc__Specification5_spec__3_#t~ret72; 332#L954 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~8); 287#L954-1 [2019-01-01 23:51:49,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:49,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-01 23:51:49,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:49,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:49,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:49,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:49,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:49,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:49,481 INFO L82 PathProgramCache]: Analyzing trace with hash -572192765, now seen corresponding path program 1 times [2019-01-01 23:51:49,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:49,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:49,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:49,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:51:49,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:51:49,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:49,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:51:49,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:51:49,556 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:51:49,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:51:49,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:51:49,557 INFO L87 Difference]: Start difference. First operand 167 states and 239 transitions. cyclomatic complexity: 75 Second operand 3 states. [2019-01-01 23:51:49,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:51:49,847 INFO L93 Difference]: Finished difference Result 266 states and 367 transitions. [2019-01-01 23:51:49,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:51:49,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 266 states and 367 transitions. [2019-01-01 23:51:49,857 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 191 [2019-01-01 23:51:49,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 266 states to 266 states and 367 transitions. [2019-01-01 23:51:49,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 266 [2019-01-01 23:51:49,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 266 [2019-01-01 23:51:49,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 266 states and 367 transitions. [2019-01-01 23:51:49,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:51:49,874 INFO L705 BuchiCegarLoop]: Abstraction has 266 states and 367 transitions. [2019-01-01 23:51:49,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states and 367 transitions. [2019-01-01 23:51:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-01-01 23:51:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-01 23:51:49,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 367 transitions. [2019-01-01 23:51:49,904 INFO L728 BuchiCegarLoop]: Abstraction has 266 states and 367 transitions. [2019-01-01 23:51:49,904 INFO L608 BuchiCegarLoop]: Abstraction has 266 states and 367 transitions. [2019-01-01 23:51:49,905 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:51:49,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 367 transitions. [2019-01-01 23:51:49,909 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 191 [2019-01-01 23:51:49,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:49,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:49,912 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:49,913 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:49,913 INFO L794 eck$LassoCheckResult]: Stem: 789#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~head~0.base, ~head~0.offset := 0, 0;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(21);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(21);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(30);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(9);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(13);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string51.base, #t~string51.offset, 1);call write~init~int(110, #t~string51.base, 1 + #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 2 + #t~string51.offset, 1);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string53.base, #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 2 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 3 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string55.base, #t~string55.offset, 1);call write~init~int(80, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(117, #t~string55.base, 2 + #t~string55.offset, 1);call write~init~int(109, #t~string55.base, 3 + #t~string55.offset, 1);call write~init~int(112, #t~string55.base, 4 + #t~string55.offset, 1);call write~init~int(58, #t~string55.base, 5 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 6 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string57.base, #t~string57.offset, 1);call write~init~int(110, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 2 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(102, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(102, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 3 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string61.base, #t~string61.offset, 1);call write~init~int(32, #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(2);call write~init~int(10, #t~string63.base, #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 1 + #t~string63.offset, 1);~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0; 758#L-1 havoc main_#res;havoc main_#t~ret70, main_~retValue_acc~11, main_~tmp~7;havoc main_~retValue_acc~11;havoc main_~tmp~7; 759#L807 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 774#L815 main_#t~ret70 := valid_product_#res;main_~tmp~7 := main_#t~ret70;havoc main_#t~ret70; 775#L904 assume 0 != main_~tmp~7; 791#L879 ~switchedOnBeforeTS~0 := 0; 797#L933 havoc test_#t~nondet65, test_#t~nondet66, test_#t~nondet67, test_#t~nondet68, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 798#L954-1 [2019-01-01 23:51:49,914 INFO L796 eck$LassoCheckResult]: Loop: 798#L954-1 assume !false; 969#L724 assume test_~splverifierCounter~0 < 4; 970#L725 test_~tmp~6 := test_#t~nondet65;havoc test_#t~nondet65; 991#L733 assume !(0 != test_~tmp~6); 976#L733-1 test_~tmp___0~1 := test_#t~nondet66;havoc test_#t~nondet66; 932#L743 assume !(0 != test_~tmp___0~1); 929#L743-1 test_~tmp___2~0 := test_#t~nondet67;havoc test_#t~nondet67; 924#L753 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 769#L761-1 havoc __utac_acc__Specification5_spec__2_#t~ret71;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~7;havoc isPumpRunning_~retValue_acc~7;isPumpRunning_~retValue_acc~7 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~7; 778#L629 __utac_acc__Specification5_spec__2_#t~ret71 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret71;havoc __utac_acc__Specification5_spec__2_#t~ret71; 773#L943 assume !(0 != ~pumpRunning~0); 732#L526 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret45, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 733#L558 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret64, isHighWaterLevel_~retValue_acc~8, isHighWaterLevel_~tmp~5, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~8;havoc isHighWaterLevel_~tmp~5;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 815#L130 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 745#L135 isHighWaterLevel_#t~ret64 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~5 := isHighWaterLevel_#t~ret64;havoc isHighWaterLevel_#t~ret64; 746#L678 assume 0 != isHighWaterLevel_~tmp~5;isHighWaterLevel_~tmp___0~0 := 0; 799#L678-2 isHighWaterLevel_~retValue_acc~8 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~8; 800#L684 processEnvironment_#t~ret45 := isHighWaterLevel_#res;processEnvironment_~tmp~3 := processEnvironment_#t~ret45;havoc processEnvironment_#t~ret45; 911#L562 assume !(0 != processEnvironment_~tmp~3); 828#L533 havoc __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_~tmp~8, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~8;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 975#L122 __utac_acc__Specification5_spec__3_#t~ret72 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~8 := __utac_acc__Specification5_spec__3_#t~ret72;havoc __utac_acc__Specification5_spec__3_#t~ret72; 973#L954 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~8); 798#L954-1 [2019-01-01 23:51:49,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:49,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-01 23:51:49,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:49,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:49,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:49,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:49,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:50,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:50,286 INFO L82 PathProgramCache]: Analyzing trace with hash -535080689, now seen corresponding path program 1 times [2019-01-01 23:51:50,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:50,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:50,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:50,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:51:50,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:51:50,503 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2019-01-01 23:51:50,682 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:50,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:51:50,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:51:50,683 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:51:50,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:51:50,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:51:50,685 INFO L87 Difference]: Start difference. First operand 266 states and 367 transitions. cyclomatic complexity: 104 Second operand 5 states. [2019-01-01 23:51:51,308 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:51:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:51:52,258 INFO L93 Difference]: Finished difference Result 1031 states and 1427 transitions. [2019-01-01 23:51:52,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 23:51:52,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1031 states and 1427 transitions. [2019-01-01 23:51:52,269 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 734 [2019-01-01 23:51:52,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1031 states to 1031 states and 1427 transitions. [2019-01-01 23:51:52,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1031 [2019-01-01 23:51:52,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1031 [2019-01-01 23:51:52,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1031 states and 1427 transitions. [2019-01-01 23:51:52,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:51:52,286 INFO L705 BuchiCegarLoop]: Abstraction has 1031 states and 1427 transitions. [2019-01-01 23:51:52,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states and 1427 transitions. [2019-01-01 23:51:52,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 519. [2019-01-01 23:51:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-01-01 23:51:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 703 transitions. [2019-01-01 23:51:52,313 INFO L728 BuchiCegarLoop]: Abstraction has 519 states and 703 transitions. [2019-01-01 23:51:52,313 INFO L608 BuchiCegarLoop]: Abstraction has 519 states and 703 transitions. [2019-01-01 23:51:52,313 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:51:52,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 519 states and 703 transitions. [2019-01-01 23:51:52,317 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 378 [2019-01-01 23:51:52,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:52,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:52,319 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:52,319 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:52,319 INFO L794 eck$LassoCheckResult]: Stem: 2109#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~head~0.base, ~head~0.offset := 0, 0;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(21);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(21);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(30);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(9);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(13);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string51.base, #t~string51.offset, 1);call write~init~int(110, #t~string51.base, 1 + #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 2 + #t~string51.offset, 1);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string53.base, #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 2 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 3 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string55.base, #t~string55.offset, 1);call write~init~int(80, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(117, #t~string55.base, 2 + #t~string55.offset, 1);call write~init~int(109, #t~string55.base, 3 + #t~string55.offset, 1);call write~init~int(112, #t~string55.base, 4 + #t~string55.offset, 1);call write~init~int(58, #t~string55.base, 5 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 6 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string57.base, #t~string57.offset, 1);call write~init~int(110, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 2 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(102, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(102, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 3 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string61.base, #t~string61.offset, 1);call write~init~int(32, #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(2);call write~init~int(10, #t~string63.base, #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 1 + #t~string63.offset, 1);~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0; 2069#L-1 havoc main_#res;havoc main_#t~ret70, main_~retValue_acc~11, main_~tmp~7;havoc main_~retValue_acc~11;havoc main_~tmp~7; 2070#L807 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 2095#L815 main_#t~ret70 := valid_product_#res;main_~tmp~7 := main_#t~ret70;havoc main_#t~ret70; 2096#L904 assume 0 != main_~tmp~7; 2110#L879 ~switchedOnBeforeTS~0 := 0; 2115#L933 havoc test_#t~nondet65, test_#t~nondet66, test_#t~nondet67, test_#t~nondet68, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 2116#L954-1 [2019-01-01 23:51:52,319 INFO L796 eck$LassoCheckResult]: Loop: 2116#L954-1 assume !false; 2334#L724 assume test_~splverifierCounter~0 < 4; 2333#L725 test_~tmp~6 := test_#t~nondet65;havoc test_#t~nondet65; 2332#L733 assume !(0 != test_~tmp~6); 2330#L733-1 test_~tmp___0~1 := test_#t~nondet66;havoc test_#t~nondet66; 2329#L743 assume !(0 != test_~tmp___0~1); 2327#L743-1 test_~tmp___2~0 := test_#t~nondet67;havoc test_#t~nondet67; 2326#L753 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 2321#L761-1 havoc __utac_acc__Specification5_spec__2_#t~ret71;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~7;havoc isPumpRunning_~retValue_acc~7;isPumpRunning_~retValue_acc~7 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~7; 2320#L629 __utac_acc__Specification5_spec__2_#t~ret71 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret71;havoc __utac_acc__Specification5_spec__2_#t~ret71; 2290#L943 assume !(0 != ~pumpRunning~0); 2288#L526 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret45, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 2287#L558 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret64, isHighWaterLevel_~retValue_acc~8, isHighWaterLevel_~tmp~5, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~8;havoc isHighWaterLevel_~tmp~5;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 2228#L130 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 2284#L135 isHighWaterLevel_#t~ret64 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~5 := isHighWaterLevel_#t~ret64;havoc isHighWaterLevel_#t~ret64; 2282#L678 assume 0 != isHighWaterLevel_~tmp~5;isHighWaterLevel_~tmp___0~0 := 0; 2280#L678-2 isHighWaterLevel_~retValue_acc~8 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~8; 2279#L684 processEnvironment_#t~ret45 := isHighWaterLevel_#res;processEnvironment_~tmp~3 := processEnvironment_#t~ret45;havoc processEnvironment_#t~ret45; 2278#L562 assume !(0 != processEnvironment_~tmp~3); 2225#L533 havoc __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_~tmp~8, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~8;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 2340#L122 __utac_acc__Specification5_spec__3_#t~ret72 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~8 := __utac_acc__Specification5_spec__3_#t~ret72;havoc __utac_acc__Specification5_spec__3_#t~ret72; 2339#L954 assume 2 != __utac_acc__Specification5_spec__3_~tmp~8;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~7;havoc isPumpRunning_~retValue_acc~7;isPumpRunning_~retValue_acc~7 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~7; 2338#L629-1 __utac_acc__Specification5_spec__3_#t~ret73 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~2 := __utac_acc__Specification5_spec__3_#t~ret73;havoc __utac_acc__Specification5_spec__3_#t~ret73; 2337#L958 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~2); 2116#L954-1 [2019-01-01 23:51:52,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:52,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2019-01-01 23:51:52,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:52,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:52,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:52,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:52,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:52,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:52,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1183520074, now seen corresponding path program 1 times [2019-01-01 23:51:52,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:52,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:52,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:52,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:51:52,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:52,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:52,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1042926736, now seen corresponding path program 1 times [2019-01-01 23:51:52,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:52,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:52,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:52,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:52,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:54,173 WARN L181 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-01-01 23:51:54,392 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 23:52:22,740 WARN L181 SmtUtils]: Spent 28.33 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-01 23:52:37,720 WARN L181 SmtUtils]: Spent 14.97 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-01 23:52:37,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:52:37 BoogieIcfgContainer [2019-01-01 23:52:37,810 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:52:37,810 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:52:37,810 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:52:37,813 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:52:37,813 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:47" (3/4) ... [2019-01-01 23:52:37,819 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:52:37,946 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:52:37,946 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:52:37,947 INFO L168 Benchmark]: Toolchain (without parser) took 52696.83 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.7 MB). Free memory was 951.4 MB in the beginning and 1.3 GB in the end (delta: -353.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:52:37,954 INFO L168 Benchmark]: CDTParser took 0.21 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:37,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:37,958 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.04 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:37,960 INFO L168 Benchmark]: Boogie Preprocessor took 85.61 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:37,960 INFO L168 Benchmark]: RCFGBuilder took 1369.73 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: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:37,961 INFO L168 Benchmark]: BuchiAutomizer took 50204.58 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 210.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -258.4 MB). Peak memory consumption was 426.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:37,961 INFO L168 Benchmark]: Witness Printer took 135.80 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-01 23:52:37,970 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.21 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 809.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.04 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.61 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 1369.73 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: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 50204.58 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 210.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -258.4 MB). Peak memory consumption was 426.0 MB. Max. memory is 11.5 GB. * Witness Printer took 135.80 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 519 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 50.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 47.6s. Construction of modules took 1.4s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 514 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 519 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 433 SDtfs, 789 SDslu, 723 SDs, 0 SdLazy, 136 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s 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: 723]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=17191} State at position 1 is {NULL=0, NULL=-16, NULL=-3, NULL=0, NULL=17191, NULL=0, NULL=0, NULL=-10, NULL=0, NULL=-6, NULL=-17, NULL=0, methaneLevelCritical=0, NULL=-15, retValue_acc=1, tmp=1, tmp___0=0, NULL=-19, NULL=-8, tmp=0, retValue_acc=0, tmp___1=0, NULL=-12, NULL=-2, NULL=-18, cleanupTimeShifts=4, switchedOnBeforeTS=0, NULL=-14, NULL=-11, \result=0, NULL=-22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5cbe4654=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d73e9f1=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d2b25c9=0, NULL=0, NULL=0, NULL=0, NULL=0, \result=0, NULL=0, NULL=0, retValue_acc=0, NULL=0, \result=1, retValue_acc=1, head=0, pumpRunning=0, tmp___0=0, NULL=-20, NULL=-4, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@159ea73c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@256780b1=0, retValue_acc=1, tmp=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7ffed1ed=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@33f2da8d=63, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3829462c=0, \result=1, NULL=-23, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a2a8969=0, NULL=7831, tmp___2=63, tmp=1, NULL=-13, tmp___0=0, splverifierCounter=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-9, NULL=-21, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37e65704=0, head=0, NULL=0, NULL=-5, NULL=0, NULL=0, NULL=17190, NULL=0, NULL=-1, retValue_acc=0, NULL=-7} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L310] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L514] int pumpRunning = 0; [L515] int systemActive = 1; [L820] int cleanupTimeShifts = 4; [L927] int switchedOnBeforeTS ; [L895] int retValue_acc ; [L896] int tmp ; [L811] int retValue_acc ; [L814] retValue_acc = 1 [L815] return (retValue_acc); [L902] tmp = valid_product() [L904] COND TRUE \read(tmp) [L932] switchedOnBeforeTS = 0 [L714] int splverifierCounter ; [L715] int tmp ; [L716] int tmp___0 ; [L717] int tmp___1 ; [L718] int tmp___2 ; [L721] splverifierCounter = 0 Loop: [L723] COND TRUE 1 [L725] COND TRUE splverifierCounter < 4 [L731] tmp = __VERIFIER_nondet_int() [L733] COND FALSE !(\read(tmp)) [L741] tmp___0 = __VERIFIER_nondet_int() [L743] COND FALSE !(\read(tmp___0)) [L751] tmp___2 = __VERIFIER_nondet_int() [L753] COND TRUE \read(tmp___2) [L707] systemActive = 1 [L625] int retValue_acc ; [L628] retValue_acc = pumpRunning [L629] return (retValue_acc); [L941] switchedOnBeforeTS = isPumpRunning() [L526] COND FALSE !(\read(pumpRunning)) [L533] COND TRUE \read(systemActive) [L555] int tmp ; [L558] COND TRUE ! pumpRunning [L670] int retValue_acc ; [L671] int tmp ; [L672] int tmp___0 ; [L127] int retValue_acc ; [L130] COND TRUE waterLevel < 2 [L131] retValue_acc = 1 [L132] return (retValue_acc); [L676] tmp = isHighWaterSensorDry() [L678] COND TRUE \read(tmp) [L679] tmp___0 = 0 [L683] retValue_acc = tmp___0 [L684] return (retValue_acc); [L560] tmp = isHighWaterLevel() [L562] COND FALSE !(\read(tmp)) [L947] int tmp ; [L948] int tmp___0 ; [L118] int retValue_acc ; [L121] retValue_acc = waterLevel [L122] return (retValue_acc); [L952] tmp = getWaterLevel() [L954] COND TRUE tmp != 2 [L625] int retValue_acc ; [L628] retValue_acc = pumpRunning [L629] return (retValue_acc); [L956] tmp___0 = isPumpRunning() [L958] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...