./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec2_product43_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_spec2_product43_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 d3ef47dc64404f2fae365adb4fa9379fd10f9c50 ..................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:20:08,574 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:20:08,575 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:20:08,587 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:20:08,588 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:20:08,589 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:20:08,590 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:20:08,592 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:20:08,594 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:20:08,595 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:20:08,596 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:20:08,596 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:20:08,597 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:20:08,598 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:20:08,599 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:20:08,600 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:20:08,601 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:20:08,603 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:20:08,605 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:20:08,607 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:20:08,608 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:20:08,609 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:20:08,612 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:20:08,612 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:20:08,612 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:20:08,613 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:20:08,615 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:20:08,616 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:20:08,616 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:20:08,618 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:20:08,618 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:20:08,619 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:20:08,619 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:20:08,619 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:20:08,620 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:20:08,621 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:20:08,621 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:20:08,640 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:20:08,641 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:20:08,642 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:20:08,642 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:20:08,642 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:20:08,643 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:20:08,643 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:20:08,643 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:20:08,643 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:20:08,643 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:20:08,644 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:20:08,644 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:20:08,644 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:20:08,644 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:20:08,644 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:20:08,645 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:20:08,645 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:20:08,645 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:20:08,645 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:20:08,646 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:20:08,646 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:20:08,646 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:20:08,646 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:20:08,646 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:20:08,647 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:20:08,647 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:20:08,647 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:20:08,648 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:20:08,648 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:20:08,648 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:20:08,648 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:20:08,649 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:20:08,650 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 -> d3ef47dc64404f2fae365adb4fa9379fd10f9c50 [2019-01-14 04:20:08,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:20:08,702 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:20:08,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:20:08,710 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:20:08,711 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:20:08,712 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec2_product43_false-unreach-call_false-termination.cil.c [2019-01-14 04:20:08,776 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/140749cc2/12dbb70cb68f40da990a3db3a29d8ac9/FLAGc313379e5 [2019-01-14 04:20:09,281 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:20:09,282 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec2_product43_false-unreach-call_false-termination.cil.c [2019-01-14 04:20:09,302 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/140749cc2/12dbb70cb68f40da990a3db3a29d8ac9/FLAGc313379e5 [2019-01-14 04:20:09,598 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/140749cc2/12dbb70cb68f40da990a3db3a29d8ac9 [2019-01-14 04:20:09,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:20:09,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:20:09,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:20:09,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:20:09,614 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:20:09,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:20:09" (1/1) ... [2019-01-14 04:20:09,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44bde0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:09, skipping insertion in model container [2019-01-14 04:20:09,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:20:09" (1/1) ... [2019-01-14 04:20:09,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:20:09,692 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:20:10,007 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:20:10,023 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:20:10,237 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:20:10,281 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:20:10,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:10 WrapperNode [2019-01-14 04:20:10,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:20:10,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:20:10,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:20:10,283 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:20:10,291 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:20:10" (1/1) ... [2019-01-14 04:20:10,310 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:20:10" (1/1) ... [2019-01-14 04:20:10,353 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:20:10,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:20:10,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:20:10,354 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:20:10,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:10" (1/1) ... [2019-01-14 04:20:10,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:10" (1/1) ... [2019-01-14 04:20:10,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:10" (1/1) ... [2019-01-14 04:20:10,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:10" (1/1) ... [2019-01-14 04:20:10,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:10" (1/1) ... [2019-01-14 04:20:10,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:10" (1/1) ... [2019-01-14 04:20:10,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:10" (1/1) ... [2019-01-14 04:20:10,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:20:10,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:20:10,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:20:10,397 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:20:10,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:10" (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:20:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:20:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:20:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:20:10,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:20:11,679 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:20:11,680 INFO L286 CfgBuilder]: Removed 120 assue(true) statements. [2019-01-14 04:20:11,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:20:11 BoogieIcfgContainer [2019-01-14 04:20:11,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:20:11,682 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:20:11,682 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:20:11,686 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:20:11,687 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:20:11,687 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:20:09" (1/3) ... [2019-01-14 04:20:11,688 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@563b8e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:20:11, skipping insertion in model container [2019-01-14 04:20:11,689 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:20:11,689 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:10" (2/3) ... [2019-01-14 04:20:11,689 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@563b8e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:20:11, skipping insertion in model container [2019-01-14 04:20:11,690 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:20:11,690 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:20:11" (3/3) ... [2019-01-14 04:20:11,691 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec2_product43_false-unreach-call_false-termination.cil.c [2019-01-14 04:20:11,743 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:20:11,744 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:20:11,744 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:20:11,744 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:20:11,745 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:20:11,745 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:20:11,745 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:20:11,745 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:20:11,746 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:20:11,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states. [2019-01-14 04:20:11,794 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2019-01-14 04:20:11,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:20:11,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:20:11,803 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:20:11,803 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:20:11,803 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:20:11,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states. [2019-01-14 04:20:11,810 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2019-01-14 04:20:11,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:20:11,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:20:11,811 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:20:11,811 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:20:11,817 INFO L794 eck$LassoCheckResult]: Stem: 43#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);~cleanupTimeShifts~0 := 4;~methAndRunningLastTime~0 := 0;~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); 21#L-1true havoc main_#res;havoc main_#t~ret45, main_~retValue_acc~6, main_~tmp~3;havoc main_~retValue_acc~6;havoc main_~tmp~3; 31#L633true havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 57#L641true main_#t~ret45 := valid_product_#res;main_~tmp~3 := main_#t~ret45;havoc main_#t~ret45; 60#L597true assume 0 != main_~tmp~3; 53#L568true ~methAndRunningLastTime~0 := 0; 6#L654true havoc test_#t~nondet49, test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 9#L665-1true [2019-01-14 04:20:11,821 INFO L796 eck$LassoCheckResult]: Loop: 9#L665-1true assume !false; 47#L699true assume test_~splverifierCounter~0 < 4; 63#L700true test_~tmp~5 := test_#t~nondet49;havoc test_#t~nondet49; 66#L708true assume !(0 != test_~tmp~5); 69#L708-1true test_~tmp___0~1 := test_#t~nondet50;havoc test_#t~nondet50; 51#L718true assume !(0 != test_~tmp___0~1); 54#L718-1true test_~tmp___2~0 := test_#t~nondet51;havoc test_#t~nondet51; 34#L728true assume 0 != test_~tmp___2~0; 78#L734-1true assume !(0 != ~pumpRunning~0); 25#L764true assume !(0 != ~systemActive~0); 8#L771true havoc __utac_acc__Specification2_spec__2_#t~ret47, __utac_acc__Specification2_spec__2_#t~ret48, __utac_acc__Specification2_spec__2_~tmp~4, __utac_acc__Specification2_spec__2_~tmp___0~0;havoc __utac_acc__Specification2_spec__2_~tmp~4;havoc __utac_acc__Specification2_spec__2_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 90#L90-1true __utac_acc__Specification2_spec__2_#t~ret47 := isMethaneLevelCritical_#res;__utac_acc__Specification2_spec__2_~tmp~4 := __utac_acc__Specification2_spec__2_#t~ret47;havoc __utac_acc__Specification2_spec__2_#t~ret47; 4#L665true assume !(0 != __utac_acc__Specification2_spec__2_~tmp~4);~methAndRunningLastTime~0 := 0; 9#L665-1true [2019-01-14 04:20:11,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:20:11,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-14 04:20:11,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:20:11,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:20:11,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:11,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:20:11,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:12,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:20:12,618 INFO L82 PathProgramCache]: Analyzing trace with hash 11680531, now seen corresponding path program 1 times [2019-01-14 04:20:12,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:20:12,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:20:12,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:12,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:20:12,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:12,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:20:12,637 INFO L82 PathProgramCache]: Analyzing trace with hash 844977037, now seen corresponding path program 1 times [2019-01-14 04:20:12,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:20:12,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:20:12,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:12,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:20:12,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:20:12,912 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:20:12,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:20:12,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:20:13,096 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 04:20:13,238 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 04:20:13,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:20:13,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:20:13,268 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 6 states. [2019-01-14 04:20:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:20:13,709 INFO L93 Difference]: Finished difference Result 226 states and 319 transitions. [2019-01-14 04:20:13,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:20:13,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 319 transitions. [2019-01-14 04:20:13,723 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 143 [2019-01-14 04:20:13,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 205 states and 298 transitions. [2019-01-14 04:20:13,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 205 [2019-01-14 04:20:13,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 205 [2019-01-14 04:20:13,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 298 transitions. [2019-01-14 04:20:13,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:20:13,747 INFO L706 BuchiCegarLoop]: Abstraction has 205 states and 298 transitions. [2019-01-14 04:20:13,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 298 transitions. [2019-01-14 04:20:13,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 127. [2019-01-14 04:20:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-14 04:20:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 184 transitions. [2019-01-14 04:20:13,831 INFO L729 BuchiCegarLoop]: Abstraction has 127 states and 184 transitions. [2019-01-14 04:20:13,832 INFO L609 BuchiCegarLoop]: Abstraction has 127 states and 184 transitions. [2019-01-14 04:20:13,832 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:20:13,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 184 transitions. [2019-01-14 04:20:13,843 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 88 [2019-01-14 04:20:13,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:20:13,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:20:13,844 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:20:13,844 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:20:13,844 INFO L794 eck$LassoCheckResult]: Stem: 394#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);~cleanupTimeShifts~0 := 4;~methAndRunningLastTime~0 := 0;~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); 368#L-1 havoc main_#res;havoc main_#t~ret45, main_~retValue_acc~6, main_~tmp~3;havoc main_~retValue_acc~6;havoc main_~tmp~3; 369#L633 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 383#L641 main_#t~ret45 := valid_product_#res;main_~tmp~3 := main_#t~ret45;havoc main_#t~ret45; 404#L597 assume 0 != main_~tmp~3; 401#L568 ~methAndRunningLastTime~0 := 0; 342#L654 havoc test_#t~nondet49, test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 336#L665-1 [2019-01-14 04:20:13,851 INFO L796 eck$LassoCheckResult]: Loop: 336#L665-1 assume !false; 347#L699 assume test_~splverifierCounter~0 < 4; 397#L700 test_~tmp~5 := test_#t~nondet49;havoc test_#t~nondet49; 407#L708 assume !(0 != test_~tmp~5); 373#L708-1 test_~tmp___0~1 := test_#t~nondet50;havoc test_#t~nondet50; 399#L718 assume !(0 != test_~tmp___0~1); 396#L718-1 test_~tmp___2~0 := test_#t~nondet51;havoc test_#t~nondet51; 385#L728 assume 0 != test_~tmp___2~0; 387#L734-1 assume !(0 != ~pumpRunning~0); 374#L764 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret53, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 375#L796 assume !(0 == ~pumpRunning~0); 345#L771 havoc __utac_acc__Specification2_spec__2_#t~ret47, __utac_acc__Specification2_spec__2_#t~ret48, __utac_acc__Specification2_spec__2_~tmp~4, __utac_acc__Specification2_spec__2_~tmp___0~0;havoc __utac_acc__Specification2_spec__2_~tmp~4;havoc __utac_acc__Specification2_spec__2_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 346#L90-1 __utac_acc__Specification2_spec__2_#t~ret47 := isMethaneLevelCritical_#res;__utac_acc__Specification2_spec__2_~tmp~4 := __utac_acc__Specification2_spec__2_#t~ret47;havoc __utac_acc__Specification2_spec__2_#t~ret47; 334#L665 assume !(0 != __utac_acc__Specification2_spec__2_~tmp~4);~methAndRunningLastTime~0 := 0; 336#L665-1 [2019-01-14 04:20:13,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:20:13,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-14 04:20:13,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:20:13,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:20:13,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:13,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:20:13,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:14,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:20:14,252 INFO L82 PathProgramCache]: Analyzing trace with hash 320327041, now seen corresponding path program 1 times [2019-01-14 04:20:14,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:20:14,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:20:14,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:14,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:20:14,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:20:14,311 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:20:14,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:20:14,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:20:14,312 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:20:14,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:20:14,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:20:14,317 INFO L87 Difference]: Start difference. First operand 127 states and 184 transitions. cyclomatic complexity: 60 Second operand 3 states. [2019-01-14 04:20:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:20:14,617 INFO L93 Difference]: Finished difference Result 169 states and 233 transitions. [2019-01-14 04:20:14,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:20:14,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 233 transitions. [2019-01-14 04:20:14,624 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2019-01-14 04:20:14,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 169 states and 233 transitions. [2019-01-14 04:20:14,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2019-01-14 04:20:14,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2019-01-14 04:20:14,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 233 transitions. [2019-01-14 04:20:14,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:20:14,633 INFO L706 BuchiCegarLoop]: Abstraction has 169 states and 233 transitions. [2019-01-14 04:20:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 233 transitions. [2019-01-14 04:20:14,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-01-14 04:20:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-14 04:20:14,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 233 transitions. [2019-01-14 04:20:14,656 INFO L729 BuchiCegarLoop]: Abstraction has 169 states and 233 transitions. [2019-01-14 04:20:14,656 INFO L609 BuchiCegarLoop]: Abstraction has 169 states and 233 transitions. [2019-01-14 04:20:14,656 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:20:14,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 233 transitions. [2019-01-14 04:20:14,660 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2019-01-14 04:20:14,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:20:14,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:20:14,661 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:20:14,661 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:20:14,662 INFO L794 eck$LassoCheckResult]: Stem: 702#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);~cleanupTimeShifts~0 := 4;~methAndRunningLastTime~0 := 0;~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); 674#L-1 havoc main_#res;havoc main_#t~ret45, main_~retValue_acc~6, main_~tmp~3;havoc main_~retValue_acc~6;havoc main_~tmp~3; 675#L633 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 689#L641 main_#t~ret45 := valid_product_#res;main_~tmp~3 := main_#t~ret45;havoc main_#t~ret45; 718#L597 assume 0 != main_~tmp~3; 713#L568 ~methAndRunningLastTime~0 := 0; 646#L654 havoc test_#t~nondet49, test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 638#L665-1 [2019-01-14 04:20:14,663 INFO L796 eck$LassoCheckResult]: Loop: 638#L665-1 assume !false; 649#L699 assume test_~splverifierCounter~0 < 4; 721#L700 test_~tmp~5 := test_#t~nondet49;havoc test_#t~nondet49; 722#L708 assume !(0 != test_~tmp~5); 679#L708-1 test_~tmp___0~1 := test_#t~nondet50;havoc test_#t~nondet50; 711#L718 assume !(0 != test_~tmp___0~1); 705#L718-1 test_~tmp___2~0 := test_#t~nondet51;havoc test_#t~nondet51; 691#L728 assume 0 != test_~tmp___2~0; 693#L734-1 assume !(0 != ~pumpRunning~0); 680#L764 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret53, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 681#L796 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret72, isHighWaterLevel_~retValue_acc~11, isHighWaterLevel_~tmp~8, isHighWaterLevel_~tmp___0~2;havoc isHighWaterLevel_~retValue_acc~11;havoc isHighWaterLevel_~tmp~8;havoc isHighWaterLevel_~tmp___0~2;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 734#L130 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 657#L135 isHighWaterLevel_#t~ret72 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~8 := isHighWaterLevel_#t~ret72;havoc isHighWaterLevel_#t~ret72; 658#L916 assume 0 != isHighWaterLevel_~tmp~8;isHighWaterLevel_~tmp___0~2 := 0; 720#L916-2 isHighWaterLevel_~retValue_acc~11 := isHighWaterLevel_~tmp___0~2;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~11; 709#L922 processEnvironment_#t~ret53 := isHighWaterLevel_#res;processEnvironment_~tmp~6 := processEnvironment_#t~ret53;havoc processEnvironment_#t~ret53; 665#L800 assume !(0 != processEnvironment_~tmp~6); 647#L771 havoc __utac_acc__Specification2_spec__2_#t~ret47, __utac_acc__Specification2_spec__2_#t~ret48, __utac_acc__Specification2_spec__2_~tmp~4, __utac_acc__Specification2_spec__2_~tmp___0~0;havoc __utac_acc__Specification2_spec__2_~tmp~4;havoc __utac_acc__Specification2_spec__2_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 648#L90-1 __utac_acc__Specification2_spec__2_#t~ret47 := isMethaneLevelCritical_#res;__utac_acc__Specification2_spec__2_~tmp~4 := __utac_acc__Specification2_spec__2_#t~ret47;havoc __utac_acc__Specification2_spec__2_#t~ret47; 636#L665 assume !(0 != __utac_acc__Specification2_spec__2_~tmp~4);~methAndRunningLastTime~0 := 0; 638#L665-1 [2019-01-14 04:20:14,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:20:14,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-14 04:20:14,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:20:14,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:20:14,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:14,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:20:14,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:15,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:20:15,137 INFO L82 PathProgramCache]: Analyzing trace with hash 333870637, now seen corresponding path program 1 times [2019-01-14 04:20:15,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:20:15,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:20:15,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:15,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:20:15,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:15,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:20:15,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1499447411, now seen corresponding path program 1 times [2019-01-14 04:20:15,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:20:15,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:20:15,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:15,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:20:15,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:16,609 WARN L181 SmtUtils]: Spent 995.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-01-14 04:20:45,858 WARN L181 SmtUtils]: Spent 29.16 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-14 04:21:00,457 WARN L181 SmtUtils]: Spent 14.57 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-14 04:21:00,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:21:00 BoogieIcfgContainer [2019-01-14 04:21:00,565 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:21:00,566 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:21:00,566 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:21:00,566 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:21:00,568 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:20:11" (3/4) ... [2019-01-14 04:21:00,572 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:21:00,639 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:21:00,639 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:21:00,640 INFO L168 Benchmark]: Toolchain (without parser) took 51035.62 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 253.8 MB). Free memory was 952.7 MB in the beginning and 883.6 MB in the end (delta: 69.1 MB). Peak memory consumption was 322.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:00,642 INFO L168 Benchmark]: CDTParser took 1.09 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:21:00,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 674.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -112.1 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:00,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.07 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:21:00,644 INFO L168 Benchmark]: Boogie Preprocessor took 42.75 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:21:00,644 INFO L168 Benchmark]: RCFGBuilder took 1284.68 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: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:00,646 INFO L168 Benchmark]: BuchiAutomizer took 48883.63 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.0 GB in the beginning and 896.4 MB in the end (delta: 107.6 MB). Peak memory consumption was 422.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:00,647 INFO L168 Benchmark]: Witness Printer took 73.71 ms. Allocated memory is still 1.3 GB. Free memory was 896.4 MB in the beginning and 883.6 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:00,653 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09 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 674.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -112.1 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.07 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 42.75 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 1284.68 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: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 48883.63 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.0 GB in the beginning and 896.4 MB in the end (delta: 107.6 MB). Peak memory consumption was 422.3 MB. Max. memory is 11.5 GB. * Witness Printer took 73.71 ms. Allocated memory is still 1.3 GB. Free memory was 896.4 MB in the beginning and 883.6 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 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 169 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 48.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 47.7s. Construction of modules took 0.5s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 78 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 169 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 243 SDtfs, 571 SDslu, 674 SDs, 0 SdLazy, 64 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 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: 698]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26a3ea67=0, retValue_acc=0, NULL=-13, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1efab15a=0, NULL=-8, NULL=0, retValue_acc=0, NULL=-10, NULL=0, NULL=-18, NULL=-20, NULL=0, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6943510d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26edab68=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@374d949a=62, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3db130a9=0, NULL=-7, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59d4d97c=0, tmp___0=0, NULL=0, NULL=0, tmp=0, NULL=-25, NULL=-14, NULL=0, tmp___1=0, NULL=-4, NULL=-9, NULL=-6, cleanupTimeShifts=4, NULL=-15, NULL=-21, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2dd446b0=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72f39e19=0, systemActive=1, waterLevel=1, NULL=-11, NULL=0, NULL=0, NULL=0, \result=0, NULL=0, \result=1, head=0, pumpRunning=0, NULL=-12, \result=0, tmp=1, retValue_acc=1, NULL=0, \result=1, tmp___0=0, NULL=-26, NULL=-22, retValue_acc=1, NULL=0, retValue_acc=0, NULL=-3, tmp=1, tmp___2=62, NULL=-5, tmp___0=0, splverifierCounter=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, methAndRunningLastTime=0, \result=0, NULL=-2, NULL=-16, head=0, NULL=0, tmp=0, NULL=-19, NULL=0, NULL=0, NULL=-1, NULL=0, NULL=-17, tmp=0, NULL=-24} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L310] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L507] int cleanupTimeShifts = 4; [L648] int methAndRunningLastTime ; [L757] int pumpRunning = 0; [L758] int systemActive = 1; [L588] int retValue_acc ; [L589] int tmp ; [L637] int retValue_acc ; [L640] retValue_acc = 1 [L641] return (retValue_acc); [L595] tmp = valid_product() [L597] COND TRUE \read(tmp) [L653] methAndRunningLastTime = 0 [L689] int splverifierCounter ; [L690] int tmp ; [L691] int tmp___0 ; [L692] int tmp___1 ; [L693] int tmp___2 ; [L696] splverifierCounter = 0 Loop: [L698] COND TRUE 1 [L700] COND TRUE splverifierCounter < 4 [L706] tmp = __VERIFIER_nondet_int() [L708] COND FALSE !(\read(tmp)) [L716] tmp___0 = __VERIFIER_nondet_int() [L718] COND FALSE !(\read(tmp___0)) [L726] tmp___2 = __VERIFIER_nondet_int() [L728] COND TRUE \read(tmp___2) [L764] COND FALSE !(\read(pumpRunning)) [L771] COND TRUE \read(systemActive) [L793] int tmp ; [L796] COND TRUE ! pumpRunning [L908] int retValue_acc ; [L909] int tmp ; [L910] int tmp___0 ; [L127] int retValue_acc ; [L130] COND TRUE waterLevel < 2 [L131] retValue_acc = 1 [L132] return (retValue_acc); [L914] tmp = isHighWaterSensorDry() [L916] COND TRUE \read(tmp) [L917] tmp___0 = 0 [L921] retValue_acc = tmp___0 [L922] return (retValue_acc); [L798] tmp = isHighWaterLevel() [L800] COND FALSE !(\read(tmp)) [L658] int tmp ; [L659] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); [L663] tmp = isMethaneLevelCritical() [L665] COND FALSE !(\read(tmp)) [L681] methAndRunningLastTime = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...