./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec3_product19_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_product19_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 d64d9b1029a36f4dbed006d1e1d8543a0c6e0731 .................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:22:24,372 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:22:24,373 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:22:24,385 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:22:24,385 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:22:24,386 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:22:24,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:22:24,390 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:22:24,392 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:22:24,397 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:22:24,398 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:22:24,398 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:22:24,403 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:22:24,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:22:24,408 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:22:24,409 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:22:24,412 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:22:24,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:22:24,419 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:22:24,423 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:22:24,424 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:22:24,427 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:22:24,429 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:22:24,431 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:22:24,432 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:22:24,433 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:22:24,434 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:22:24,434 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:22:24,436 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:22:24,439 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:22:24,439 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:22:24,441 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:22:24,441 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:22:24,441 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:22:24,442 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:22:24,443 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:22:24,443 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:22:24,474 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:22:24,474 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:22:24,477 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:22:24,477 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:22:24,477 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:22:24,478 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:22:24,478 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:22:24,478 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:22:24,478 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:22:24,478 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:22:24,479 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:22:24,479 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:22:24,479 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:22:24,479 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:22:24,480 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:22:24,480 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:22:24,480 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:22:24,480 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:22:24,480 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:22:24,480 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:22:24,481 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:22:24,481 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:22:24,481 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:22:24,481 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:22:24,481 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:22:24,481 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:22:24,482 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:22:24,483 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:22:24,483 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:22:24,483 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:22:24,483 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:22:24,484 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:22:24,485 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 -> d64d9b1029a36f4dbed006d1e1d8543a0c6e0731 [2019-01-14 04:22:24,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:22:24,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:22:24,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:22:24,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:22:24,545 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:22:24,546 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec3_product19_false-unreach-call_false-termination.cil.c [2019-01-14 04:22:24,613 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e67825f8/6df69ee4437f4b34986c279947010519/FLAG49cc96d20 [2019-01-14 04:22:25,205 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:22:25,205 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec3_product19_false-unreach-call_false-termination.cil.c [2019-01-14 04:22:25,233 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e67825f8/6df69ee4437f4b34986c279947010519/FLAG49cc96d20 [2019-01-14 04:22:25,448 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e67825f8/6df69ee4437f4b34986c279947010519 [2019-01-14 04:22:25,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:22:25,454 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:22:25,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:22:25,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:22:25,461 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:22:25,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:22:25" (1/1) ... [2019-01-14 04:22:25,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c2ce30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:25, skipping insertion in model container [2019-01-14 04:22:25,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:22:25" (1/1) ... [2019-01-14 04:22:25,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:22:25,532 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:22:25,849 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:22:25,879 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:22:26,085 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:22:26,127 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:22:26,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:26 WrapperNode [2019-01-14 04:22:26,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:22:26,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:22:26,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:22:26,129 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:22:26,139 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:22:26" (1/1) ... [2019-01-14 04:22:26,157 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:22:26" (1/1) ... [2019-01-14 04:22:26,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:22:26,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:22:26,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:22:26,199 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:22:26,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:26" (1/1) ... [2019-01-14 04:22:26,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:26" (1/1) ... [2019-01-14 04:22:26,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:26" (1/1) ... [2019-01-14 04:22:26,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:26" (1/1) ... [2019-01-14 04:22:26,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:26" (1/1) ... [2019-01-14 04:22:26,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:26" (1/1) ... [2019-01-14 04:22:26,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:26" (1/1) ... [2019-01-14 04:22:26,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:22:26,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:22:26,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:22:26,245 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:22:26,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:26" (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:22:26,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:22:26,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:22:26,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:22:26,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:22:27,568 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:22:27,569 INFO L286 CfgBuilder]: Removed 106 assue(true) statements. [2019-01-14 04:22:27,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:22:27 BoogieIcfgContainer [2019-01-14 04:22:27,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:22:27,571 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:22:27,571 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:22:27,576 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:22:27,577 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:22:27,577 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:22:25" (1/3) ... [2019-01-14 04:22:27,578 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e39864a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:22:27, skipping insertion in model container [2019-01-14 04:22:27,578 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:22:27,579 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:26" (2/3) ... [2019-01-14 04:22:27,580 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e39864a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:22:27, skipping insertion in model container [2019-01-14 04:22:27,580 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:22:27,580 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:22:27" (3/3) ... [2019-01-14 04:22:27,583 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product19_false-unreach-call_false-termination.cil.c [2019-01-14 04:22:27,640 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:22:27,641 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:22:27,641 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:22:27,641 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:22:27,642 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:22:27,642 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:22:27,642 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:22:27,642 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:22:27,642 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:22:27,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states. [2019-01-14 04:22:27,693 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-01-14 04:22:27,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:22:27,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:22:27,704 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:22:27,704 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:22:27,704 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:22:27,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states. [2019-01-14 04:22:27,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-01-14 04:22:27,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:22:27,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:22:27,712 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:22:27,712 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:22:27,719 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);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(25);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(13);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string43.base, #t~string43.offset, 1);call write~init~int(77, #t~string43.base, 1 + #t~string43.offset, 1);call write~init~int(101, #t~string43.base, 2 + #t~string43.offset, 1);call write~init~int(116, #t~string43.base, 3 + #t~string43.offset, 1);call write~init~int(104, #t~string43.base, 4 + #t~string43.offset, 1);call write~init~int(58, #t~string43.base, 5 + #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 6 + #t~string43.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string45.base, #t~string45.offset, 1);call write~init~int(82, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(73, #t~string45.base, 2 + #t~string45.offset, 1);call write~init~int(84, #t~string45.base, 3 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 4 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string47.base, #t~string47.offset, 1);call write~init~int(75, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 2 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string49.base, #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 1 + #t~string49.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(13);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(80, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(117, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(109, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(112, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(110, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 3 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(32, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 10#L-1true havoc main_#res;havoc main_#t~ret39, main_~retValue_acc~5, main_~tmp~4;havoc main_~retValue_acc~5;havoc main_~tmp~4; 55#L74true 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; 50#L82true main_#t~ret39 := valid_product_#res;main_~tmp~4 := main_#t~ret39;havoc main_#t~ret39; 5#L577true assume 0 != main_~tmp~4; 32#L553true havoc test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_#t~nondet53, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 70#L105-1true [2019-01-14 04:22:27,719 INFO L796 eck$LassoCheckResult]: Loop: 70#L105-1true assume !false; 26#L695true assume test_~splverifierCounter~0 < 4; 47#L696true test_~tmp~5 := test_#t~nondet50;havoc test_#t~nondet50; 71#L704true assume !(0 != test_~tmp~5); 74#L704-1true test_~tmp___0~1 := test_#t~nondet51;havoc test_#t~nondet51; 54#L714true assume !(0 != test_~tmp___0~1); 33#L714-1true test_~tmp___2~0 := test_#t~nondet52;havoc test_#t~nondet52; 11#L724true assume 0 != test_~tmp___2~0; 62#L730-1true assume !(0 != ~pumpRunning~0); 3#L760true assume !(0 != ~systemActive~0); 9#L767true havoc __utac_acc__Specification3_spec__1_#t~ret1, __utac_acc__Specification3_spec__1_#t~ret2, __utac_acc__Specification3_spec__1_#t~ret3, __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~6;havoc isMethaneLevelCritical_~retValue_acc~6;isMethaneLevelCritical_~retValue_acc~6 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~6; 37#L637true __utac_acc__Specification3_spec__1_#t~ret1 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~0 := __utac_acc__Specification3_spec__1_#t~ret1;havoc __utac_acc__Specification3_spec__1_#t~ret1; 42#L99true assume 0 != __utac_acc__Specification3_spec__1_~tmp~0; 70#L105-1true [2019-01-14 04:22:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:27,726 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-14 04:22:27,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:27,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:27,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:27,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:27,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:28,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:28,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1673095042, now seen corresponding path program 1 times [2019-01-14 04:22:28,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:28,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:28,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:28,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:28,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:28,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:28,613 INFO L82 PathProgramCache]: Analyzing trace with hash 41183896, now seen corresponding path program 1 times [2019-01-14 04:22:28,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:28,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:28,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:28,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:28,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:22:28,976 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:22:28,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:22:28,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:22:29,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:22:29,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:22:29,155 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 6 states. [2019-01-14 04:22:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:22:29,420 INFO L93 Difference]: Finished difference Result 210 states and 291 transitions. [2019-01-14 04:22:29,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:22:29,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 291 transitions. [2019-01-14 04:22:29,447 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 133 [2019-01-14 04:22:29,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 189 states and 270 transitions. [2019-01-14 04:22:29,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 189 [2019-01-14 04:22:29,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2019-01-14 04:22:29,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 270 transitions. [2019-01-14 04:22:29,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:22:29,474 INFO L706 BuchiCegarLoop]: Abstraction has 189 states and 270 transitions. [2019-01-14 04:22:29,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 270 transitions. [2019-01-14 04:22:29,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 120. [2019-01-14 04:22:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-14 04:22:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 171 transitions. [2019-01-14 04:22:29,545 INFO L729 BuchiCegarLoop]: Abstraction has 120 states and 171 transitions. [2019-01-14 04:22:29,546 INFO L609 BuchiCegarLoop]: Abstraction has 120 states and 171 transitions. [2019-01-14 04:22:29,546 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:22:29,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 171 transitions. [2019-01-14 04:22:29,552 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 84 [2019-01-14 04:22:29,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:22:29,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:22:29,558 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:22:29,558 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:22:29,559 INFO L794 eck$LassoCheckResult]: Stem: 355#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);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(25);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(13);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string43.base, #t~string43.offset, 1);call write~init~int(77, #t~string43.base, 1 + #t~string43.offset, 1);call write~init~int(101, #t~string43.base, 2 + #t~string43.offset, 1);call write~init~int(116, #t~string43.base, 3 + #t~string43.offset, 1);call write~init~int(104, #t~string43.base, 4 + #t~string43.offset, 1);call write~init~int(58, #t~string43.base, 5 + #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 6 + #t~string43.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string45.base, #t~string45.offset, 1);call write~init~int(82, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(73, #t~string45.base, 2 + #t~string45.offset, 1);call write~init~int(84, #t~string45.base, 3 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 4 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string47.base, #t~string47.offset, 1);call write~init~int(75, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 2 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string49.base, #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 1 + #t~string49.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(13);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(80, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(117, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(109, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(112, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(110, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 3 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(32, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 320#L-1 havoc main_#res;havoc main_#t~ret39, main_~retValue_acc~5, main_~tmp~4;havoc main_~retValue_acc~5;havoc main_~tmp~4; 321#L74 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; 370#L82 main_#t~ret39 := valid_product_#res;main_~tmp~4 := main_#t~ret39;havoc main_#t~ret39; 313#L577 assume 0 != main_~tmp~4; 314#L553 havoc test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_#t~nondet53, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 334#L105-1 [2019-01-14 04:22:29,559 INFO L796 eck$LassoCheckResult]: Loop: 334#L105-1 assume !false; 345#L695 assume test_~splverifierCounter~0 < 4; 346#L696 test_~tmp~5 := test_#t~nondet50;havoc test_#t~nondet50; 367#L704 assume !(0 != test_~tmp~5); 363#L704-1 test_~tmp___0~1 := test_#t~nondet51;havoc test_#t~nondet51; 372#L714 assume !(0 != test_~tmp___0~1); 354#L714-1 test_~tmp___2~0 := test_#t~nondet52;havoc test_#t~nondet52; 322#L724 assume 0 != test_~tmp___2~0; 323#L730-1 assume !(0 != ~pumpRunning~0); 308#L760 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret54, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 309#L792 assume !(0 != ~pumpRunning~0); 318#L767 havoc __utac_acc__Specification3_spec__1_#t~ret1, __utac_acc__Specification3_spec__1_#t~ret2, __utac_acc__Specification3_spec__1_#t~ret3, __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~6;havoc isMethaneLevelCritical_~retValue_acc~6;isMethaneLevelCritical_~retValue_acc~6 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~6; 319#L637 __utac_acc__Specification3_spec__1_#t~ret1 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~0 := __utac_acc__Specification3_spec__1_#t~ret1;havoc __utac_acc__Specification3_spec__1_#t~ret1; 356#L99 assume 0 != __utac_acc__Specification3_spec__1_~tmp~0; 334#L105-1 [2019-01-14 04:22:29,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:29,560 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-14 04:22:29,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:29,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:29,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:29,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:29,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:29,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:29,955 INFO L82 PathProgramCache]: Analyzing trace with hash -353331282, now seen corresponding path program 1 times [2019-01-14 04:22:29,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:29,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:29,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:29,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:22:29,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:29,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:29,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1249708244, now seen corresponding path program 1 times [2019-01-14 04:22:29,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:29,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:29,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:29,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:29,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:22:30,124 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:22:30,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:22:30,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:22:30,336 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 04:22:30,666 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 04:22:30,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:22:30,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:22:30,679 INFO L87 Difference]: Start difference. First operand 120 states and 171 transitions. cyclomatic complexity: 54 Second operand 5 states. [2019-01-14 04:22:31,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:22:31,350 INFO L93 Difference]: Finished difference Result 397 states and 578 transitions. [2019-01-14 04:22:31,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 04:22:31,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 397 states and 578 transitions. [2019-01-14 04:22:31,361 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 294 [2019-01-14 04:22:31,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 397 states to 397 states and 578 transitions. [2019-01-14 04:22:31,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 397 [2019-01-14 04:22:31,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 397 [2019-01-14 04:22:31,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 397 states and 578 transitions. [2019-01-14 04:22:31,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:22:31,374 INFO L706 BuchiCegarLoop]: Abstraction has 397 states and 578 transitions. [2019-01-14 04:22:31,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states and 578 transitions. [2019-01-14 04:22:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 234. [2019-01-14 04:22:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-14 04:22:31,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 328 transitions. [2019-01-14 04:22:31,396 INFO L729 BuchiCegarLoop]: Abstraction has 234 states and 328 transitions. [2019-01-14 04:22:31,396 INFO L609 BuchiCegarLoop]: Abstraction has 234 states and 328 transitions. [2019-01-14 04:22:31,396 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:22:31,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 234 states and 328 transitions. [2019-01-14 04:22:31,399 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 168 [2019-01-14 04:22:31,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:22:31,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:22:31,401 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:22:31,401 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:22:31,401 INFO L794 eck$LassoCheckResult]: Stem: 893#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);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(25);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(13);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string43.base, #t~string43.offset, 1);call write~init~int(77, #t~string43.base, 1 + #t~string43.offset, 1);call write~init~int(101, #t~string43.base, 2 + #t~string43.offset, 1);call write~init~int(116, #t~string43.base, 3 + #t~string43.offset, 1);call write~init~int(104, #t~string43.base, 4 + #t~string43.offset, 1);call write~init~int(58, #t~string43.base, 5 + #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 6 + #t~string43.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string45.base, #t~string45.offset, 1);call write~init~int(82, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(73, #t~string45.base, 2 + #t~string45.offset, 1);call write~init~int(84, #t~string45.base, 3 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 4 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string47.base, #t~string47.offset, 1);call write~init~int(75, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 2 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string49.base, #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 1 + #t~string49.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(13);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(80, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(117, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(109, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(112, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(110, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 3 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(32, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 855#L-1 havoc main_#res;havoc main_#t~ret39, main_~retValue_acc~5, main_~tmp~4;havoc main_~retValue_acc~5;havoc main_~tmp~4; 856#L74 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; 916#L82 main_#t~ret39 := valid_product_#res;main_~tmp~4 := main_#t~ret39;havoc main_#t~ret39; 848#L577 assume 0 != main_~tmp~4; 849#L553 havoc test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_#t~nondet53, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 870#L105-1 [2019-01-14 04:22:31,401 INFO L796 eck$LassoCheckResult]: Loop: 870#L105-1 assume !false; 973#L695 assume test_~splverifierCounter~0 < 4; 911#L696 test_~tmp~5 := test_#t~nondet50;havoc test_#t~nondet50; 912#L704 assume !(0 != test_~tmp~5); 905#L704-1 test_~tmp___0~1 := test_#t~nondet51;havoc test_#t~nondet51; 918#L714 assume !(0 != test_~tmp___0~1); 892#L714-1 test_~tmp___2~0 := test_#t~nondet52;havoc test_#t~nondet52; 857#L724 assume 0 != test_~tmp___2~0; 858#L730-1 assume !(0 != ~pumpRunning~0); 843#L760 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret54, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 844#L792 assume !(0 != ~pumpRunning~0); 853#L767 havoc __utac_acc__Specification3_spec__1_#t~ret1, __utac_acc__Specification3_spec__1_#t~ret2, __utac_acc__Specification3_spec__1_#t~ret3, __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~6;havoc isMethaneLevelCritical_~retValue_acc~6;isMethaneLevelCritical_~retValue_acc~6 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~6; 854#L637 __utac_acc__Specification3_spec__1_#t~ret1 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~0 := __utac_acc__Specification3_spec__1_#t~ret1;havoc __utac_acc__Specification3_spec__1_#t~ret1; 902#L99 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~0);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 903#L669 __utac_acc__Specification3_spec__1_#t~ret2 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~0 := __utac_acc__Specification3_spec__1_#t~ret2;havoc __utac_acc__Specification3_spec__1_#t~ret2; 939#L105 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~0); 870#L105-1 [2019-01-14 04:22:31,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:31,406 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-14 04:22:31,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:31,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:31,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:31,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:31,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:31,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:31,776 INFO L82 PathProgramCache]: Analyzing trace with hash -248939424, now seen corresponding path program 1 times [2019-01-14 04:22:31,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:31,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:31,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:31,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:22:31,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:31,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:31,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1621214202, now seen corresponding path program 1 times [2019-01-14 04:22:31,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:31,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:31,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:31,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:31,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:32,570 WARN L181 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 04:22:32,711 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 04:22:58,655 WARN L181 SmtUtils]: Spent 25.94 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-14 04:23:11,721 WARN L181 SmtUtils]: Spent 13.06 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-14 04:23:11,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:23:11 BoogieIcfgContainer [2019-01-14 04:23:11,798 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:23:11,798 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:23:11,798 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:23:11,799 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:23:11,799 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:22:27" (3/4) ... [2019-01-14 04:23:11,806 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:23:11,897 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:23:11,897 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:23:11,898 INFO L168 Benchmark]: Toolchain (without parser) took 46445.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.9 MB). Free memory was 951.4 MB in the beginning and 913.8 MB in the end (delta: 37.5 MB). Peak memory consumption was 369.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:11,899 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:23:11,899 INFO L168 Benchmark]: CACSL2BoogieTranslator took 673.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:11,900 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:11,902 INFO L168 Benchmark]: Boogie Preprocessor took 45.93 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:23:11,903 INFO L168 Benchmark]: RCFGBuilder took 1326.33 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:11,903 INFO L168 Benchmark]: BuchiAutomizer took 44226.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 925.2 MB in the end (delta: 159.0 MB). Peak memory consumption was 412.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:11,905 INFO L168 Benchmark]: Witness Printer took 98.83 ms. Allocated memory is still 1.4 GB. Free memory was 925.2 MB in the beginning and 913.8 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:11,911 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 673.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.93 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 1326.33 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 44226.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 925.2 MB in the end (delta: 159.0 MB). Peak memory consumption was 412.2 MB. Max. memory is 11.5 GB. * Witness Printer took 98.83 ms. Allocated memory is still 1.4 GB. Free memory was 925.2 MB in the beginning and 913.8 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 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 234 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 44.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 42.8s. Construction of modules took 0.5s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 232 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 234 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 255 SDtfs, 799 SDslu, 1021 SDs, 0 SdLazy, 85 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s 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: 694]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=4925} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@583a8c67=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@debb5e4=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d5d8c38=0, NULL=0, NULL=4925, NULL=-1, NULL=0, NULL=0, retValue_acc=0, NULL=0, NULL=-22, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c4b6933=0, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c3267fb=70, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@392cc78b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1202616e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@289d6d7a=0, NULL=0, NULL=0, tmp=0, NULL=-15, NULL=-8, NULL=0, tmp___1=0, NULL=4924, tmp___0=1, NULL=-11, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b83160a=0, tmp=0, cleanupTimeShifts=4, NULL=-4, NULL=-7, NULL=-5, NULL=-24, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, NULL=-23, \result=1, NULL=0, retValue_acc=0, NULL=0, NULL=-19, NULL=0, \result=1, head=0, pumpRunning=0, NULL=-14, NULL=-16, \result=0, tmp=1, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-17, NULL=-2, NULL=-9, NULL=-3, NULL=0, retValue_acc=1, retValue_acc=1, tmp___2=70, tmp___0=0, NULL=-10, splverifierCounter=0, NULL=0, \result=0, NULL=-20, tmp___1=0, head=0, NULL=0, NULL=-13, NULL=0, tmp=0, NULL=-12, NULL=-6, NULL=0, NULL=0, NULL=-18, NULL=-21} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L293] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L490] int cleanupTimeShifts = 4; [L594] int waterLevel = 1; [L595] int methaneLevelCritical = 0; [L753] int pumpRunning = 0; [L754] int systemActive = 1; [L568] int retValue_acc ; [L569] int tmp ; [L78] int retValue_acc ; [L81] retValue_acc = 1 [L82] return (retValue_acc); [L575] tmp = valid_product() [L577] COND TRUE \read(tmp) [L685] int splverifierCounter ; [L686] int tmp ; [L687] int tmp___0 ; [L688] int tmp___1 ; [L689] int tmp___2 ; [L692] splverifierCounter = 0 Loop: [L694] COND TRUE 1 [L696] COND TRUE splverifierCounter < 4 [L702] tmp = __VERIFIER_nondet_int() [L704] COND FALSE !(\read(tmp)) [L712] tmp___0 = __VERIFIER_nondet_int() [L714] COND FALSE !(\read(tmp___0)) [L722] tmp___2 = __VERIFIER_nondet_int() [L724] COND TRUE \read(tmp___2) [L760] COND FALSE !(\read(pumpRunning)) [L767] COND TRUE \read(systemActive) [L789] int tmp ; [L792] COND FALSE !(\read(pumpRunning)) [L91] int tmp ; [L92] int tmp___0 ; [L93] int tmp___1 ; [L633] int retValue_acc ; [L636] retValue_acc = methaneLevelCritical [L637] return (retValue_acc); [L97] tmp = isMethaneLevelCritical() [L99] COND FALSE !(\read(tmp)) [L665] int retValue_acc ; [L668] retValue_acc = waterLevel [L669] return (retValue_acc); [L103] tmp___0 = getWaterLevel() [L105] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...