./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product25_true-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_spec5_product25_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 28eabf23056233d68b7e553ed7896542bdaad81b .......................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:30:14,345 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:30:14,347 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:30:14,359 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:30:14,359 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:30:14,360 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:30:14,365 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:30:14,366 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:30:14,370 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:30:14,371 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:30:14,372 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:30:14,372 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:30:14,375 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:30:14,376 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:30:14,377 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:30:14,379 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:30:14,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:30:14,384 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:30:14,389 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:30:14,392 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:30:14,395 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:30:14,397 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:30:14,403 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:30:14,403 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:30:14,403 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:30:14,406 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:30:14,407 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:30:14,408 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:30:14,412 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:30:14,414 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:30:14,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:30:14,415 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:30:14,415 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:30:14,415 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:30:14,418 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:30:14,419 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:30:14,419 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:30:14,450 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:30:14,450 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:30:14,454 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:30:14,455 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:30:14,455 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:30:14,455 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:30:14,455 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:30:14,456 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:30:14,456 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:30:14,456 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:30:14,456 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:30:14,456 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:30:14,456 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:30:14,457 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:30:14,457 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:30:14,458 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:30:14,458 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:30:14,458 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:30:14,458 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:30:14,458 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:30:14,458 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:30:14,459 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:30:14,460 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:30:14,460 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:30:14,460 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:30:14,461 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:30:14,461 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:30:14,461 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:30:14,461 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:30:14,461 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:30:14,461 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:30:14,462 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:30:14,463 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 -> 28eabf23056233d68b7e553ed7896542bdaad81b [2019-01-14 04:30:14,524 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:30:14,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:30:14,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:30:14,549 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:30:14,549 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:30:14,550 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product25_true-unreach-call_false-termination.cil.c [2019-01-14 04:30:14,618 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731a5ac15/e0e6e15d9e3043b693d5d8479712757b/FLAG6437f38bf [2019-01-14 04:30:15,055 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:30:15,056 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product25_true-unreach-call_false-termination.cil.c [2019-01-14 04:30:15,069 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731a5ac15/e0e6e15d9e3043b693d5d8479712757b/FLAG6437f38bf [2019-01-14 04:30:15,374 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731a5ac15/e0e6e15d9e3043b693d5d8479712757b [2019-01-14 04:30:15,378 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:30:15,380 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:30:15,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:30:15,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:30:15,385 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:30:15,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:30:15" (1/1) ... [2019-01-14 04:30:15,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743af7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:15, skipping insertion in model container [2019-01-14 04:30:15,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:30:15" (1/1) ... [2019-01-14 04:30:15,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:30:15,473 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:30:15,905 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:30:15,936 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:30:16,119 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:30:16,164 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:30:16,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:16 WrapperNode [2019-01-14 04:30:16,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:30:16,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:30:16,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:30:16,166 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:30:16,175 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:30:16" (1/1) ... [2019-01-14 04:30:16,198 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:30:16" (1/1) ... [2019-01-14 04:30:16,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:30:16,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:30:16,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:30:16,239 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:30:16,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:16" (1/1) ... [2019-01-14 04:30:16,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:16" (1/1) ... [2019-01-14 04:30:16,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:16" (1/1) ... [2019-01-14 04:30:16,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:16" (1/1) ... [2019-01-14 04:30:16,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:16" (1/1) ... [2019-01-14 04:30:16,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:16" (1/1) ... [2019-01-14 04:30:16,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:16" (1/1) ... [2019-01-14 04:30:16,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:30:16,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:30:16,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:30:16,278 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:30:16,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:16" (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:30:16,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:30:16,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:30:16,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:30:16,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:30:17,453 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:30:17,454 INFO L286 CfgBuilder]: Removed 110 assue(true) statements. [2019-01-14 04:30:17,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:30:17 BoogieIcfgContainer [2019-01-14 04:30:17,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:30:17,456 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:30:17,456 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:30:17,459 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:30:17,460 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:30:17,460 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:30:15" (1/3) ... [2019-01-14 04:30:17,461 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14e65b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:30:17, skipping insertion in model container [2019-01-14 04:30:17,461 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:30:17,462 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:16" (2/3) ... [2019-01-14 04:30:17,462 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14e65b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:30:17, skipping insertion in model container [2019-01-14 04:30:17,462 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:30:17,462 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:30:17" (3/3) ... [2019-01-14 04:30:17,464 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product25_true-unreach-call_false-termination.cil.c [2019-01-14 04:30:17,515 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:30:17,516 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:30:17,516 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:30:17,516 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:30:17,516 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:30:17,517 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:30:17,517 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:30:17,517 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:30:17,517 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:30:17,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states. [2019-01-14 04:30:17,562 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-01-14 04:30:17,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:30:17,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:30:17,570 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:17,570 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:17,570 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:30:17,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states. [2019-01-14 04:30:17,577 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-01-14 04:30:17,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:30:17,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:30:17,578 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:17,578 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:17,583 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);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(110, #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(4);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 2 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 3 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string11.base, #t~string11.offset, 1);call write~init~int(80, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(117, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(109, #t~string11.base, 3 + #t~string11.offset, 1);call write~init~int(112, #t~string11.base, 4 + #t~string11.offset, 1);call write~init~int(58, #t~string11.base, 5 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 6 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(110, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 2 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 3 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string17.base, #t~string17.offset, 1);call write~init~int(32, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(13);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string29.base, #t~string29.offset, 1);call write~init~int(77, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(101, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(116, #t~string29.base, 3 + #t~string29.offset, 1);call write~init~int(104, #t~string29.base, 4 + #t~string29.offset, 1);call write~init~int(58, #t~string29.base, 5 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 6 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string31.base, #t~string31.offset, 1);call write~init~int(82, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(73, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(84, #t~string31.base, 3 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 4 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string33.base, #t~string33.offset, 1);call write~init~int(75, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string35.base, #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 1 + #t~string35.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0; 13#L-1true havoc main_#res;havoc main_#t~ret25, main_~retValue_acc~5, main_~tmp~4;havoc main_~retValue_acc~5;havoc main_~tmp~4; 17#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; 11#L73true main_#t~ret25 := valid_product_#res;main_~tmp~4 := main_#t~ret25;havoc main_#t~ret25; 77#L423true assume 0 != main_~tmp~4; 4#L398true ~switchedOnBeforeTS~0 := 0; 5#L899true havoc test_#t~nondet21, test_#t~nondet22, test_#t~nondet23, test_#t~nondet24, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 62#L920-1true [2019-01-14 04:30:17,584 INFO L796 eck$LassoCheckResult]: Loop: 62#L920-1true assume !false; 9#L285true assume test_~splverifierCounter~0 < 4; 22#L286true test_~tmp~3 := test_#t~nondet21;havoc test_#t~nondet21; 37#L294true assume !(0 != test_~tmp~3); 34#L294-1true test_~tmp___0~1 := test_#t~nondet22;havoc test_#t~nondet22; 29#L304true assume !(0 != test_~tmp___0~1); 30#L304-1true test_~tmp___2~0 := test_#t~nondet23;havoc test_#t~nondet23; 21#L314true assume 0 != test_~tmp___2~0; 50#L320-2true havoc __utac_acc__Specification5_spec__2_#t~ret71;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~3;havoc isPumpRunning_~retValue_acc~3;isPumpRunning_~retValue_acc~3 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~3; 69#L211true __utac_acc__Specification5_spec__2_#t~ret71 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret71;havoc __utac_acc__Specification5_spec__2_#t~ret71; 60#L909true assume !(0 != ~pumpRunning~0); 78#L108true assume !(0 != ~systemActive~0); 45#L115true havoc __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_~tmp~8, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~8;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 41#L513true __utac_acc__Specification5_spec__3_#t~ret72 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~8 := __utac_acc__Specification5_spec__3_#t~ret72;havoc __utac_acc__Specification5_spec__3_#t~ret72; 58#L920true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~8); 62#L920-1true [2019-01-14 04:30:17,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:17,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-14 04:30:17,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:17,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:17,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:17,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:17,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:18,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:18,574 INFO L82 PathProgramCache]: Analyzing trace with hash 94196908, now seen corresponding path program 1 times [2019-01-14 04:30:18,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:18,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:18,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:18,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:18,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:18,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:18,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2028222118, now seen corresponding path program 1 times [2019-01-14 04:30:18,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:18,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:18,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:18,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:18,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:30:18,924 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:30:18,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:30:18,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:30:19,043 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 04:30:19,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:30:19,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:30:19,155 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 6 states. [2019-01-14 04:30:19,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:30:19,370 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2019-01-14 04:30:19,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:30:19,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 109 transitions. [2019-01-14 04:30:19,384 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2019-01-14 04:30:19,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 74 states and 102 transitions. [2019-01-14 04:30:19,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2019-01-14 04:30:19,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2019-01-14 04:30:19,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 102 transitions. [2019-01-14 04:30:19,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:30:19,396 INFO L706 BuchiCegarLoop]: Abstraction has 74 states and 102 transitions. [2019-01-14 04:30:19,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 102 transitions. [2019-01-14 04:30:19,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-14 04:30:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 04:30:19,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2019-01-14 04:30:19,440 INFO L729 BuchiCegarLoop]: Abstraction has 74 states and 102 transitions. [2019-01-14 04:30:19,440 INFO L609 BuchiCegarLoop]: Abstraction has 74 states and 102 transitions. [2019-01-14 04:30:19,440 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:30:19,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 102 transitions. [2019-01-14 04:30:19,443 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2019-01-14 04:30:19,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:30:19,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:30:19,445 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:19,445 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:19,447 INFO L794 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);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(110, #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(4);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 2 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 3 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string11.base, #t~string11.offset, 1);call write~init~int(80, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(117, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(109, #t~string11.base, 3 + #t~string11.offset, 1);call write~init~int(112, #t~string11.base, 4 + #t~string11.offset, 1);call write~init~int(58, #t~string11.base, 5 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 6 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(110, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 2 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 3 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string17.base, #t~string17.offset, 1);call write~init~int(32, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(13);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string29.base, #t~string29.offset, 1);call write~init~int(77, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(101, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(116, #t~string29.base, 3 + #t~string29.offset, 1);call write~init~int(104, #t~string29.base, 4 + #t~string29.offset, 1);call write~init~int(58, #t~string29.base, 5 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 6 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string31.base, #t~string31.offset, 1);call write~init~int(82, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(73, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(84, #t~string31.base, 3 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 4 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string33.base, #t~string33.offset, 1);call write~init~int(75, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string35.base, #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 1 + #t~string35.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0; 198#L-1 havoc main_#res;havoc main_#t~ret25, main_~retValue_acc~5, main_~tmp~4;havoc main_~retValue_acc~5;havoc main_~tmp~4; 199#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; 196#L73 main_#t~ret25 := valid_product_#res;main_~tmp~4 := main_#t~ret25;havoc main_#t~ret25; 197#L423 assume 0 != main_~tmp~4; 182#L398 ~switchedOnBeforeTS~0 := 0; 183#L899 havoc test_#t~nondet21, test_#t~nondet22, test_#t~nondet23, test_#t~nondet24, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 184#L920-1 [2019-01-14 04:30:19,447 INFO L796 eck$LassoCheckResult]: Loop: 184#L920-1 assume !false; 190#L285 assume test_~splverifierCounter~0 < 4; 191#L286 test_~tmp~3 := test_#t~nondet21;havoc test_#t~nondet21; 210#L294 assume !(0 != test_~tmp~3); 222#L294-1 test_~tmp___0~1 := test_#t~nondet22;havoc test_#t~nondet22; 217#L304 assume !(0 != test_~tmp___0~1); 201#L304-1 test_~tmp___2~0 := test_#t~nondet23;havoc test_#t~nondet23; 207#L314 assume 0 != test_~tmp___2~0; 209#L320-2 havoc __utac_acc__Specification5_spec__2_#t~ret71;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~3;havoc isPumpRunning_~retValue_acc~3;isPumpRunning_~retValue_acc~3 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~3; 238#L211 __utac_acc__Specification5_spec__2_#t~ret71 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret71;havoc __utac_acc__Specification5_spec__2_#t~ret71; 251#L909 assume !(0 != ~pumpRunning~0); 244#L108 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret1, processEnvironment_~tmp~0;havoc processEnvironment_~tmp~0; 242#L140 assume !(0 != ~pumpRunning~0); 223#L115 havoc __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_~tmp~8, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~8;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 227#L513 __utac_acc__Specification5_spec__3_#t~ret72 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~8 := __utac_acc__Specification5_spec__3_#t~ret72;havoc __utac_acc__Specification5_spec__3_#t~ret72; 228#L920 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~8); 184#L920-1 [2019-01-14 04:30:19,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:19,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-14 04:30:19,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:19,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:19,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:19,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:19,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:19,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:19,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1401856253, now seen corresponding path program 1 times [2019-01-14 04:30:19,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:19,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:19,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:19,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:30:19,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:19,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:19,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1576616887, now seen corresponding path program 1 times [2019-01-14 04:30:19,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:19,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:19,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:19,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:19,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:30:20,077 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:30:20,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:30:20,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:30:20,359 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 04:30:20,540 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 04:30:20,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:30:20,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:30:20,556 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. cyclomatic complexity: 30 Second operand 5 states. [2019-01-14 04:30:20,882 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 04:30:21,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:30:21,361 INFO L93 Difference]: Finished difference Result 210 states and 288 transitions. [2019-01-14 04:30:21,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:30:21,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 288 transitions. [2019-01-14 04:30:21,368 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 95 [2019-01-14 04:30:21,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 210 states and 288 transitions. [2019-01-14 04:30:21,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2019-01-14 04:30:21,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 210 [2019-01-14 04:30:21,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 210 states and 288 transitions. [2019-01-14 04:30:21,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:30:21,376 INFO L706 BuchiCegarLoop]: Abstraction has 210 states and 288 transitions. [2019-01-14 04:30:21,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states and 288 transitions. [2019-01-14 04:30:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 141. [2019-01-14 04:30:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-14 04:30:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 190 transitions. [2019-01-14 04:30:21,391 INFO L729 BuchiCegarLoop]: Abstraction has 141 states and 190 transitions. [2019-01-14 04:30:21,391 INFO L609 BuchiCegarLoop]: Abstraction has 141 states and 190 transitions. [2019-01-14 04:30:21,391 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:30:21,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 190 transitions. [2019-01-14 04:30:21,396 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 95 [2019-01-14 04:30:21,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:30:21,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:30:21,398 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:21,398 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:21,398 INFO L794 eck$LassoCheckResult]: Stem: 516#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);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(110, #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(4);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 2 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 3 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string11.base, #t~string11.offset, 1);call write~init~int(80, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(117, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(109, #t~string11.base, 3 + #t~string11.offset, 1);call write~init~int(112, #t~string11.base, 4 + #t~string11.offset, 1);call write~init~int(58, #t~string11.base, 5 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 6 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(110, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 2 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 3 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string17.base, #t~string17.offset, 1);call write~init~int(32, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(13);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string29.base, #t~string29.offset, 1);call write~init~int(77, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(101, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(116, #t~string29.base, 3 + #t~string29.offset, 1);call write~init~int(104, #t~string29.base, 4 + #t~string29.offset, 1);call write~init~int(58, #t~string29.base, 5 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 6 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string31.base, #t~string31.offset, 1);call write~init~int(82, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(73, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(84, #t~string31.base, 3 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 4 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string33.base, #t~string33.offset, 1);call write~init~int(75, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string35.base, #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 1 + #t~string35.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0; 498#L-1 havoc main_#res;havoc main_#t~ret25, main_~retValue_acc~5, main_~tmp~4;havoc main_~retValue_acc~5;havoc main_~tmp~4; 499#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; 494#L73 main_#t~ret25 := valid_product_#res;main_~tmp~4 := main_#t~ret25;havoc main_#t~ret25; 495#L423 assume 0 != main_~tmp~4; 482#L398 ~switchedOnBeforeTS~0 := 0; 483#L899 havoc test_#t~nondet21, test_#t~nondet22, test_#t~nondet23, test_#t~nondet24, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 484#L920-1 [2019-01-14 04:30:21,399 INFO L796 eck$LassoCheckResult]: Loop: 484#L920-1 assume !false; 597#L285 assume test_~splverifierCounter~0 < 4; 598#L286 test_~tmp~3 := test_#t~nondet21;havoc test_#t~nondet21; 620#L294 assume !(0 != test_~tmp~3); 619#L294-1 test_~tmp___0~1 := test_#t~nondet22;havoc test_#t~nondet22; 618#L304 assume !(0 != test_~tmp___0~1); 616#L304-1 test_~tmp___2~0 := test_#t~nondet23;havoc test_#t~nondet23; 615#L314 assume 0 != test_~tmp___2~0; 613#L320-2 havoc __utac_acc__Specification5_spec__2_#t~ret71;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~3;havoc isPumpRunning_~retValue_acc~3;isPumpRunning_~retValue_acc~3 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~3; 612#L211 __utac_acc__Specification5_spec__2_#t~ret71 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret71;havoc __utac_acc__Specification5_spec__2_#t~ret71; 610#L909 assume !(0 != ~pumpRunning~0); 608#L108 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret1, processEnvironment_~tmp~0;havoc processEnvironment_~tmp~0; 604#L140 assume !(0 != ~pumpRunning~0); 602#L115 havoc __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_~tmp~8, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~8;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 530#L513 __utac_acc__Specification5_spec__3_#t~ret72 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~8 := __utac_acc__Specification5_spec__3_#t~ret72;havoc __utac_acc__Specification5_spec__3_#t~ret72; 531#L920 assume 2 != __utac_acc__Specification5_spec__3_~tmp~8;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~3;havoc isPumpRunning_~retValue_acc~3;isPumpRunning_~retValue_acc~3 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~3; 564#L211-1 __utac_acc__Specification5_spec__3_#t~ret73 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~2 := __utac_acc__Specification5_spec__3_#t~ret73;havoc __utac_acc__Specification5_spec__3_#t~ret73; 565#L924 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~2); 484#L920-1 [2019-01-14 04:30:21,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:21,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-14 04:30:21,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:21,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:21,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:21,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:21,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:21,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:21,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1435857662, now seen corresponding path program 1 times [2019-01-14 04:30:21,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:21,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:21,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:21,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:30:21,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:21,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:21,736 INFO L82 PathProgramCache]: Analyzing trace with hash 994612932, now seen corresponding path program 1 times [2019-01-14 04:30:21,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:21,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:21,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:21,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:21,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:22,315 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-01-14 04:30:50,332 WARN L181 SmtUtils]: Spent 27.90 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-14 04:31:03,433 WARN L181 SmtUtils]: Spent 13.09 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-14 04:31:03,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:31:03 BoogieIcfgContainer [2019-01-14 04:31:03,505 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:31:03,506 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:31:03,506 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:31:03,506 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:31:03,507 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:30:17" (3/4) ... [2019-01-14 04:31:03,511 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:31:03,611 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:31:03,611 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:31:03,612 INFO L168 Benchmark]: Toolchain (without parser) took 48233.65 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.5 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -264.3 MB). Peak memory consumption was 71.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:03,614 INFO L168 Benchmark]: CDTParser took 0.46 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:31:03,615 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:03,616 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:31:03,617 INFO L168 Benchmark]: Boogie Preprocessor took 37.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:31:03,618 INFO L168 Benchmark]: RCFGBuilder took 1178.27 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: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:03,618 INFO L168 Benchmark]: BuchiAutomizer took 46049.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -148.3 MB). Peak memory consumption was 401.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:03,620 INFO L168 Benchmark]: Witness Printer took 105.78 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:31:03,626 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.46 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 784.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.01 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. * Boogie Preprocessor took 37.91 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 1178.27 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: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 46049.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -148.3 MB). Peak memory consumption was 401.3 MB. Max. memory is 11.5 GB. * Witness Printer took 105.78 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. 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 141 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 45.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 44.7s. Construction of modules took 0.5s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 69 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 141 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 260 SDtfs, 640 SDslu, 300 SDs, 0 SdLazy, 90 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 284]: 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=-1, NULL=0, NULL=0, NULL=-15, NULL=0, NULL=0, retValue_acc=0, NULL=-6, NULL=-18, NULL=-25, NULL=-16, NULL=-2, methaneLevelCritical=0, tmp=1, tmp=0, NULL=0, NULL=0, NULL=-8, NULL=0, NULL=-24, NULL=0, tmp___1=0, NULL=-5, cleanupTimeShifts=4, switchedOnBeforeTS=0, NULL=-21, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@dc161c1=0, NULL=-13, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=-20, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2753aeaa=0, NULL=0, NULL=0, NULL=0, NULL=0, \result=1, head=0, pumpRunning=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5df99d1d=0, tmp___0=0, NULL=-19, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27d8301e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@17ac868e=0, tmp=1, NULL=0, NULL=-23, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d6e1737=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64e298b8=69, NULL=-9, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b58c356=0, NULL=-12, NULL=-4, retValue_acc=1, retValue_acc=1, tmp___2=69, tmp___0=0, splverifierCounter=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-11, tmp=0, NULL=-22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6268c0d0=0, head=0, NULL=-3, NULL=-7, NULL=0, NULL=0, NULL=0, NULL=-10, NULL=-14, NULL=-17, retValue_acc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L96] int pumpRunning = 0; [L97] int systemActive = 1; [L339] int cleanupTimeShifts = 4; [L438] int waterLevel = 1; [L439] int methaneLevelCritical = 0; [L696] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L893] int switchedOnBeforeTS ; [L414] int retValue_acc ; [L415] int tmp ; [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); [L421] tmp = valid_product() [L423] COND TRUE \read(tmp) [L898] switchedOnBeforeTS = 0 [L275] int splverifierCounter ; [L276] int tmp ; [L277] int tmp___0 ; [L278] int tmp___1 ; [L279] int tmp___2 ; [L282] splverifierCounter = 0 Loop: [L284] COND TRUE 1 [L286] COND TRUE splverifierCounter < 4 [L292] tmp = __VERIFIER_nondet_int() [L294] COND FALSE !(\read(tmp)) [L302] tmp___0 = __VERIFIER_nondet_int() [L304] COND FALSE !(\read(tmp___0)) [L312] tmp___2 = __VERIFIER_nondet_int() [L314] COND TRUE \read(tmp___2) [L207] int retValue_acc ; [L210] retValue_acc = pumpRunning [L211] return (retValue_acc); [L907] switchedOnBeforeTS = isPumpRunning() [L108] COND FALSE !(\read(pumpRunning)) [L115] COND TRUE \read(systemActive) [L137] int tmp ; [L140] COND FALSE !(\read(pumpRunning)) [L913] int tmp ; [L914] int tmp___0 ; [L509] int retValue_acc ; [L512] retValue_acc = waterLevel [L513] return (retValue_acc); [L918] tmp = getWaterLevel() [L920] COND TRUE tmp != 2 [L207] int retValue_acc ; [L210] retValue_acc = pumpRunning [L211] return (retValue_acc); [L922] tmp___0 = isPumpRunning() [L924] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...