./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec3_product31_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_product31_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 34d3cbbc8b4a786ebf9108ab9ac810ac8aab3a53 .................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:23:01,385 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:23:01,387 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:23:01,400 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:23:01,400 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:23:01,401 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:23:01,403 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:23:01,405 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:23:01,407 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:23:01,407 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:23:01,409 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:23:01,409 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:23:01,410 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:23:01,411 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:23:01,412 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:23:01,413 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:23:01,414 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:23:01,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:23:01,418 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:23:01,420 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:23:01,421 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:23:01,424 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:23:01,427 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:23:01,430 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:23:01,430 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:23:01,431 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:23:01,432 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:23:01,436 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:23:01,438 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:23:01,440 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:23:01,442 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:23:01,444 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:23:01,445 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:23:01,445 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:23:01,446 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:23:01,447 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:23:01,447 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:23:01,476 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:23:01,477 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:23:01,478 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:23:01,481 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:23:01,481 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:23:01,482 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:23:01,482 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:23:01,482 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:23:01,482 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:23:01,482 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:23:01,483 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:23:01,484 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:23:01,484 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:23:01,484 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:23:01,484 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:23:01,485 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:23:01,486 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:23:01,487 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:23:01,487 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:23:01,487 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:23:01,487 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:23:01,487 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:23:01,487 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:23:01,488 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:23:01,488 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:23:01,488 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:23:01,488 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:23:01,488 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:23:01,489 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:23:01,489 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:23:01,489 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:23:01,490 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:23:01,490 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 -> 34d3cbbc8b4a786ebf9108ab9ac810ac8aab3a53 [2019-01-14 04:23:01,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:23:01,550 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:23:01,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:23:01,558 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:23:01,559 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:23:01,559 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec3_product31_false-unreach-call_false-termination.cil.c [2019-01-14 04:23:01,628 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f8b90b0b/9a5c6d4aeca84be1a8ab1083b4ce63f1/FLAG3486ca39c [2019-01-14 04:23:02,093 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:23:02,094 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec3_product31_false-unreach-call_false-termination.cil.c [2019-01-14 04:23:02,106 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f8b90b0b/9a5c6d4aeca84be1a8ab1083b4ce63f1/FLAG3486ca39c [2019-01-14 04:23:02,412 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f8b90b0b/9a5c6d4aeca84be1a8ab1083b4ce63f1 [2019-01-14 04:23:02,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:23:02,419 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:23:02,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:23:02,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:23:02,424 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:23:02,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:23:02" (1/1) ... [2019-01-14 04:23:02,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13568bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:02, skipping insertion in model container [2019-01-14 04:23:02,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:23:02" (1/1) ... [2019-01-14 04:23:02,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:23:02,504 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:23:02,898 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:23:02,928 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:23:03,167 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:23:03,205 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:23:03,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:03 WrapperNode [2019-01-14 04:23:03,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:23:03,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:23:03,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:23:03,207 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:23:03,217 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:23:03" (1/1) ... [2019-01-14 04:23:03,237 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:23:03" (1/1) ... [2019-01-14 04:23:03,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:23:03,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:23:03,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:23:03,291 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:23:03,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:03" (1/1) ... [2019-01-14 04:23:03,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:03" (1/1) ... [2019-01-14 04:23:03,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:03" (1/1) ... [2019-01-14 04:23:03,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:03" (1/1) ... [2019-01-14 04:23:03,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:03" (1/1) ... [2019-01-14 04:23:03,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:03" (1/1) ... [2019-01-14 04:23:03,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:03" (1/1) ... [2019-01-14 04:23:03,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:23:03,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:23:03,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:23:03,351 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:23:03,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:03" (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:23:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:23:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:23:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:23:03,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:23:04,854 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:23:04,854 INFO L286 CfgBuilder]: Removed 166 assue(true) statements. [2019-01-14 04:23:04,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:23:04 BoogieIcfgContainer [2019-01-14 04:23:04,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:23:04,856 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:23:04,856 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:23:04,860 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:23:04,861 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:23:04,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:23:02" (1/3) ... [2019-01-14 04:23:04,863 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f20523e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:23:04, skipping insertion in model container [2019-01-14 04:23:04,863 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:23:04,863 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:03" (2/3) ... [2019-01-14 04:23:04,863 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f20523e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:23:04, skipping insertion in model container [2019-01-14 04:23:04,864 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:23:04,864 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:23:04" (3/3) ... [2019-01-14 04:23:04,865 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product31_false-unreach-call_false-termination.cil.c [2019-01-14 04:23:04,917 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:23:04,918 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:23:04,918 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:23:04,918 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:23:04,918 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:23:04,919 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:23:04,919 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:23:04,919 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:23:04,919 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:23:04,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states. [2019-01-14 04:23:04,967 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2019-01-14 04:23:04,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:23:04,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:23:04,976 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:23:04,976 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:23:04,976 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:23:04,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states. [2019-01-14 04:23:04,984 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2019-01-14 04:23:04,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:23:04,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:23:04,986 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:23:04,986 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:23:04,992 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(21);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(30);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(9);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(13);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(110, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 2 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 2 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 3 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string60.base, #t~string60.offset, 1);call write~init~int(80, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(117, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(109, #t~string60.base, 3 + #t~string60.offset, 1);call write~init~int(112, #t~string60.base, 4 + #t~string60.offset, 1);call write~init~int(58, #t~string60.base, 5 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 6 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string62.base, #t~string62.offset, 1);call write~init~int(110, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 2 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 3 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string66.base, #t~string66.offset, 1);call write~init~int(32, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 2 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1);~cleanupTimeShifts~0 := 4; 8#L-1true havoc main_#res;havoc main_#t~ret74, main_~retValue_acc~11, main_~tmp~9;havoc main_~retValue_acc~11;havoc main_~tmp~9; 3#L855true havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 27#L863true main_#t~ret74 := valid_product_#res;main_~tmp~9 := main_#t~ret74;havoc main_#t~ret74; 48#L950true assume 0 != main_~tmp~9; 98#L927true havoc test_#t~nondet45, test_#t~nondet46, test_#t~nondet47, test_#t~nondet48, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 6#L811-1true [2019-01-14 04:23:04,993 INFO L796 eck$LassoCheckResult]: Loop: 6#L811-1true assume !false; 94#L525true assume test_~splverifierCounter~0 < 4; 43#L526true test_~tmp~3 := test_#t~nondet45;havoc test_#t~nondet45; 63#L534true assume !(0 != test_~tmp~3); 65#L534-1true test_~tmp___0~0 := test_#t~nondet46;havoc test_#t~nondet46; 5#L544true assume !(0 != test_~tmp___0~0); 7#L544-1true test_~tmp___2~0 := test_#t~nondet47;havoc test_#t~nondet47; 41#L554true assume 0 != test_~tmp___2~0; 33#L560-1true assume !(0 != ~pumpRunning~0); 28#L593true assume !(0 != ~systemActive~0); 60#L600true havoc __utac_acc__Specification3_spec__1_#t~ret70, __utac_acc__Specification3_spec__1_#t~ret71, __utac_acc__Specification3_spec__1_#t~ret72, __utac_acc__Specification3_spec__1_~tmp~8, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~8;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;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; 112#L90-1true __utac_acc__Specification3_spec__1_#t~ret70 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~8 := __utac_acc__Specification3_spec__1_#t~ret70;havoc __utac_acc__Specification3_spec__1_#t~ret70; 31#L805true assume 0 != __utac_acc__Specification3_spec__1_~tmp~8; 6#L811-1true [2019-01-14 04:23:04,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:04,999 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-14 04:23:05,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:05,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:05,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:05,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:23:05,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:05,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:05,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1671709762, now seen corresponding path program 1 times [2019-01-14 04:23:05,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:05,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:05,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:05,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:23:05,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:05,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:05,898 INFO L82 PathProgramCache]: Analyzing trace with hash 42569176, now seen corresponding path program 1 times [2019-01-14 04:23:05,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:05,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:05,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:05,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:23:05,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:23:06,266 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:23:06,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:23:06,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:23:06,447 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 04:23:06,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:23:06,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:23:06,576 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 6 states. [2019-01-14 04:23:07,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:23:07,103 INFO L93 Difference]: Finished difference Result 270 states and 381 transitions. [2019-01-14 04:23:07,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:23:07,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 381 transitions. [2019-01-14 04:23:07,117 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 173 [2019-01-14 04:23:07,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 249 states and 360 transitions. [2019-01-14 04:23:07,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2019-01-14 04:23:07,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 249 [2019-01-14 04:23:07,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 249 states and 360 transitions. [2019-01-14 04:23:07,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:23:07,138 INFO L706 BuchiCegarLoop]: Abstraction has 249 states and 360 transitions. [2019-01-14 04:23:07,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states and 360 transitions. [2019-01-14 04:23:07,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 150. [2019-01-14 04:23:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-14 04:23:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 216 transitions. [2019-01-14 04:23:07,216 INFO L729 BuchiCegarLoop]: Abstraction has 150 states and 216 transitions. [2019-01-14 04:23:07,216 INFO L609 BuchiCegarLoop]: Abstraction has 150 states and 216 transitions. [2019-01-14 04:23:07,217 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:23:07,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 216 transitions. [2019-01-14 04:23:07,226 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 104 [2019-01-14 04:23:07,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:23:07,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:23:07,227 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:23:07,228 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:23:07,228 INFO L794 eck$LassoCheckResult]: Stem: 480#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(21);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(30);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(9);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(13);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(110, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 2 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 2 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 3 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string60.base, #t~string60.offset, 1);call write~init~int(80, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(117, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(109, #t~string60.base, 3 + #t~string60.offset, 1);call write~init~int(112, #t~string60.base, 4 + #t~string60.offset, 1);call write~init~int(58, #t~string60.base, 5 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 6 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string62.base, #t~string62.offset, 1);call write~init~int(110, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 2 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 3 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string66.base, #t~string66.offset, 1);call write~init~int(32, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 2 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1);~cleanupTimeShifts~0 := 4; 408#L-1 havoc main_#res;havoc main_#t~ret74, main_~retValue_acc~11, main_~tmp~9;havoc main_~retValue_acc~11;havoc main_~tmp~9; 398#L855 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 399#L863 main_#t~ret74 := valid_product_#res;main_~tmp~9 := main_#t~ret74;havoc main_#t~ret74; 446#L950 assume 0 != main_~tmp~9; 467#L927 havoc test_#t~nondet45, test_#t~nondet46, test_#t~nondet47, test_#t~nondet48, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 401#L811-1 [2019-01-14 04:23:07,228 INFO L796 eck$LassoCheckResult]: Loop: 401#L811-1 assume !false; 406#L525 assume test_~splverifierCounter~0 < 4; 462#L526 test_~tmp~3 := test_#t~nondet45;havoc test_#t~nondet45; 463#L534 assume !(0 != test_~tmp~3); 421#L534-1 test_~tmp___0~0 := test_#t~nondet46;havoc test_#t~nondet46; 403#L544 assume !(0 != test_~tmp___0~0); 404#L544-1 test_~tmp___2~0 := test_#t~nondet47;havoc test_#t~nondet47; 407#L554 assume 0 != test_~tmp___2~0; 453#L560-1 assume !(0 != ~pumpRunning~0); 447#L593 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret50, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 439#L651 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret49, processEnvironment__wrappee__methaneQuery_~tmp~4;havoc processEnvironment__wrappee__methaneQuery_~tmp~4; 441#L625-1 assume !(0 != ~pumpRunning~0); 410#L600 havoc __utac_acc__Specification3_spec__1_#t~ret70, __utac_acc__Specification3_spec__1_#t~ret71, __utac_acc__Specification3_spec__1_#t~ret72, __utac_acc__Specification3_spec__1_~tmp~8, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~8;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;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; 475#L90-1 __utac_acc__Specification3_spec__1_#t~ret70 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~8 := __utac_acc__Specification3_spec__1_#t~ret70;havoc __utac_acc__Specification3_spec__1_#t~ret70; 454#L805 assume 0 != __utac_acc__Specification3_spec__1_~tmp~8; 401#L811-1 [2019-01-14 04:23:07,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:07,229 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-14 04:23:07,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:07,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:07,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:07,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:23:07,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:07,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:07,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1950294320, now seen corresponding path program 1 times [2019-01-14 04:23:07,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:07,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:07,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:07,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:23:07,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:07,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:07,529 INFO L82 PathProgramCache]: Analyzing trace with hash 104912074, now seen corresponding path program 1 times [2019-01-14 04:23:07,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:07,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:07,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:07,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:23:07,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:23:07,628 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:23:07,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:23:07,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:23:07,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:23:07,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:23:07,732 INFO L87 Difference]: Start difference. First operand 150 states and 216 transitions. cyclomatic complexity: 69 Second operand 5 states. [2019-01-14 04:23:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:23:08,665 INFO L93 Difference]: Finished difference Result 511 states and 749 transitions. [2019-01-14 04:23:08,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 04:23:08,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 749 transitions. [2019-01-14 04:23:08,675 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 367 [2019-01-14 04:23:08,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 511 states and 749 transitions. [2019-01-14 04:23:08,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 511 [2019-01-14 04:23:08,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 511 [2019-01-14 04:23:08,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 511 states and 749 transitions. [2019-01-14 04:23:08,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:23:08,688 INFO L706 BuchiCegarLoop]: Abstraction has 511 states and 749 transitions. [2019-01-14 04:23:08,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states and 749 transitions. [2019-01-14 04:23:08,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 294. [2019-01-14 04:23:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-01-14 04:23:08,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 418 transitions. [2019-01-14 04:23:08,710 INFO L729 BuchiCegarLoop]: Abstraction has 294 states and 418 transitions. [2019-01-14 04:23:08,711 INFO L609 BuchiCegarLoop]: Abstraction has 294 states and 418 transitions. [2019-01-14 04:23:08,712 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:23:08,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 294 states and 418 transitions. [2019-01-14 04:23:08,715 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 208 [2019-01-14 04:23:08,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:23:08,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:23:08,717 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:23:08,717 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:23:08,717 INFO L794 eck$LassoCheckResult]: Stem: 1177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(21);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(30);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(9);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(13);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(110, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 2 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 2 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 3 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string60.base, #t~string60.offset, 1);call write~init~int(80, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(117, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(109, #t~string60.base, 3 + #t~string60.offset, 1);call write~init~int(112, #t~string60.base, 4 + #t~string60.offset, 1);call write~init~int(58, #t~string60.base, 5 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 6 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string62.base, #t~string62.offset, 1);call write~init~int(110, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 2 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 3 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string66.base, #t~string66.offset, 1);call write~init~int(32, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 2 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1);~cleanupTimeShifts~0 := 4; 1092#L-1 havoc main_#res;havoc main_#t~ret74, main_~retValue_acc~11, main_~tmp~9;havoc main_~retValue_acc~11;havoc main_~tmp~9; 1077#L855 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 1078#L863 main_#t~ret74 := valid_product_#res;main_~tmp~9 := main_#t~ret74;havoc main_#t~ret74; 1124#L950 assume 0 != main_~tmp~9; 1157#L927 havoc test_#t~nondet45, test_#t~nondet46, test_#t~nondet47, test_#t~nondet48, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1080#L811-1 [2019-01-14 04:23:08,717 INFO L796 eck$LassoCheckResult]: Loop: 1080#L811-1 assume !false; 1085#L525 assume test_~splverifierCounter~0 < 4; 1149#L526 test_~tmp~3 := test_#t~nondet45;havoc test_#t~nondet45; 1150#L534 assume !(0 != test_~tmp~3); 1101#L534-1 test_~tmp___0~0 := test_#t~nondet46;havoc test_#t~nondet46; 1082#L544 assume !(0 != test_~tmp___0~0); 1083#L544-1 test_~tmp___2~0 := test_#t~nondet47;havoc test_#t~nondet47; 1305#L554 assume 0 != test_~tmp___2~0; 1304#L560-1 assume !(0 != ~pumpRunning~0); 1272#L593 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret50, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 1271#L651 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret49, processEnvironment__wrappee__methaneQuery_~tmp~4;havoc processEnvironment__wrappee__methaneQuery_~tmp~4; 1161#L625-1 assume !(0 != ~pumpRunning~0); 1089#L600 havoc __utac_acc__Specification3_spec__1_#t~ret70, __utac_acc__Specification3_spec__1_#t~ret71, __utac_acc__Specification3_spec__1_#t~ret72, __utac_acc__Specification3_spec__1_~tmp~8, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~8;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;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; 1168#L90-1 __utac_acc__Specification3_spec__1_#t~ret70 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~8 := __utac_acc__Specification3_spec__1_#t~ret70;havoc __utac_acc__Specification3_spec__1_#t~ret70; 1132#L805 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~8);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; 1133#L122 __utac_acc__Specification3_spec__1_#t~ret71 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~2 := __utac_acc__Specification3_spec__1_#t~ret71;havoc __utac_acc__Specification3_spec__1_#t~ret71; 1079#L811 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~2); 1080#L811-1 [2019-01-14 04:23:08,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:08,718 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-14 04:23:08,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:08,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:08,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:08,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:23:08,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:09,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:09,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1627108098, now seen corresponding path program 1 times [2019-01-14 04:23:09,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:09,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:09,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:09,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:23:09,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:09,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:09,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2036262940, now seen corresponding path program 1 times [2019-01-14 04:23:09,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:09,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:09,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:09,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:23:09,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:09,873 WARN L181 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 04:23:10,059 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 04:23:30,724 WARN L181 SmtUtils]: Spent 20.64 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-14 04:23:44,250 WARN L181 SmtUtils]: Spent 13.52 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-14 04:23:44,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:23:44 BoogieIcfgContainer [2019-01-14 04:23:44,373 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:23:44,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:23:44,373 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:23:44,373 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:23:44,374 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:23:04" (3/4) ... [2019-01-14 04:23:44,385 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:23:44,510 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:23:44,511 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:23:44,512 INFO L168 Benchmark]: Toolchain (without parser) took 42094.32 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 285.7 MB). Free memory was 951.4 MB in the beginning and 857.7 MB in the end (delta: 93.6 MB). Peak memory consumption was 379.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:44,517 INFO L168 Benchmark]: CDTParser took 0.14 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:44,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 786.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:44,518 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:44,518 INFO L168 Benchmark]: Boogie Preprocessor took 59.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:23:44,519 INFO L168 Benchmark]: RCFGBuilder took 1505.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.0 MB). Peak memory consumption was 55.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:44,519 INFO L168 Benchmark]: BuchiAutomizer took 39516.36 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.0 GB in the beginning and 869.4 MB in the end (delta: 168.9 MB). Peak memory consumption was 423.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:44,522 INFO L168 Benchmark]: Witness Printer took 137.88 ms. Allocated memory is still 1.3 GB. Free memory was 869.4 MB in the beginning and 857.7 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:44,528 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.14 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 786.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1505.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.0 MB). Peak memory consumption was 55.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 39516.36 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.0 GB in the beginning and 869.4 MB in the end (delta: 168.9 MB). Peak memory consumption was 423.5 MB. Max. memory is 11.5 GB. * Witness Printer took 137.88 ms. Allocated memory is still 1.3 GB. Free memory was 869.4 MB in the beginning and 857.7 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 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 294 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 39.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 37.6s. Construction of modules took 1.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 316 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 294 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 365 SDtfs, 1154 SDslu, 1360 SDs, 0 SdLazy, 121 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s 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: 524]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1134} State at position 1 is {NULL=0, retValue_acc=0, NULL=0, NULL=0, NULL=-5, NULL=1134, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5db7be30=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23adc728=65, NULL=-3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@791012f5=0, NULL=0, NULL=-21, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2377f32e=0, NULL=0, NULL=-20, NULL=-9, methaneLevelCritical=0, NULL=-11, retValue_acc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1eae018=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75f8819f=0, tmp=0, NULL=-17, NULL=0, NULL=-23, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@225e57ff=0, NULL=-14, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@290a16bc=0, tmp___1=0, NULL=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ae10cbb=0, NULL=-7, NULL=-22, cleanupTimeShifts=4, NULL=-16, NULL=-10, tmp=0, tmp___0=1, NULL=0, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, NULL=0, NULL=0, NULL=-19, NULL=0, tmp___0=0, NULL=1133, NULL=0, NULL=0, retValue_acc=0, \result=1, retValue_acc=1, head=0, pumpRunning=0, \result=0, NULL=-24, NULL=0, NULL=-8, tmp___2=65, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@463d756f=0, NULL=-13, splverifierCounter=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, \result=0, NULL=-15, tmp___1=0, head=0, NULL=0, tmp=0, tmp=1, NULL=-12, NULL=0, NULL=0, NULL=-6, NULL=0, NULL=-18, NULL=-2, NULL=-4, tmp=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L314] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L585] int pumpRunning = 0; [L586] int systemActive = 1; [L868] int cleanupTimeShifts = 4; [L941] int retValue_acc ; [L942] int tmp ; [L859] int retValue_acc ; [L862] retValue_acc = 1 [L863] return (retValue_acc); [L948] tmp = valid_product() [L950] COND TRUE \read(tmp) [L515] int splverifierCounter ; [L516] int tmp ; [L517] int tmp___0 ; [L518] int tmp___1 ; [L519] int tmp___2 ; [L522] splverifierCounter = 0 Loop: [L524] COND TRUE 1 [L526] COND TRUE splverifierCounter < 4 [L532] tmp = __VERIFIER_nondet_int() [L534] COND FALSE !(\read(tmp)) [L542] tmp___0 = __VERIFIER_nondet_int() [L544] COND FALSE !(\read(tmp___0)) [L552] tmp___2 = __VERIFIER_nondet_int() [L554] COND TRUE \read(tmp___2) [L593] COND FALSE !(\read(pumpRunning)) [L600] COND TRUE \read(systemActive) [L648] int tmp ; [L651] COND FALSE !(\read(pumpRunning)) [L622] int tmp ; [L625] COND FALSE !(\read(pumpRunning)) [L797] int tmp ; [L798] int tmp___0 ; [L799] int tmp___1 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); [L803] tmp = isMethaneLevelCritical() [L805] COND FALSE !(\read(tmp)) [L118] int retValue_acc ; [L121] retValue_acc = waterLevel [L122] return (retValue_acc); [L809] tmp___0 = getWaterLevel() [L811] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...