./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product29_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec5_product29_true-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 631d408ab8d73cb8fd4951a002aee07700685b60 ............................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:50:56,386 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:50:56,387 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:50:56,402 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:50:56,402 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:50:56,403 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:50:56,405 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:50:56,406 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:50:56,408 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:50:56,409 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:50:56,410 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:50:56,410 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:50:56,411 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:50:56,412 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:50:56,413 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:50:56,414 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:50:56,415 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:50:56,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:50:56,418 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:50:56,420 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:50:56,421 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:50:56,422 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:50:56,425 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:50:56,425 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:50:56,425 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:50:56,426 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:50:56,427 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:50:56,428 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:50:56,429 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:50:56,430 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:50:56,430 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:50:56,431 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:50:56,431 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:50:56,432 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:50:56,433 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:50:56,433 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:50:56,434 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:50:56,462 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:50:56,463 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:50:56,464 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:50:56,464 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:50:56,464 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:50:56,464 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:50:56,465 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:50:56,466 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:50:56,466 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:50:56,466 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:50:56,466 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:50:56,466 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:50:56,466 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:50:56,467 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:50:56,467 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:50:56,467 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:50:56,467 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:50:56,467 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:50:56,467 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:50:56,469 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:50:56,469 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:50:56,470 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:50:56,470 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:50:56,470 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:50:56,470 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:50:56,470 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:50:56,471 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:50:56,471 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:50:56,471 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:50:56,471 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:50:56,471 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:50:56,474 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:50:56,475 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 -> 631d408ab8d73cb8fd4951a002aee07700685b60 [2019-01-01 23:50:56,529 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:50:56,542 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:50:56,548 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:50:56,551 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:50:56,552 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:50:56,553 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product29_true-unreach-call_false-termination.cil.c [2019-01-01 23:50:56,614 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877dbaf3e/8421e4d691c943c09e0bb5a48355c1da/FLAG650f577df [2019-01-01 23:50:57,178 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:50:57,178 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product29_true-unreach-call_false-termination.cil.c [2019-01-01 23:50:57,196 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877dbaf3e/8421e4d691c943c09e0bb5a48355c1da/FLAG650f577df [2019-01-01 23:50:57,414 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877dbaf3e/8421e4d691c943c09e0bb5a48355c1da [2019-01-01 23:50:57,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:50:57,419 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:50:57,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:50:57,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:50:57,425 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:50:57,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:50:57" (1/1) ... [2019-01-01 23:50:57,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3277d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:57, skipping insertion in model container [2019-01-01 23:50:57,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:50:57" (1/1) ... [2019-01-01 23:50:57,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:50:57,501 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:50:57,933 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:50:57,952 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:50:58,134 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:50:58,181 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:50:58,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:58 WrapperNode [2019-01-01 23:50:58,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:50:58,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:50:58,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:50:58,183 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:50:58,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:58" (1/1) ... [2019-01-01 23:50:58,217 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:58" (1/1) ... [2019-01-01 23:50:58,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:50:58,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:50:58,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:50:58,264 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:50:58,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:58" (1/1) ... [2019-01-01 23:50:58,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:58" (1/1) ... [2019-01-01 23:50:58,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:58" (1/1) ... [2019-01-01 23:50:58,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:58" (1/1) ... [2019-01-01 23:50:58,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:58" (1/1) ... [2019-01-01 23:50:58,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:58" (1/1) ... [2019-01-01 23:50:58,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:58" (1/1) ... [2019-01-01 23:50:58,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:50:58,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:50:58,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:50:58,312 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:50:58,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:50:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:50:58,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:50:58,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:50:58,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:50:59,633 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:50:59,633 INFO L280 CfgBuilder]: Removed 170 assue(true) statements. [2019-01-01 23:50:59,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:50:59 BoogieIcfgContainer [2019-01-01 23:50:59,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:50:59,635 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:50:59,635 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:50:59,638 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:50:59,639 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:50:59,640 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:50:57" (1/3) ... [2019-01-01 23:50:59,641 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4acc579d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:50:59, skipping insertion in model container [2019-01-01 23:50:59,641 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:50:59,641 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:58" (2/3) ... [2019-01-01 23:50:59,642 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4acc579d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:50:59, skipping insertion in model container [2019-01-01 23:50:59,642 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:50:59,642 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:50:59" (3/3) ... [2019-01-01 23:50:59,644 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product29_true-unreach-call_false-termination.cil.c [2019-01-01 23:50:59,704 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:50:59,705 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:50:59,705 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:50:59,705 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:50:59,705 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:50:59,706 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:50:59,706 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:50:59,706 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:50:59,706 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:50:59,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states. [2019-01-01 23:50:59,755 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2019-01-01 23:50:59,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:59,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:59,765 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:59,765 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:59,765 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:50:59,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states. [2019-01-01 23:50:59,773 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2019-01-01 23:50:59,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:59,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:59,775 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:59,775 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:59,782 INFO L794 eck$LassoCheckResult]: Stem: 75#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(13);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(110, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 2 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 3 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string23.base, #t~string23.offset, 1);call write~init~int(80, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(117, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(109, #t~string23.base, 3 + #t~string23.offset, 1);call write~init~int(112, #t~string23.base, 4 + #t~string23.offset, 1);call write~init~int(58, #t~string23.base, 5 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 6 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string25.base, #t~string25.offset, 1);call write~init~int(110, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 2 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(102, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(102, #t~string27.base, 2 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 3 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string29.base, #t~string29.offset, 1);call write~init~int(32, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 2 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string31.base, #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 1 + #t~string31.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(30);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(9);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(21);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(9);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(21);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(25);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0; 5#L-1true havoc main_#res;havoc main_#t~ret11, main_~retValue_acc~5, main_~tmp~0;havoc main_~retValue_acc~5;havoc main_~tmp~0; 8#L65true havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 4#L73true main_#t~ret11 := valid_product_#res;main_~tmp~0 := main_#t~ret11;havoc main_#t~ret11; 71#L270true assume 0 != main_~tmp~0; 107#L244true ~switchedOnBeforeTS~0 := 0; 109#L924true havoc test_#t~nondet33, test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, 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; 29#L945-1true [2019-01-01 23:50:59,782 INFO L796 eck$LassoCheckResult]: Loop: 29#L945-1true assume !false; 76#L498true assume test_~splverifierCounter~0 < 4; 21#L499true test_~tmp~5 := test_#t~nondet33;havoc test_#t~nondet33; 49#L507true assume !(0 != test_~tmp~5); 51#L507-1true test_~tmp___0~1 := test_#t~nondet34;havoc test_#t~nondet34; 92#L517true assume !(0 != test_~tmp___0~1); 79#L517-1true test_~tmp___2~0 := test_#t~nondet35;havoc test_#t~nondet35; 13#L527true assume 0 != test_~tmp___2~0; 108#L533-2true havoc __utac_acc__Specification5_spec__2_#t~ret72;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~7;havoc isPumpRunning_~retValue_acc~7;isPumpRunning_~retValue_acc~7 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~7; 59#L427true __utac_acc__Specification5_spec__2_#t~ret72 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret72;havoc __utac_acc__Specification5_spec__2_#t~ret72; 27#L934true assume !(0 != ~pumpRunning~0); 7#L299true assume !(0 != ~systemActive~0); 43#L306true havoc __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_#t~ret74, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~3;havoc getWaterLevel_~retValue_acc~3;getWaterLevel_~retValue_acc~3 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~3; 12#L169true __utac_acc__Specification5_spec__3_#t~ret73 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret73;havoc __utac_acc__Specification5_spec__3_#t~ret73; 26#L945true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~9); 29#L945-1true [2019-01-01 23:50:59,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:59,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-01 23:50:59,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:59,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:59,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:59,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:59,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:00,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:00,664 INFO L82 PathProgramCache]: Analyzing trace with hash 95582188, now seen corresponding path program 1 times [2019-01-01 23:51:00,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:00,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:00,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:00,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:00,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:00,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:00,684 INFO L82 PathProgramCache]: Analyzing trace with hash 2029607398, now seen corresponding path program 1 times [2019-01-01 23:51:00,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:00,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:00,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:00,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:00,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:51:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:51:00,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:51:00,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:51:01,107 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 23:51:01,343 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 23:51:01,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:51:01,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:51:01,386 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 6 states. [2019-01-01 23:51:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:51:01,727 INFO L93 Difference]: Finished difference Result 111 states and 154 transitions. [2019-01-01 23:51:01,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 23:51:01,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 154 transitions. [2019-01-01 23:51:01,736 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2019-01-01 23:51:01,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 104 states and 147 transitions. [2019-01-01 23:51:01,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2019-01-01 23:51:01,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2019-01-01 23:51:01,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 147 transitions. [2019-01-01 23:51:01,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:51:01,749 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 147 transitions. [2019-01-01 23:51:01,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 147 transitions. [2019-01-01 23:51:01,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-01 23:51:01,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 23:51:01,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2019-01-01 23:51:01,793 INFO L728 BuchiCegarLoop]: Abstraction has 104 states and 147 transitions. [2019-01-01 23:51:01,794 INFO L608 BuchiCegarLoop]: Abstraction has 104 states and 147 transitions. [2019-01-01 23:51:01,794 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:51:01,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 147 transitions. [2019-01-01 23:51:01,797 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2019-01-01 23:51:01,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:01,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:01,799 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:01,800 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:01,800 INFO L794 eck$LassoCheckResult]: Stem: 333#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(13);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(110, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 2 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 3 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string23.base, #t~string23.offset, 1);call write~init~int(80, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(117, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(109, #t~string23.base, 3 + #t~string23.offset, 1);call write~init~int(112, #t~string23.base, 4 + #t~string23.offset, 1);call write~init~int(58, #t~string23.base, 5 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 6 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string25.base, #t~string25.offset, 1);call write~init~int(110, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 2 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(102, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(102, #t~string27.base, 2 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 3 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string29.base, #t~string29.offset, 1);call write~init~int(32, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 2 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string31.base, #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 1 + #t~string31.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(30);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(9);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(21);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(9);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(21);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(25);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0; 244#L-1 havoc main_#res;havoc main_#t~ret11, main_~retValue_acc~5, main_~tmp~0;havoc main_~retValue_acc~5;havoc main_~tmp~0; 245#L65 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 242#L73 main_#t~ret11 := valid_product_#res;main_~tmp~0 := main_#t~ret11;havoc main_#t~ret11; 243#L270 assume 0 != main_~tmp~0; 329#L244 ~switchedOnBeforeTS~0 := 0; 343#L924 havoc test_#t~nondet33, test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, 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; 279#L945-1 [2019-01-01 23:51:01,800 INFO L796 eck$LassoCheckResult]: Loop: 279#L945-1 assume !false; 284#L498 assume test_~splverifierCounter~0 < 4; 270#L499 test_~tmp~5 := test_#t~nondet33;havoc test_#t~nondet33; 271#L507 assume !(0 != test_~tmp~5); 306#L507-1 test_~tmp___0~1 := test_#t~nondet34;havoc test_#t~nondet34; 307#L517 assume !(0 != test_~tmp___0~1); 315#L517-1 test_~tmp___2~0 := test_#t~nondet35;havoc test_#t~nondet35; 258#L527 assume 0 != test_~tmp___2~0; 241#L533-2 havoc __utac_acc__Specification5_spec__2_#t~ret72;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~7;havoc isPumpRunning_~retValue_acc~7;isPumpRunning_~retValue_acc~7 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~7; 319#L427 __utac_acc__Specification5_spec__2_#t~ret72 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret72;havoc __utac_acc__Specification5_spec__2_#t~ret72; 280#L934 assume !(0 != ~pumpRunning~0); 248#L299 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret13, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 249#L357 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret12, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 290#L331-1 assume !(0 != ~pumpRunning~0); 289#L306 havoc __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_#t~ret74, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~3;havoc getWaterLevel_~retValue_acc~3;getWaterLevel_~retValue_acc~3 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~3; 256#L169 __utac_acc__Specification5_spec__3_#t~ret73 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret73;havoc __utac_acc__Specification5_spec__3_#t~ret73; 257#L945 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~9); 279#L945-1 [2019-01-01 23:51:01,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:01,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-01 23:51:01,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:01,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:01,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:01,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:01,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:02,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:02,169 INFO L82 PathProgramCache]: Analyzing trace with hash -489209282, now seen corresponding path program 1 times [2019-01-01 23:51:02,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:02,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:02,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:02,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:51:02,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:02,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:02,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1611821640, now seen corresponding path program 1 times [2019-01-01 23:51:02,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:02,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:02,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:02,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:02,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:51:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:51:02,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:51:02,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:51:02,753 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 23:51:02,942 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 23:51:02,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:51:02,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:51:02,958 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. cyclomatic complexity: 45 Second operand 5 states. [2019-01-01 23:51:03,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:51:03,952 INFO L93 Difference]: Finished difference Result 320 states and 453 transitions. [2019-01-01 23:51:03,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:51:03,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 320 states and 453 transitions. [2019-01-01 23:51:03,970 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 135 [2019-01-01 23:51:03,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 320 states to 320 states and 453 transitions. [2019-01-01 23:51:03,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 320 [2019-01-01 23:51:03,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 320 [2019-01-01 23:51:03,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 320 states and 453 transitions. [2019-01-01 23:51:03,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:51:03,993 INFO L705 BuchiCegarLoop]: Abstraction has 320 states and 453 transitions. [2019-01-01 23:51:03,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states and 453 transitions. [2019-01-01 23:51:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 201. [2019-01-01 23:51:04,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-01 23:51:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 280 transitions. [2019-01-01 23:51:04,030 INFO L728 BuchiCegarLoop]: Abstraction has 201 states and 280 transitions. [2019-01-01 23:51:04,031 INFO L608 BuchiCegarLoop]: Abstraction has 201 states and 280 transitions. [2019-01-01 23:51:04,031 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:51:04,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 280 transitions. [2019-01-01 23:51:04,037 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 135 [2019-01-01 23:51:04,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:04,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:04,038 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:04,039 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:04,039 INFO L794 eck$LassoCheckResult]: Stem: 784#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(13);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(110, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 2 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 3 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string23.base, #t~string23.offset, 1);call write~init~int(80, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(117, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(109, #t~string23.base, 3 + #t~string23.offset, 1);call write~init~int(112, #t~string23.base, 4 + #t~string23.offset, 1);call write~init~int(58, #t~string23.base, 5 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 6 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string25.base, #t~string25.offset, 1);call write~init~int(110, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 2 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(102, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(102, #t~string27.base, 2 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 3 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string29.base, #t~string29.offset, 1);call write~init~int(32, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 2 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string31.base, #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 1 + #t~string31.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(30);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(9);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(21);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(9);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(21);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(25);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0; 684#L-1 havoc main_#res;havoc main_#t~ret11, main_~retValue_acc~5, main_~tmp~0;havoc main_~retValue_acc~5;havoc main_~tmp~0; 685#L65 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 682#L73 main_#t~ret11 := valid_product_#res;main_~tmp~0 := main_#t~ret11;havoc main_#t~ret11; 683#L270 assume 0 != main_~tmp~0; 779#L244 ~switchedOnBeforeTS~0 := 0; 802#L924 havoc test_#t~nondet33, test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, 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; 726#L945-1 [2019-01-01 23:51:04,039 INFO L796 eck$LassoCheckResult]: Loop: 726#L945-1 assume !false; 727#L498 assume test_~splverifierCounter~0 < 4; 785#L499 test_~tmp~5 := test_#t~nondet33;havoc test_#t~nondet33; 874#L507 assume !(0 != test_~tmp~5); 873#L507-1 test_~tmp___0~1 := test_#t~nondet34;havoc test_#t~nondet34; 872#L517 assume !(0 != test_~tmp___0~1); 869#L517-1 test_~tmp___2~0 := test_#t~nondet35;havoc test_#t~nondet35; 867#L527 assume 0 != test_~tmp___2~0; 864#L533-2 havoc __utac_acc__Specification5_spec__2_#t~ret72;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~7;havoc isPumpRunning_~retValue_acc~7;isPumpRunning_~retValue_acc~7 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~7; 863#L427 __utac_acc__Specification5_spec__2_#t~ret72 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret72;havoc __utac_acc__Specification5_spec__2_#t~ret72; 862#L934 assume !(0 != ~pumpRunning~0); 861#L299 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret13, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 859#L357 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret12, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 855#L331-1 assume !(0 != ~pumpRunning~0); 852#L306 havoc __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_#t~ret74, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~3;havoc getWaterLevel_~retValue_acc~3;getWaterLevel_~retValue_acc~3 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~3; 851#L169 __utac_acc__Specification5_spec__3_#t~ret73 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret73;havoc __utac_acc__Specification5_spec__3_#t~ret73; 720#L945 assume 2 != __utac_acc__Specification5_spec__3_~tmp~9;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~7;havoc isPumpRunning_~retValue_acc~7;isPumpRunning_~retValue_acc~7 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~7; 721#L427-1 __utac_acc__Specification5_spec__3_#t~ret74 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~2 := __utac_acc__Specification5_spec__3_#t~ret74;havoc __utac_acc__Specification5_spec__3_#t~ret74; 772#L949 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~2); 726#L945-1 [2019-01-01 23:51:04,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:04,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-01 23:51:04,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:04,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:04,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:04,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:04,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:04,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:04,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1978697447, now seen corresponding path program 1 times [2019-01-01 23:51:04,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:04,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:04,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:04,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:51:04,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:04,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:04,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1522585107, now seen corresponding path program 1 times [2019-01-01 23:51:04,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:04,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:04,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:04,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:04,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:05,254 WARN L181 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-01-01 23:51:22,547 WARN L181 SmtUtils]: Spent 17.21 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-01 23:51:33,852 WARN L181 SmtUtils]: Spent 11.30 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-01 23:51:33,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:51:33 BoogieIcfgContainer [2019-01-01 23:51:33,925 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:51:33,926 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:51:33,926 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:51:33,926 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:51:33,927 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:50:59" (3/4) ... [2019-01-01 23:51:33,930 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:51:34,001 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:51:34,002 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:51:34,003 INFO L168 Benchmark]: Toolchain (without parser) took 36585.61 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.9 MB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -341.5 MB). Peak memory consumption was 2.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:34,004 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:51:34,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:34,009 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:34,011 INFO L168 Benchmark]: Boogie Preprocessor took 47.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:51:34,017 INFO L168 Benchmark]: RCFGBuilder took 1323.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:34,018 INFO L168 Benchmark]: BuchiAutomizer took 34290.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -223.1 MB). Peak memory consumption was 407.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:34,019 INFO L168 Benchmark]: Witness Printer took 76.62 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:34,026 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 762.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1323.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 34290.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -223.1 MB). Peak memory consumption was 407.4 MB. Max. memory is 11.5 GB. * Witness Printer took 76.62 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 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 201 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 32.5s. Construction of modules took 0.9s. 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, 119 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 201 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 390 SDtfs, 999 SDslu, 470 SDs, 0 SdLazy, 105 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s 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: 497]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {NULL=0, NULL=0, NULL=-11, NULL=-9, NULL=0, retValue_acc=0, NULL=0, NULL=-21, NULL=-2, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@310e0728=0, NULL=-1, tmp=1, NULL=0, NULL=0, tmp=0, NULL=0, NULL=0, NULL=-25, NULL=0, NULL=-4, tmp___1=0, NULL=-10, NULL=-13, NULL=0, NULL=0, NULL=0, NULL=0, cleanupTimeShifts=4, switchedOnBeforeTS=0, NULL=-5, NULL=-6, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ad3962=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e4e700f=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54d8a9cc=71, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79455b91=0, NULL=-17, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3784cc00=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, NULL=-14, \result=1, NULL=-22, NULL=0, NULL=-3, NULL=0, NULL=0, NULL=0, NULL=0, retValue_acc=1, NULL=-8, \result=1, head=0, pumpRunning=0, tmp___0=0, tmp=1, NULL=-15, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73bbefdf=0, NULL=-12, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18ccb07b=0, NULL=0, NULL=-16, NULL=0, NULL=-19, retValue_acc=1, tmp___2=71, tmp___0=0, splverifierCounter=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55e4a7f5=0, NULL=-7, NULL=-23, tmp=0, head=0, tmp=0, NULL=-18, NULL=-24, NULL=0, retValue_acc=0, NULL=-20, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20378200=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L94] int waterLevel = 1; [L95] int methaneLevelCritical = 0; [L183] int cleanupTimeShifts = 4; [L287] int pumpRunning = 0; [L288] int systemActive = 1; [L721] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L918] int switchedOnBeforeTS ; [L261] int retValue_acc ; [L262] int tmp ; [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); [L268] tmp = valid_product() [L270] COND TRUE \read(tmp) [L923] switchedOnBeforeTS = 0 [L488] int splverifierCounter ; [L489] int tmp ; [L490] int tmp___0 ; [L491] int tmp___1 ; [L492] int tmp___2 ; [L495] splverifierCounter = 0 Loop: [L497] COND TRUE 1 [L499] COND TRUE splverifierCounter < 4 [L505] tmp = __VERIFIER_nondet_int() [L507] COND FALSE !(\read(tmp)) [L515] tmp___0 = __VERIFIER_nondet_int() [L517] COND FALSE !(\read(tmp___0)) [L525] tmp___2 = __VERIFIER_nondet_int() [L527] COND TRUE \read(tmp___2) [L423] int retValue_acc ; [L426] retValue_acc = pumpRunning [L427] return (retValue_acc); [L932] switchedOnBeforeTS = isPumpRunning() [L299] COND FALSE !(\read(pumpRunning)) [L306] COND TRUE \read(systemActive) [L354] int tmp ; [L357] COND FALSE !(\read(pumpRunning)) [L328] int tmp ; [L331] COND FALSE !(\read(pumpRunning)) [L938] int tmp ; [L939] int tmp___0 ; [L165] int retValue_acc ; [L168] retValue_acc = waterLevel [L169] return (retValue_acc); [L943] tmp = getWaterLevel() [L945] COND TRUE tmp != 2 [L423] int retValue_acc ; [L426] retValue_acc = pumpRunning [L427] return (retValue_acc); [L947] tmp___0 = isPumpRunning() [L949] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...