./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec3_product29_false-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_spec3_product29_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 6a7af561659176054c5750cdb899e68779816fa6 ......................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:42:45,380 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:42:45,382 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:42:45,400 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:42:45,400 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:42:45,402 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:42:45,403 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:42:45,406 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:42:45,410 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:42:45,413 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:42:45,414 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:42:45,414 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:42:45,417 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:42:45,418 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:42:45,422 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:42:45,423 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:42:45,425 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:42:45,433 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:42:45,438 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:42:45,439 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:42:45,442 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:42:45,444 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:42:45,447 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:42:45,448 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:42:45,448 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:42:45,449 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:42:45,450 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:42:45,451 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:42:45,454 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:42:45,455 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:42:45,455 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:42:45,458 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:42:45,458 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:42:45,458 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:42:45,459 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:42:45,460 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:42:45,460 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:42:45,489 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:42:45,489 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:42:45,490 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:42:45,490 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:42:45,494 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:42:45,494 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:42:45,494 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:42:45,495 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:42:45,495 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:42:45,495 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:42:45,495 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:42:45,495 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:42:45,496 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:42:45,496 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:42:45,496 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:42:45,497 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:42:45,497 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:42:45,497 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:42:45,497 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:42:45,497 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:42:45,498 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:42:45,499 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:42:45,499 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:42:45,499 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:42:45,499 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:42:45,500 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:42:45,500 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:42:45,500 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:42:45,500 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:42:45,500 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:42:45,500 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:42:45,501 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:42:45,502 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 -> 6a7af561659176054c5750cdb899e68779816fa6 [2019-01-01 23:42:45,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:42:45,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:42:45,577 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:42:45,578 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:42:45,579 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:42:45,580 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec3_product29_false-unreach-call_false-termination.cil.c [2019-01-01 23:42:45,641 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d43bfd6cf/171aedd16431489f97baf739011a0eac/FLAGae4af1671 [2019-01-01 23:42:46,197 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:42:46,198 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec3_product29_false-unreach-call_false-termination.cil.c [2019-01-01 23:42:46,211 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d43bfd6cf/171aedd16431489f97baf739011a0eac/FLAGae4af1671 [2019-01-01 23:42:46,492 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d43bfd6cf/171aedd16431489f97baf739011a0eac [2019-01-01 23:42:46,496 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:42:46,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:42:46,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:42:46,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:42:46,506 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:42:46,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:42:46" (1/1) ... [2019-01-01 23:42:46,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5801be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:46, skipping insertion in model container [2019-01-01 23:42:46,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:42:46" (1/1) ... [2019-01-01 23:42:46,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:42:46,580 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:42:46,936 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:42:46,966 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:42:47,104 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:42:47,219 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:42:47,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:47 WrapperNode [2019-01-01 23:42:47,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:42:47,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:42:47,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:42:47,224 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:42:47,233 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:42:47" (1/1) ... [2019-01-01 23:42:47,252 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:42:47" (1/1) ... [2019-01-01 23:42:47,300 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:42:47,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:42:47,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:42:47,302 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:42:47,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:47" (1/1) ... [2019-01-01 23:42:47,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:47" (1/1) ... [2019-01-01 23:42:47,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:47" (1/1) ... [2019-01-01 23:42:47,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:47" (1/1) ... [2019-01-01 23:42:47,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:47" (1/1) ... [2019-01-01 23:42:47,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:47" (1/1) ... [2019-01-01 23:42:47,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:47" (1/1) ... [2019-01-01 23:42:47,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:42:47,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:42:47,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:42:47,369 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:42:47,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:47" (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:42:47,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:42:47,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:42:47,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:42:47,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:42:48,769 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:42:48,770 INFO L280 CfgBuilder]: Removed 162 assue(true) statements. [2019-01-01 23:42:48,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:42:48 BoogieIcfgContainer [2019-01-01 23:42:48,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:42:48,773 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:42:48,773 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:42:48,777 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:42:48,780 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:42:48,780 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:42:46" (1/3) ... [2019-01-01 23:42:48,781 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f9ba18b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:42:48, skipping insertion in model container [2019-01-01 23:42:48,782 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:42:48,782 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:47" (2/3) ... [2019-01-01 23:42:48,782 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f9ba18b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:42:48, skipping insertion in model container [2019-01-01 23:42:48,782 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:42:48,782 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:42:48" (3/3) ... [2019-01-01 23:42:48,785 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product29_false-unreach-call_false-termination.cil.c [2019-01-01 23:42:48,846 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:42:48,847 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:42:48,847 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:42:48,847 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:42:48,847 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:42:48,848 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:42:48,848 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:42:48,848 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:42:48,848 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:42:48,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states. [2019-01-01 23:42:48,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2019-01-01 23:42:48,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:42:48,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:42:48,910 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:42:48,910 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:42:48,910 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:42:48,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states. [2019-01-01 23:42:48,921 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2019-01-01 23:42:48,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:42:48,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:42:48,922 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:42:48,923 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:42:48,930 INFO L794 eck$LassoCheckResult]: Stem: 75#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string6.base, #t~string6.offset, 1);call write~init~int(77, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(101, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(116, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(104, #t~string6.base, 4 + #t~string6.offset, 1);call write~init~int(58, #t~string6.base, 5 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 6 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string8.base, #t~string8.offset, 1);call write~init~int(82, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(73, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(84, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 4 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(75, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string12.base, #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 1 + #t~string12.offset, 1);~head~0.base, ~head~0.offset := 0, 0;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~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(21);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);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(30);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(9);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(13);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(7);call write~init~int(44, #t~string61.base, #t~string61.offset, 1);call write~init~int(80, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(117, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(109, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(112, #t~string61.base, 4 + #t~string61.offset, 1);call write~init~int(58, #t~string61.base, 5 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 6 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(110, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 3 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string67.base, #t~string67.offset, 1);call write~init~int(32, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string69.base, #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 1 + #t~string69.offset, 1); 4#L-1true havoc main_#res;havoc main_#t~ret49, main_~retValue_acc~8, main_~tmp~4;havoc main_~retValue_acc~8;havoc main_~tmp~4; 5#L563true havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 22#L571true main_#t~ret49 := valid_product_#res;main_~tmp~4 := main_#t~ret49;havoc main_#t~ret49; 14#L670true assume 0 != main_~tmp~4; 108#L646true havoc test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_#t~nondet74, test_~splverifierCounter~0, test_~tmp~9, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~9;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 6#L59-1true [2019-01-01 23:42:48,931 INFO L796 eck$LassoCheckResult]: Loop: 6#L59-1true assume !false; 64#L892true assume test_~splverifierCounter~0 < 4; 17#L893true test_~tmp~9 := test_#t~nondet71;havoc test_#t~nondet71; 43#L901true assume !(0 != test_~tmp~9); 26#L901-1true test_~tmp___0~2 := test_#t~nondet72;havoc test_#t~nondet72; 77#L911true assume !(0 != test_~tmp___0~2); 68#L911-1true test_~tmp___2~0 := test_#t~nondet73;havoc test_#t~nondet73; 3#L921true assume 0 != test_~tmp___2~0; 93#L927-2true assume !(0 != ~pumpRunning~0); 104#L693true assume !(0 != ~systemActive~0); 40#L700true havoc __utac_acc__Specification3_spec__1_#t~ret0, __utac_acc__Specification3_spec__1_#t~ret1, __utac_acc__Specification3_spec__1_#t~ret2, __utac_acc__Specification3_spec__1_~tmp~0, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~0;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 87#L126-1true __utac_acc__Specification3_spec__1_#t~ret0 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~0 := __utac_acc__Specification3_spec__1_#t~ret0;havoc __utac_acc__Specification3_spec__1_#t~ret0; 55#L53true assume 0 != __utac_acc__Specification3_spec__1_~tmp~0; 6#L59-1true [2019-01-01 23:42:48,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:48,948 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-01 23:42:48,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:48,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:49,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:49,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:42:49,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:49,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:49,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1680298507, now seen corresponding path program 1 times [2019-01-01 23:42:49,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:49,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:49,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:49,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:42:49,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:49,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:49,876 INFO L82 PathProgramCache]: Analyzing trace with hash 33980431, now seen corresponding path program 1 times [2019-01-01 23:42:49,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:49,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:49,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:49,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:42:49,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:42:50,111 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:42:50,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:42:50,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:42:50,224 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 23:42:50,390 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 23:42:50,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:42:50,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:42:50,431 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 6 states. [2019-01-01 23:42:50,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:42:50,669 INFO L93 Difference]: Finished difference Result 108 states and 151 transitions. [2019-01-01 23:42:50,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 23:42:50,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 151 transitions. [2019-01-01 23:42:50,677 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 67 [2019-01-01 23:42:50,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 101 states and 144 transitions. [2019-01-01 23:42:50,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2019-01-01 23:42:50,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2019-01-01 23:42:50,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 144 transitions. [2019-01-01 23:42:50,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:42:50,689 INFO L705 BuchiCegarLoop]: Abstraction has 101 states and 144 transitions. [2019-01-01 23:42:50,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 144 transitions. [2019-01-01 23:42:50,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-01 23:42:50,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-01 23:42:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2019-01-01 23:42:50,732 INFO L728 BuchiCegarLoop]: Abstraction has 101 states and 144 transitions. [2019-01-01 23:42:50,732 INFO L608 BuchiCegarLoop]: Abstraction has 101 states and 144 transitions. [2019-01-01 23:42:50,732 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:42:50,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 144 transitions. [2019-01-01 23:42:50,735 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 67 [2019-01-01 23:42:50,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:42:50,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:42:50,736 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:42:50,736 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:42:50,737 INFO L794 eck$LassoCheckResult]: Stem: 328#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string6.base, #t~string6.offset, 1);call write~init~int(77, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(101, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(116, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(104, #t~string6.base, 4 + #t~string6.offset, 1);call write~init~int(58, #t~string6.base, 5 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 6 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string8.base, #t~string8.offset, 1);call write~init~int(82, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(73, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(84, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 4 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(75, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string12.base, #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 1 + #t~string12.offset, 1);~head~0.base, ~head~0.offset := 0, 0;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~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(21);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);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(30);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(9);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(13);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(7);call write~init~int(44, #t~string61.base, #t~string61.offset, 1);call write~init~int(80, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(117, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(109, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(112, #t~string61.base, 4 + #t~string61.offset, 1);call write~init~int(58, #t~string61.base, 5 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 6 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(110, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 3 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string67.base, #t~string67.offset, 1);call write~init~int(32, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string69.base, #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 1 + #t~string69.offset, 1); 237#L-1 havoc main_#res;havoc main_#t~ret49, main_~retValue_acc~8, main_~tmp~4;havoc main_~retValue_acc~8;havoc main_~tmp~4; 238#L563 havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 239#L571 main_#t~ret49 := valid_product_#res;main_~tmp~4 := main_#t~ret49;havoc main_#t~ret49; 256#L670 assume 0 != main_~tmp~4; 257#L646 havoc test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_#t~nondet74, test_~splverifierCounter~0, test_~tmp~9, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~9;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 240#L59-1 [2019-01-01 23:42:50,737 INFO L796 eck$LassoCheckResult]: Loop: 240#L59-1 assume !false; 241#L892 assume test_~splverifierCounter~0 < 4; 261#L893 test_~tmp~9 := test_#t~nondet71;havoc test_#t~nondet71; 262#L901 assume !(0 != test_~tmp~9); 275#L901-1 test_~tmp___0~2 := test_#t~nondet72;havoc test_#t~nondet72; 276#L911 assume !(0 != test_~tmp___0~2); 322#L911-1 test_~tmp___2~0 := test_#t~nondet73;havoc test_#t~nondet73; 234#L921 assume 0 != test_~tmp___2~0; 235#L927-2 assume !(0 != ~pumpRunning~0); 300#L693 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret51, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 334#L751 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret50, processEnvironment__wrappee__methaneQuery_~tmp~5;havoc processEnvironment__wrappee__methaneQuery_~tmp~5; 251#L725-1 assume !(0 != ~pumpRunning~0); 253#L700 havoc __utac_acc__Specification3_spec__1_#t~ret0, __utac_acc__Specification3_spec__1_#t~ret1, __utac_acc__Specification3_spec__1_#t~ret2, __utac_acc__Specification3_spec__1_~tmp~0, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~0;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 295#L126-1 __utac_acc__Specification3_spec__1_#t~ret0 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~0 := __utac_acc__Specification3_spec__1_#t~ret0;havoc __utac_acc__Specification3_spec__1_#t~ret0; 314#L53 assume 0 != __utac_acc__Specification3_spec__1_~tmp~0; 240#L59-1 [2019-01-01 23:42:50,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:50,737 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-01 23:42:50,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:50,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:50,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:50,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:42:50,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:51,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:51,028 INFO L82 PathProgramCache]: Analyzing trace with hash -2008522617, now seen corresponding path program 1 times [2019-01-01 23:42:51,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:51,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:51,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:51,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:42:51,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:51,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:51,039 INFO L82 PathProgramCache]: Analyzing trace with hash 441062433, now seen corresponding path program 1 times [2019-01-01 23:42:51,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:51,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:51,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:51,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:42:51,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:42:51,300 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:42:51,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:42:51,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:42:51,409 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-01 23:42:51,529 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-01 23:42:51,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:42:51,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:42:51,539 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. cyclomatic complexity: 45 Second operand 5 states. [2019-01-01 23:42:51,876 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 23:42:52,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:42:52,658 INFO L93 Difference]: Finished difference Result 355 states and 516 transitions. [2019-01-01 23:42:52,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 23:42:52,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 355 states and 516 transitions. [2019-01-01 23:42:52,667 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 241 [2019-01-01 23:42:52,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 355 states to 355 states and 516 transitions. [2019-01-01 23:42:52,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 355 [2019-01-01 23:42:52,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 355 [2019-01-01 23:42:52,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 355 states and 516 transitions. [2019-01-01 23:42:52,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:42:52,677 INFO L705 BuchiCegarLoop]: Abstraction has 355 states and 516 transitions. [2019-01-01 23:42:52,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states and 516 transitions. [2019-01-01 23:42:52,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 196. [2019-01-01 23:42:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-01 23:42:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 278 transitions. [2019-01-01 23:42:52,697 INFO L728 BuchiCegarLoop]: Abstraction has 196 states and 278 transitions. [2019-01-01 23:42:52,697 INFO L608 BuchiCegarLoop]: Abstraction has 196 states and 278 transitions. [2019-01-01 23:42:52,697 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:42:52,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 196 states and 278 transitions. [2019-01-01 23:42:52,700 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 134 [2019-01-01 23:42:52,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:42:52,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:42:52,701 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:42:52,701 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:42:52,701 INFO L794 eck$LassoCheckResult]: Stem: 813#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string6.base, #t~string6.offset, 1);call write~init~int(77, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(101, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(116, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(104, #t~string6.base, 4 + #t~string6.offset, 1);call write~init~int(58, #t~string6.base, 5 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 6 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string8.base, #t~string8.offset, 1);call write~init~int(82, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(73, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(84, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 4 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(75, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string12.base, #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 1 + #t~string12.offset, 1);~head~0.base, ~head~0.offset := 0, 0;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~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(21);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);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(30);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(9);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(13);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(7);call write~init~int(44, #t~string61.base, #t~string61.offset, 1);call write~init~int(80, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(117, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(109, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(112, #t~string61.base, 4 + #t~string61.offset, 1);call write~init~int(58, #t~string61.base, 5 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 6 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(110, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 3 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string67.base, #t~string67.offset, 1);call write~init~int(32, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string69.base, #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 1 + #t~string69.offset, 1); 711#L-1 havoc main_#res;havoc main_#t~ret49, main_~retValue_acc~8, main_~tmp~4;havoc main_~retValue_acc~8;havoc main_~tmp~4; 712#L563 havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 713#L571 main_#t~ret49 := valid_product_#res;main_~tmp~4 := main_#t~ret49;havoc main_#t~ret49; 731#L670 assume 0 != main_~tmp~4; 732#L646 havoc test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_#t~nondet74, test_~splverifierCounter~0, test_~tmp~9, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~9;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 833#L59-1 [2019-01-01 23:42:52,702 INFO L796 eck$LassoCheckResult]: Loop: 833#L59-1 assume !false; 848#L892 assume test_~splverifierCounter~0 < 4; 849#L893 test_~tmp~9 := test_#t~nondet71;havoc test_#t~nondet71; 874#L901 assume !(0 != test_~tmp~9); 872#L901-1 test_~tmp___0~2 := test_#t~nondet72;havoc test_#t~nondet72; 871#L911 assume !(0 != test_~tmp___0~2); 870#L911-1 test_~tmp___2~0 := test_#t~nondet73;havoc test_#t~nondet73; 869#L921 assume 0 != test_~tmp___2~0; 865#L927-2 assume !(0 != ~pumpRunning~0); 863#L693 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret51, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 860#L751 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret50, processEnvironment__wrappee__methaneQuery_~tmp~5;havoc processEnvironment__wrappee__methaneQuery_~tmp~5; 726#L725-1 assume !(0 != ~pumpRunning~0); 728#L700 havoc __utac_acc__Specification3_spec__1_#t~ret0, __utac_acc__Specification3_spec__1_#t~ret1, __utac_acc__Specification3_spec__1_#t~ret2, __utac_acc__Specification3_spec__1_~tmp~0, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~0;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 823#L126-1 __utac_acc__Specification3_spec__1_#t~ret0 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~0 := __utac_acc__Specification3_spec__1_#t~ret0;havoc __utac_acc__Specification3_spec__1_#t~ret0; 824#L53 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~0);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; 724#L158 __utac_acc__Specification3_spec__1_#t~ret1 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~0 := __utac_acc__Specification3_spec__1_#t~ret1;havoc __utac_acc__Specification3_spec__1_#t~ret1; 725#L59 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~0); 833#L59-1 [2019-01-01 23:42:52,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:52,702 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-01 23:42:52,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:52,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:52,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:52,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:42:52,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:52,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:52,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1749911687, now seen corresponding path program 1 times [2019-01-01 23:42:52,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:52,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:52,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:52,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:42:52,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:52,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:52,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1340756845, now seen corresponding path program 1 times [2019-01-01 23:42:52,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:52,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:52,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:52,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:42:52,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:53,681 WARN L181 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 23:42:54,068 WARN L181 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 23:43:25,401 WARN L181 SmtUtils]: Spent 31.32 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-01 23:43:41,082 WARN L181 SmtUtils]: Spent 15.68 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-01 23:43:41,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:43:41 BoogieIcfgContainer [2019-01-01 23:43:41,200 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:43:41,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:43:41,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:43:41,202 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:43:41,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:42:48" (3/4) ... [2019-01-01 23:43:41,212 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:43:41,308 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:43:41,308 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:43:41,309 INFO L168 Benchmark]: Toolchain (without parser) took 54812.18 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.0 MB). Free memory was 948.7 MB in the beginning and 899.6 MB in the end (delta: 49.1 MB). Peak memory consumption was 372.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:43:41,313 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-01 23:43:41,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -191.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:43:41,314 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.75 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-01 23:43:41,315 INFO L168 Benchmark]: Boogie Preprocessor took 66.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:43:41,315 INFO L168 Benchmark]: RCFGBuilder took 1403.34 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: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:43:41,319 INFO L168 Benchmark]: BuchiAutomizer took 52427.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 910.9 MB in the end (delta: 157.2 MB). Peak memory consumption was 406.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:43:41,323 INFO L168 Benchmark]: Witness Printer took 106.81 ms. Allocated memory is still 1.4 GB. Free memory was 910.9 MB in the beginning and 899.6 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:43:41,330 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 723.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -191.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.75 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 66.92 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 1403.34 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: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 52427.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 910.9 MB in the end (delta: 157.2 MB). Peak memory consumption was 406.1 MB. Max. memory is 11.5 GB. * Witness Printer took 106.81 ms. Allocated memory is still 1.4 GB. Free memory was 910.9 MB in the beginning and 899.6 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 196 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 52.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 50.7s. Construction of modules took 0.8s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 159 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 196 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 346 SDtfs, 982 SDslu, 606 SDs, 0 SdLazy, 87 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 891]: 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 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6da1f0dd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5822f793=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5170448d=0, retValue_acc=0, NULL=-10, NULL=-19, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d0f8033=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-11, retValue_acc=0, NULL=0, NULL=0, methaneLevelCritical=0, NULL=-2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e1928b1=0, NULL=0, NULL=0, NULL=-13, NULL=-1, NULL=0, tmp___1=0, tmp=0, NULL=0, NULL=0, NULL=0, tmp___0=1, NULL=-17, tmp=0, cleanupTimeShifts=4, NULL=-8, NULL=-3, NULL=-14, NULL=-24, NULL=0, systemActive=1, waterLevel=1, NULL=-16, \result=1, NULL=0, NULL=0, NULL=-6, NULL=0, NULL=-9, NULL=0, NULL=0, NULL=-20, \result=1, retValue_acc=1, head=0, pumpRunning=0, NULL=-21, \result=0, tmp=1, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@85806d4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60f16f6d=71, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e64f0b2=0, NULL=-25, NULL=-26, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72d5841f=0, retValue_acc=1, tmp___2=71, tmp___0=0, splverifierCounter=0, NULL=0, \result=0, NULL=-12, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@709868d3=0, NULL=-15, tmp___1=0, head=0, tmp=0, NULL=-4, NULL=0, NULL=-18, NULL=-7, NULL=-23, tmp=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L83] int waterLevel = 1; [L84] int methaneLevelCritical = 0; [L341] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L585] int cleanupTimeShifts = 4; [L686] int pumpRunning = 0; [L687] int systemActive = 1; [L661] int retValue_acc ; [L662] int tmp ; [L567] int retValue_acc ; [L570] retValue_acc = 1 [L571] return (retValue_acc); [L668] tmp = valid_product() [L670] COND TRUE \read(tmp) [L882] int splverifierCounter ; [L883] int tmp ; [L884] int tmp___0 ; [L885] int tmp___1 ; [L886] int tmp___2 ; [L889] splverifierCounter = 0 Loop: [L891] COND TRUE 1 [L893] COND TRUE splverifierCounter < 4 [L899] tmp = __VERIFIER_nondet_int() [L901] COND FALSE !(\read(tmp)) [L909] tmp___0 = __VERIFIER_nondet_int() [L911] COND FALSE !(\read(tmp___0)) [L919] tmp___2 = __VERIFIER_nondet_int() [L921] COND TRUE \read(tmp___2) [L693] COND FALSE !(\read(pumpRunning)) [L700] COND TRUE \read(systemActive) [L748] int tmp ; [L751] COND FALSE !(\read(pumpRunning)) [L722] int tmp ; [L725] COND FALSE !(\read(pumpRunning)) [L45] int tmp ; [L46] int tmp___0 ; [L47] int tmp___1 ; [L122] int retValue_acc ; [L125] retValue_acc = methaneLevelCritical [L126] return (retValue_acc); [L51] tmp = isMethaneLevelCritical() [L53] COND FALSE !(\read(tmp)) [L154] int retValue_acc ; [L157] retValue_acc = waterLevel [L158] return (retValue_acc); [L57] tmp___0 = getWaterLevel() [L59] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...