./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec3_product55_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec3_product55_false-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 07b1c242ee38ca5843c5ca9be19cecfe3ff6bd0c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:24:31,269 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:24:31,270 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:24:31,281 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:24:31,282 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:24:31,283 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:24:31,284 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:24:31,287 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:24:31,290 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:24:31,291 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:24:31,293 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:24:31,293 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:24:31,295 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:24:31,295 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:24:31,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:24:31,297 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:24:31,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:24:31,300 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:24:31,302 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:24:31,303 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:24:31,304 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:24:31,306 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:24:31,308 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:24:31,309 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:24:31,309 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:24:31,310 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:24:31,311 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:24:31,312 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:24:31,312 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:24:31,314 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:24:31,314 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:24:31,315 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:24:31,315 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:24:31,315 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:24:31,316 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:24:31,319 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:24:31,319 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:24:31,351 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:24:31,351 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:24:31,355 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:24:31,355 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:24:31,355 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:24:31,356 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:24:31,356 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:24:31,356 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:24:31,356 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:24:31,356 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:24:31,357 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:24:31,357 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:24:31,357 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:24:31,357 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:24:31,357 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:24:31,358 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:24:31,358 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:24:31,359 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:24:31,359 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:24:31,359 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:24:31,359 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:24:31,359 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:24:31,360 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:24:31,360 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:24:31,360 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:24:31,360 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:24:31,360 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:24:31,360 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:24:31,361 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:24:31,363 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:24:31,363 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:24:31,364 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:24:31,364 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 -> 07b1c242ee38ca5843c5ca9be19cecfe3ff6bd0c [2019-01-14 04:24:31,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:24:31,454 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:24:31,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:24:31,465 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:24:31,465 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:24:31,466 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec3_product55_false-unreach-call_false-termination.cil.c [2019-01-14 04:24:31,522 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cdddafc5/2674fe4c02e64164be622907093abda4/FLAG341727ce9 [2019-01-14 04:24:32,050 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:24:32,051 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec3_product55_false-unreach-call_false-termination.cil.c [2019-01-14 04:24:32,070 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cdddafc5/2674fe4c02e64164be622907093abda4/FLAG341727ce9 [2019-01-14 04:24:32,494 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cdddafc5/2674fe4c02e64164be622907093abda4 [2019-01-14 04:24:32,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:24:32,502 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:24:32,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:24:32,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:24:32,508 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:24:32,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:24:32" (1/1) ... [2019-01-14 04:24:32,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700d6f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:32, skipping insertion in model container [2019-01-14 04:24:32,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:24:32" (1/1) ... [2019-01-14 04:24:32,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:24:32,579 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:24:32,980 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:24:32,995 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:24:33,180 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:24:33,223 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:24:33,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:33 WrapperNode [2019-01-14 04:24:33,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:24:33,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:24:33,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:24:33,225 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:24:33,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:33" (1/1) ... [2019-01-14 04:24:33,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:33" (1/1) ... [2019-01-14 04:24:33,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:24:33,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:24:33,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:24:33,313 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:24:33,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:33" (1/1) ... [2019-01-14 04:24:33,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:33" (1/1) ... [2019-01-14 04:24:33,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:33" (1/1) ... [2019-01-14 04:24:33,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:33" (1/1) ... [2019-01-14 04:24:33,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:33" (1/1) ... [2019-01-14 04:24:33,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:33" (1/1) ... [2019-01-14 04:24:33,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:33" (1/1) ... [2019-01-14 04:24:33,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:24:33,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:24:33,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:24:33,372 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:24:33,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:24:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:24:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:24:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:24:33,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:24:35,194 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:24:35,194 INFO L286 CfgBuilder]: Removed 286 assue(true) statements. [2019-01-14 04:24:35,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:24:35 BoogieIcfgContainer [2019-01-14 04:24:35,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:24:35,197 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:24:35,197 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:24:35,200 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:24:35,201 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:24:35,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:24:32" (1/3) ... [2019-01-14 04:24:35,203 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d9d5ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:24:35, skipping insertion in model container [2019-01-14 04:24:35,203 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:24:35,203 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:33" (2/3) ... [2019-01-14 04:24:35,203 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d9d5ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:24:35, skipping insertion in model container [2019-01-14 04:24:35,204 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:24:35,204 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:24:35" (3/3) ... [2019-01-14 04:24:35,206 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product55_false-unreach-call_false-termination.cil.c [2019-01-14 04:24:35,264 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:24:35,265 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:24:35,265 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:24:35,265 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:24:35,265 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:24:35,266 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:24:35,266 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:24:35,266 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:24:35,266 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:24:35,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states. [2019-01-14 04:24:35,325 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 127 [2019-01-14 04:24:35,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:24:35,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:24:35,335 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:24:35,335 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:24:35,335 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:24:35,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states. [2019-01-14 04:24:35,347 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 127 [2019-01-14 04:24:35,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:24:35,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:24:35,349 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:24:35,349 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:24:35,355 INFO L794 eck$LassoCheckResult]: Stem: 53#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(21);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(21);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(30);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(9);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(25);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(30);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(9);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(13);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(110, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 3 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string58.base, #t~string58.offset, 1);call write~init~int(80, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(117, #t~string58.base, 2 + #t~string58.offset, 1);call write~init~int(109, #t~string58.base, 3 + #t~string58.offset, 1);call write~init~int(112, #t~string58.base, 4 + #t~string58.offset, 1);call write~init~int(58, #t~string58.base, 5 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 6 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string60.base, #t~string60.offset, 1);call write~init~int(110, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 2 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string62.base, #t~string62.offset, 1);call write~init~int(102, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(102, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 3 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string64.base, #t~string64.offset, 1);call write~init~int(32, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 2 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string66.base, #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 1 + #t~string66.offset, 1); 5#L-1true havoc main_#res;havoc main_#t~ret46, main_~retValue_acc~9, main_~tmp~3;havoc main_~retValue_acc~9;havoc main_~tmp~3; 6#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; 95#L73true main_#t~ret46 := valid_product_#res;main_~tmp~3 := main_#t~ret46;havoc main_#t~ret46; 65#L649true assume 0 != main_~tmp~3; 139#L625true havoc test_#t~nondet72, test_#t~nondet73, test_#t~nondet74, test_#t~nondet75, test_~splverifierCounter~0, test_~tmp~10, test_~tmp___0~3, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~10;havoc test_~tmp___0~3;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 91#L921-1true [2019-01-14 04:24:35,355 INFO L796 eck$LassoCheckResult]: Loop: 91#L921-1true assume !false; 9#L951true assume test_~splverifierCounter~0 < 4; 58#L952true test_~tmp~10 := test_#t~nondet72;havoc test_#t~nondet72; 194#L960true assume !(0 != test_~tmp~10); 195#L960-1true test_~tmp___0~3 := test_#t~nondet73;havoc test_#t~nondet73; 114#L970true assume !(0 != test_~tmp___0~3); 98#L970-1true test_~tmp___2~0 := test_#t~nondet74;havoc test_#t~nondet74; 46#L980true assume 0 != test_~tmp___2~0; 123#L986-1true assume !(0 != ~pumpRunning~0); 31#L675true assume !(0 != ~systemActive~0); 87#L682true havoc __utac_acc__Specification3_spec__1_#t~ret69, __utac_acc__Specification3_spec__1_#t~ret70, __utac_acc__Specification3_spec__1_#t~ret71, __utac_acc__Specification3_spec__1_~tmp~9, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~9;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 183#L129-1true __utac_acc__Specification3_spec__1_#t~ret69 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~9 := __utac_acc__Specification3_spec__1_#t~ret69;havoc __utac_acc__Specification3_spec__1_#t~ret69; 101#L915true assume 0 != __utac_acc__Specification3_spec__1_~tmp~9; 91#L921-1true [2019-01-14 04:24:35,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:35,362 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-14 04:24:35,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:35,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:35,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:35,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:35,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:36,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:36,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1667892546, now seen corresponding path program 1 times [2019-01-14 04:24:36,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:36,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:36,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:36,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:36,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:36,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:36,170 INFO L82 PathProgramCache]: Analyzing trace with hash 46386392, now seen corresponding path program 1 times [2019-01-14 04:24:36,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:36,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:36,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:36,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:36,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:24:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:24:36,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:24:36,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:24:36,499 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 04:24:36,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:24:36,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:24:36,637 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 6 states. [2019-01-14 04:24:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:24:37,393 INFO L93 Difference]: Finished difference Result 438 states and 645 transitions. [2019-01-14 04:24:37,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:24:37,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 438 states and 645 transitions. [2019-01-14 04:24:37,412 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 285 [2019-01-14 04:24:37,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 438 states to 417 states and 624 transitions. [2019-01-14 04:24:37,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 417 [2019-01-14 04:24:37,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 417 [2019-01-14 04:24:37,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 417 states and 624 transitions. [2019-01-14 04:24:37,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:24:37,433 INFO L706 BuchiCegarLoop]: Abstraction has 417 states and 624 transitions. [2019-01-14 04:24:37,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states and 624 transitions. [2019-01-14 04:24:37,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 234. [2019-01-14 04:24:37,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-14 04:24:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 348 transitions. [2019-01-14 04:24:37,485 INFO L729 BuchiCegarLoop]: Abstraction has 234 states and 348 transitions. [2019-01-14 04:24:37,485 INFO L609 BuchiCegarLoop]: Abstraction has 234 states and 348 transitions. [2019-01-14 04:24:37,486 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:24:37,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 234 states and 348 transitions. [2019-01-14 04:24:37,489 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 160 [2019-01-14 04:24:37,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:24:37,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:24:37,491 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:24:37,491 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:24:37,491 INFO L794 eck$LassoCheckResult]: Stem: 797#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(21);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(21);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(30);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(9);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(25);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(30);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(9);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(13);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(110, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 3 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string58.base, #t~string58.offset, 1);call write~init~int(80, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(117, #t~string58.base, 2 + #t~string58.offset, 1);call write~init~int(109, #t~string58.base, 3 + #t~string58.offset, 1);call write~init~int(112, #t~string58.base, 4 + #t~string58.offset, 1);call write~init~int(58, #t~string58.base, 5 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 6 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string60.base, #t~string60.offset, 1);call write~init~int(110, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 2 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string62.base, #t~string62.offset, 1);call write~init~int(102, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(102, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 3 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string64.base, #t~string64.offset, 1);call write~init~int(32, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 2 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string66.base, #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 1 + #t~string66.offset, 1); 667#L-1 havoc main_#res;havoc main_#t~ret46, main_~retValue_acc~9, main_~tmp~3;havoc main_~retValue_acc~9;havoc main_~tmp~3; 668#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; 665#L73 main_#t~ret46 := valid_product_#res;main_~tmp~3 := main_#t~ret46;havoc main_#t~ret46; 666#L649 assume 0 != main_~tmp~3; 779#L625 havoc test_#t~nondet72, test_#t~nondet73, test_#t~nondet74, test_#t~nondet75, test_~splverifierCounter~0, test_~tmp~10, test_~tmp___0~3, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~10;havoc test_~tmp___0~3;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 652#L921-1 [2019-01-14 04:24:37,492 INFO L796 eck$LassoCheckResult]: Loop: 652#L921-1 assume !false; 653#L951 assume test_~splverifierCounter~0 < 4; 675#L952 test_~tmp~10 := test_#t~nondet72;havoc test_#t~nondet72; 809#L960 assume !(0 != test_~tmp~10); 817#L960-1 test_~tmp___0~3 := test_#t~nondet73;havoc test_#t~nondet73; 729#L970 assume !(0 != test_~tmp___0~3); 687#L970-1 test_~tmp___2~0 := test_#t~nondet74;havoc test_#t~nondet74; 688#L980 assume 0 != test_~tmp___2~0; 750#L986-1 assume !(0 != ~pumpRunning~0); 677#L675 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret49, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 752#L759 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__lowWaterSensor_#t~ret48, processEnvironment__wrappee__lowWaterSensor_~tmp~5;havoc processEnvironment__wrappee__lowWaterSensor_~tmp~5; 737#L733-1 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret47, processEnvironment__wrappee__highWaterSensor_~tmp~4;havoc processEnvironment__wrappee__highWaterSensor_~tmp~4; 739#L707-3 assume !(0 == ~pumpRunning~0); 713#L682 havoc __utac_acc__Specification3_spec__1_#t~ret69, __utac_acc__Specification3_spec__1_#t~ret70, __utac_acc__Specification3_spec__1_#t~ret71, __utac_acc__Specification3_spec__1_~tmp~9, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~9;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 825#L129-1 __utac_acc__Specification3_spec__1_#t~ret69 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~9 := __utac_acc__Specification3_spec__1_#t~ret69;havoc __utac_acc__Specification3_spec__1_#t~ret69; 692#L915 assume 0 != __utac_acc__Specification3_spec__1_~tmp~9; 652#L921-1 [2019-01-14 04:24:37,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:37,495 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-14 04:24:37,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:37,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:37,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:37,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:37,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:37,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:37,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2101003031, now seen corresponding path program 1 times [2019-01-14 04:24:37,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:37,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:37,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:37,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:24:37,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:24:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:24:37,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:24:37,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:24:37,802 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:24:37,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:24:37,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:24:37,804 INFO L87 Difference]: Start difference. First operand 234 states and 348 transitions. cyclomatic complexity: 117 Second operand 3 states. [2019-01-14 04:24:38,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:24:38,432 INFO L93 Difference]: Finished difference Result 243 states and 337 transitions. [2019-01-14 04:24:38,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:24:38,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 243 states and 337 transitions. [2019-01-14 04:24:38,437 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 170 [2019-01-14 04:24:38,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 243 states to 243 states and 337 transitions. [2019-01-14 04:24:38,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 243 [2019-01-14 04:24:38,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 243 [2019-01-14 04:24:38,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 243 states and 337 transitions. [2019-01-14 04:24:38,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:24:38,447 INFO L706 BuchiCegarLoop]: Abstraction has 243 states and 337 transitions. [2019-01-14 04:24:38,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states and 337 transitions. [2019-01-14 04:24:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-01-14 04:24:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-01-14 04:24:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 337 transitions. [2019-01-14 04:24:38,476 INFO L729 BuchiCegarLoop]: Abstraction has 243 states and 337 transitions. [2019-01-14 04:24:38,476 INFO L609 BuchiCegarLoop]: Abstraction has 243 states and 337 transitions. [2019-01-14 04:24:38,476 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:24:38,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 243 states and 337 transitions. [2019-01-14 04:24:38,481 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 170 [2019-01-14 04:24:38,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:24:38,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:24:38,484 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:24:38,484 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:24:38,484 INFO L794 eck$LassoCheckResult]: Stem: 1267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(21);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(21);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(30);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(9);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(25);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(30);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(9);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(13);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(110, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 3 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string58.base, #t~string58.offset, 1);call write~init~int(80, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(117, #t~string58.base, 2 + #t~string58.offset, 1);call write~init~int(109, #t~string58.base, 3 + #t~string58.offset, 1);call write~init~int(112, #t~string58.base, 4 + #t~string58.offset, 1);call write~init~int(58, #t~string58.base, 5 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 6 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string60.base, #t~string60.offset, 1);call write~init~int(110, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 2 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string62.base, #t~string62.offset, 1);call write~init~int(102, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(102, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 3 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string64.base, #t~string64.offset, 1);call write~init~int(32, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 2 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string66.base, #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 1 + #t~string66.offset, 1); 1150#L-1 havoc main_#res;havoc main_#t~ret46, main_~retValue_acc~9, main_~tmp~3;havoc main_~retValue_acc~9;havoc main_~tmp~3; 1151#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; 1148#L73 main_#t~ret46 := valid_product_#res;main_~tmp~3 := main_#t~ret46;havoc main_#t~ret46; 1149#L649 assume 0 != main_~tmp~3; 1250#L625 havoc test_#t~nondet72, test_#t~nondet73, test_#t~nondet74, test_#t~nondet75, test_~splverifierCounter~0, test_~tmp~10, test_~tmp___0~3, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~10;havoc test_~tmp___0~3;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1135#L921-1 [2019-01-14 04:24:38,485 INFO L796 eck$LassoCheckResult]: Loop: 1135#L921-1 assume !false; 1136#L951 assume test_~splverifierCounter~0 < 4; 1160#L952 test_~tmp~10 := test_#t~nondet72;havoc test_#t~nondet72; 1275#L960 assume !(0 != test_~tmp~10); 1279#L960-1 test_~tmp___0~3 := test_#t~nondet73;havoc test_#t~nondet73; 1208#L970 assume !(0 != test_~tmp___0~3); 1166#L970-1 test_~tmp___2~0 := test_#t~nondet74;havoc test_#t~nondet74; 1167#L980 assume 0 != test_~tmp___2~0; 1225#L986-1 assume !(0 != ~pumpRunning~0); 1226#L675 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret49, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 1227#L759 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__lowWaterSensor_#t~ret48, processEnvironment__wrappee__lowWaterSensor_~tmp~5;havoc processEnvironment__wrappee__lowWaterSensor_~tmp~5; 1215#L733-1 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret47, processEnvironment__wrappee__highWaterSensor_~tmp~4;havoc processEnvironment__wrappee__highWaterSensor_~tmp~4; 1216#L707-3 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret67, isHighWaterLevel_~retValue_acc~12, isHighWaterLevel_~tmp~7, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~12;havoc isHighWaterLevel_~tmp~7;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~4;havoc isHighWaterSensorDry_~retValue_acc~4; 1156#L169-3 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~4 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~4; 1157#L174-3 isHighWaterLevel_#t~ret67 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~7 := isHighWaterLevel_#t~ret67;havoc isHighWaterLevel_#t~ret67; 1232#L861-9 assume 0 != isHighWaterLevel_~tmp~7;isHighWaterLevel_~tmp___0~0 := 0; 1266#L861-11 isHighWaterLevel_~retValue_acc~12 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~12; 1260#L867-3 processEnvironment__wrappee__highWaterSensor_#t~ret47 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~4 := processEnvironment__wrappee__highWaterSensor_#t~ret47;havoc processEnvironment__wrappee__highWaterSensor_#t~ret47; 1191#L711-3 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~4); 1193#L682 havoc __utac_acc__Specification3_spec__1_#t~ret69, __utac_acc__Specification3_spec__1_#t~ret70, __utac_acc__Specification3_spec__1_#t~ret71, __utac_acc__Specification3_spec__1_~tmp~9, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~9;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 1285#L129-1 __utac_acc__Specification3_spec__1_#t~ret69 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~9 := __utac_acc__Specification3_spec__1_#t~ret69;havoc __utac_acc__Specification3_spec__1_#t~ret69; 1173#L915 assume 0 != __utac_acc__Specification3_spec__1_~tmp~9; 1135#L921-1 [2019-01-14 04:24:38,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:38,485 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-14 04:24:38,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:38,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:38,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:38,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:38,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:38,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:38,733 INFO L82 PathProgramCache]: Analyzing trace with hash 2033396629, now seen corresponding path program 1 times [2019-01-14 04:24:38,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:38,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:38,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:38,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:24:38,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:38,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:38,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1008265541, now seen corresponding path program 1 times [2019-01-14 04:24:38,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:38,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:38,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:38,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:38,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:24:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:24:39,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:24:39,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:24:39,326 WARN L181 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-01-14 04:24:39,470 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-14 04:24:39,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:24:39,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:24:39,491 INFO L87 Difference]: Start difference. First operand 243 states and 337 transitions. cyclomatic complexity: 97 Second operand 5 states. [2019-01-14 04:24:39,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:24:39,744 INFO L93 Difference]: Finished difference Result 806 states and 1118 transitions. [2019-01-14 04:24:39,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 04:24:39,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 806 states and 1118 transitions. [2019-01-14 04:24:39,752 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 595 [2019-01-14 04:24:39,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 806 states to 806 states and 1118 transitions. [2019-01-14 04:24:39,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 806 [2019-01-14 04:24:39,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 806 [2019-01-14 04:24:39,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 806 states and 1118 transitions. [2019-01-14 04:24:39,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:24:39,764 INFO L706 BuchiCegarLoop]: Abstraction has 806 states and 1118 transitions. [2019-01-14 04:24:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states and 1118 transitions. [2019-01-14 04:24:39,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 480. [2019-01-14 04:24:39,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-01-14 04:24:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 656 transitions. [2019-01-14 04:24:39,793 INFO L729 BuchiCegarLoop]: Abstraction has 480 states and 656 transitions. [2019-01-14 04:24:39,793 INFO L609 BuchiCegarLoop]: Abstraction has 480 states and 656 transitions. [2019-01-14 04:24:39,793 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:24:39,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 480 states and 656 transitions. [2019-01-14 04:24:39,799 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 340 [2019-01-14 04:24:39,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:24:39,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:24:39,803 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:24:39,803 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:24:39,803 INFO L794 eck$LassoCheckResult]: Stem: 2350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(21);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(21);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(30);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(9);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(25);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(30);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(9);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(13);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(110, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 3 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string58.base, #t~string58.offset, 1);call write~init~int(80, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(117, #t~string58.base, 2 + #t~string58.offset, 1);call write~init~int(109, #t~string58.base, 3 + #t~string58.offset, 1);call write~init~int(112, #t~string58.base, 4 + #t~string58.offset, 1);call write~init~int(58, #t~string58.base, 5 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 6 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string60.base, #t~string60.offset, 1);call write~init~int(110, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 2 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string62.base, #t~string62.offset, 1);call write~init~int(102, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(102, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 3 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string64.base, #t~string64.offset, 1);call write~init~int(32, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 2 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string66.base, #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 1 + #t~string66.offset, 1); 2217#L-1 havoc main_#res;havoc main_#t~ret46, main_~retValue_acc~9, main_~tmp~3;havoc main_~retValue_acc~9;havoc main_~tmp~3; 2218#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; 2215#L73 main_#t~ret46 := valid_product_#res;main_~tmp~3 := main_#t~ret46;havoc main_#t~ret46; 2216#L649 assume 0 != main_~tmp~3; 2323#L625 havoc test_#t~nondet72, test_#t~nondet73, test_#t~nondet74, test_#t~nondet75, test_~splverifierCounter~0, test_~tmp~10, test_~tmp___0~3, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~10;havoc test_~tmp___0~3;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 2324#L921-1 [2019-01-14 04:24:39,803 INFO L796 eck$LassoCheckResult]: Loop: 2324#L921-1 assume !false; 2572#L951 assume test_~splverifierCounter~0 < 4; 2573#L952 test_~tmp~10 := test_#t~nondet72;havoc test_#t~nondet72; 2664#L960 assume !(0 != test_~tmp~10); 2662#L960-1 test_~tmp___0~3 := test_#t~nondet73;havoc test_#t~nondet73; 2660#L970 assume !(0 != test_~tmp___0~3); 2658#L970-1 test_~tmp___2~0 := test_#t~nondet74;havoc test_#t~nondet74; 2657#L980 assume 0 != test_~tmp___2~0; 2629#L986-1 assume !(0 != ~pumpRunning~0); 2623#L675 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret49, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 2598#L759 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__lowWaterSensor_#t~ret48, processEnvironment__wrappee__lowWaterSensor_~tmp~5;havoc processEnvironment__wrappee__lowWaterSensor_~tmp~5; 2595#L733-1 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret47, processEnvironment__wrappee__highWaterSensor_~tmp~4;havoc processEnvironment__wrappee__highWaterSensor_~tmp~4; 2615#L707-3 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret67, isHighWaterLevel_~retValue_acc~12, isHighWaterLevel_~tmp~7, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~12;havoc isHighWaterLevel_~tmp~7;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~4;havoc isHighWaterSensorDry_~retValue_acc~4; 2611#L169-3 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~4 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~4; 2609#L174-3 isHighWaterLevel_#t~ret67 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~7 := isHighWaterLevel_#t~ret67;havoc isHighWaterLevel_#t~ret67; 2607#L861-9 assume 0 != isHighWaterLevel_~tmp~7;isHighWaterLevel_~tmp___0~0 := 0; 2599#L861-11 isHighWaterLevel_~retValue_acc~12 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~12; 2596#L867-3 processEnvironment__wrappee__highWaterSensor_#t~ret47 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~4 := processEnvironment__wrappee__highWaterSensor_#t~ret47;havoc processEnvironment__wrappee__highWaterSensor_#t~ret47; 2256#L711-3 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~4); 2258#L682 havoc __utac_acc__Specification3_spec__1_#t~ret69, __utac_acc__Specification3_spec__1_#t~ret70, __utac_acc__Specification3_spec__1_#t~ret71, __utac_acc__Specification3_spec__1_~tmp~9, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~9;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 2584#L129-1 __utac_acc__Specification3_spec__1_#t~ret69 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~9 := __utac_acc__Specification3_spec__1_#t~ret69;havoc __utac_acc__Specification3_spec__1_#t~ret69; 2583#L915 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~9);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~3;havoc getWaterLevel_~retValue_acc~3;getWaterLevel_~retValue_acc~3 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~3; 2582#L161 __utac_acc__Specification3_spec__1_#t~ret70 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~2 := __utac_acc__Specification3_spec__1_#t~ret70;havoc __utac_acc__Specification3_spec__1_#t~ret70; 2580#L921 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~2); 2324#L921-1 [2019-01-14 04:24:39,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:39,809 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2019-01-14 04:24:39,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:39,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:39,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:39,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:39,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:39,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:39,971 INFO L82 PathProgramCache]: Analyzing trace with hash -115947609, now seen corresponding path program 1 times [2019-01-14 04:24:39,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:39,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:39,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:39,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:24:39,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:39,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:39,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1719435597, now seen corresponding path program 1 times [2019-01-14 04:24:39,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:39,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:39,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:39,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:39,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:40,745 WARN L181 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-01-14 04:25:07,156 WARN L181 SmtUtils]: Spent 26.34 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-14 04:25:20,900 WARN L181 SmtUtils]: Spent 13.74 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-14 04:25:20,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:25:20 BoogieIcfgContainer [2019-01-14 04:25:20,995 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:25:20,995 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:25:20,995 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:25:20,996 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:25:20,996 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:24:35" (3/4) ... [2019-01-14 04:25:21,003 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:25:21,109 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:25:21,109 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:25:21,110 INFO L168 Benchmark]: Toolchain (without parser) took 48608.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 951.4 MB in the beginning and 829.5 MB in the end (delta: 121.9 MB). Peak memory consumption was 433.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:25:21,114 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:25:21,115 INFO L168 Benchmark]: CACSL2BoogieTranslator took 720.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:25:21,120 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.11 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:25:21,121 INFO L168 Benchmark]: Boogie Preprocessor took 58.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:25:21,121 INFO L168 Benchmark]: RCFGBuilder took 1824.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.9 MB). Peak memory consumption was 78.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:25:21,122 INFO L168 Benchmark]: BuchiAutomizer took 45798.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.0 GB in the beginning and 829.5 MB in the end (delta: 194.9 MB). Peak memory consumption was 388.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:25:21,122 INFO L168 Benchmark]: Witness Printer took 113.65 ms. Allocated memory is still 1.3 GB. Free memory is still 829.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:25:21,131 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.16 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 720.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.11 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.35 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 1824.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.9 MB). Peak memory consumption was 78.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 45798.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.0 GB in the beginning and 829.5 MB in the end (delta: 194.9 MB). Peak memory consumption was 388.4 MB. Max. memory is 11.5 GB. * Witness Printer took 113.65 ms. Allocated memory is still 1.3 GB. Free memory is still 829.5 MB. 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 6 locations. The remainder module has 480 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 45.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 43.7s. Construction of modules took 1.2s. 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, 509 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 480 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 831 SDtfs, 2172 SDslu, 2232 SDs, 0 SdLazy, 154 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 950]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {NULL=0, NULL=0, NULL=-10, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-24, methaneLevelCritical=0, NULL=-15, tmp___1=0, NULL=-8, NULL=0, NULL=0, NULL=-13, cleanupTimeShifts=4, NULL=-18, tmp=0, waterLevel=1, NULL=0, NULL=0, NULL=-21, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53d9d9bb=0, NULL=-20, retValue_acc=1, \result=1, head=0, pumpRunning=0, tmp=1, retValue_acc=1, NULL=0, NULL=0, \result=1, retValue_acc=0, tmp=1, tmp___0=0, NULL=-3, head=0, tmp=0, NULL=-6, NULL=0, NULL=0, NULL=-17, NULL=-22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1eae018=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@513e53c9=0, NULL=-14, NULL=0, retValue_acc=0, NULL=-23, NULL=-2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@448a3c0f=0, tmp___0=0, NULL=-11, NULL=0, NULL=-4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e370777=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10ef6dbd=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4396d408=0, tmp=0, NULL=-9, NULL=-19, tmp___0=1, NULL=0, NULL=0, systemActive=1, \result=1, NULL=0, \result=0, retValue_acc=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-5, \result=0, NULL=-16, NULL=-25, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5df8ad5e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78f88b99=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c9d4ed6=59, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b07b248=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37cd7751=0, retValue_acc=1, tmp=0, tmp___2=59, splverifierCounter=0, \result=0, NULL=-1, tmp___1=0, NULL=-12, NULL=-7} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L86] int waterLevel = 1; [L87] int methaneLevelCritical = 0; [L367] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L564] int cleanupTimeShifts = 4; [L667] int pumpRunning = 0; [L668] int systemActive = 1; [L640] int retValue_acc ; [L641] int tmp ; [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); [L647] tmp = valid_product() [L649] COND TRUE \read(tmp) [L941] int splverifierCounter ; [L942] int tmp ; [L943] int tmp___0 ; [L944] int tmp___1 ; [L945] int tmp___2 ; [L948] splverifierCounter = 0 Loop: [L950] COND TRUE 1 [L952] COND TRUE splverifierCounter < 4 [L958] tmp = __VERIFIER_nondet_int() [L960] COND FALSE !(\read(tmp)) [L968] tmp___0 = __VERIFIER_nondet_int() [L970] COND FALSE !(\read(tmp___0)) [L978] tmp___2 = __VERIFIER_nondet_int() [L980] COND TRUE \read(tmp___2) [L675] COND FALSE !(\read(pumpRunning)) [L682] COND TRUE \read(systemActive) [L756] int tmp ; [L759] COND FALSE !(\read(pumpRunning)) [L730] int tmp ; [L733] COND FALSE !(\read(pumpRunning)) [L704] int tmp ; [L707] COND TRUE ! pumpRunning [L853] int retValue_acc ; [L854] int tmp ; [L855] int tmp___0 ; [L166] int retValue_acc ; [L169] COND TRUE waterLevel < 2 [L170] retValue_acc = 1 [L171] return (retValue_acc); [L859] tmp = isHighWaterSensorDry() [L861] COND TRUE \read(tmp) [L862] tmp___0 = 0 [L866] retValue_acc = tmp___0 [L867] return (retValue_acc); [L709] tmp = isHighWaterLevel() [L711] COND FALSE !(\read(tmp)) [L907] int tmp ; [L908] int tmp___0 ; [L909] int tmp___1 ; [L125] int retValue_acc ; [L128] retValue_acc = methaneLevelCritical [L129] return (retValue_acc); [L913] tmp = isMethaneLevelCritical() [L915] COND FALSE !(\read(tmp)) [L157] int retValue_acc ; [L160] retValue_acc = waterLevel [L161] return (retValue_acc); [L919] tmp___0 = getWaterLevel() [L921] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...