./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec3_product51_false-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_spec3_product51_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9033da3093a23b8640383fad25d5fd5dfea2cc28 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:44:14,346 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:44:14,348 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:44:14,365 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:44:14,366 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:44:14,367 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:44:14,369 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:44:14,371 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:44:14,374 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:44:14,377 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:44:14,380 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:44:14,380 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:44:14,381 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:44:14,382 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:44:14,383 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:44:14,386 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:44:14,387 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:44:14,397 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:44:14,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:44:14,403 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:44:14,404 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:44:14,408 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:44:14,412 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:44:14,414 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:44:14,414 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:44:14,415 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:44:14,418 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:44:14,419 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:44:14,420 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:44:14,423 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:44:14,424 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:44:14,424 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:44:14,424 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:44:14,425 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:44:14,425 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:44:14,426 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:44:14,426 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:44:14,457 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:44:14,459 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:44:14,461 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:44:14,463 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:44:14,463 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:44:14,464 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:44:14,464 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:44:14,464 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:44:14,464 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:44:14,464 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:44:14,465 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:44:14,465 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:44:14,465 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:44:14,465 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:44:14,465 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:44:14,465 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:44:14,467 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:44:14,467 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:44:14,467 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:44:14,467 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:44:14,468 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:44:14,468 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:44:14,468 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:44:14,468 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:44:14,468 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:44:14,469 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:44:14,469 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:44:14,469 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:44:14,469 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:44:14,469 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:44:14,470 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:44:14,474 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:44:14,474 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 -> 9033da3093a23b8640383fad25d5fd5dfea2cc28 [2019-01-01 23:44:14,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:44:14,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:44:14,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:44:14,576 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:44:14,577 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:44:14,577 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec3_product51_false-unreach-call_false-termination.cil.c [2019-01-01 23:44:14,637 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b24905ba/a5e39b33dac84df6886b1dcd2d3e2ecb/FLAGdc67a2662 [2019-01-01 23:44:15,106 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:44:15,107 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec3_product51_false-unreach-call_false-termination.cil.c [2019-01-01 23:44:15,120 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b24905ba/a5e39b33dac84df6886b1dcd2d3e2ecb/FLAGdc67a2662 [2019-01-01 23:44:15,423 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b24905ba/a5e39b33dac84df6886b1dcd2d3e2ecb [2019-01-01 23:44:15,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:44:15,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:44:15,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:44:15,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:44:15,437 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:44:15,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:44:15" (1/1) ... [2019-01-01 23:44:15,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37a65237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:44:15, skipping insertion in model container [2019-01-01 23:44:15,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:44:15" (1/1) ... [2019-01-01 23:44:15,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:44:15,515 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:44:15,910 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:44:15,926 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:44:16,070 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:44:16,202 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:44:16,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:44:16 WrapperNode [2019-01-01 23:44:16,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:44:16,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:44:16,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:44:16,204 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:44:16,213 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:44:16" (1/1) ... [2019-01-01 23:44:16,235 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:44:16" (1/1) ... [2019-01-01 23:44:16,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:44:16,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:44:16,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:44:16,282 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:44:16,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:44:16" (1/1) ... [2019-01-01 23:44:16,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:44:16" (1/1) ... [2019-01-01 23:44:16,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:44:16" (1/1) ... [2019-01-01 23:44:16,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:44:16" (1/1) ... [2019-01-01 23:44:16,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:44:16" (1/1) ... [2019-01-01 23:44:16,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:44:16" (1/1) ... [2019-01-01 23:44:16,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:44:16" (1/1) ... [2019-01-01 23:44:16,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:44:16,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:44:16,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:44:16,361 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:44:16,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:44: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-01 23:44:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:44:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:44:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:44:16,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:44:17,808 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:44:17,808 INFO L280 CfgBuilder]: Removed 166 assue(true) statements. [2019-01-01 23:44:17,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:44:17 BoogieIcfgContainer [2019-01-01 23:44:17,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:44:17,810 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:44:17,810 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:44:17,814 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:44:17,815 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:44:17,815 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:44:15" (1/3) ... [2019-01-01 23:44:17,816 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@501cc509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:44:17, skipping insertion in model container [2019-01-01 23:44:17,816 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:44:17,816 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:44:16" (2/3) ... [2019-01-01 23:44:17,817 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@501cc509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:44:17, skipping insertion in model container [2019-01-01 23:44:17,817 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:44:17,817 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:44:17" (3/3) ... [2019-01-01 23:44:17,819 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product51_false-unreach-call_false-termination.cil.c [2019-01-01 23:44:17,877 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:44:17,878 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:44:17,878 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:44:17,878 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:44:17,878 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:44:17,878 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:44:17,878 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:44:17,878 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:44:17,879 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:44:17,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states. [2019-01-01 23:44:17,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2019-01-01 23:44:17,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:44:17,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:44:17,938 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:44:17,938 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:44:17,938 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:44:17,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states. [2019-01-01 23:44:17,946 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2019-01-01 23:44:17,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:44:17,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:44:17,947 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:44:17,947 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:44:17,953 INFO L794 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;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~string61.base, #t~string61.offset := #Ultimate.allocOnStack(30);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(9);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(21);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);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(30);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(9);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(25); 3#L-1true havoc main_#res;havoc main_#t~ret38, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 90#L594true havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 122#L602true main_#t~ret38 := valid_product_#res;main_~tmp~6 := main_#t~ret38;havoc main_#t~ret38; 98#L558true assume 0 != main_~tmp~6; 26#L532true havoc test_#t~nondet10, test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 72#L454-1true [2019-01-01 23:44:17,953 INFO L796 eck$LassoCheckResult]: Loop: 72#L454-1true assume !false; 50#L165true assume test_~splverifierCounter~0 < 4; 20#L166true test_~tmp~0 := test_#t~nondet10;havoc test_#t~nondet10; 37#L174true assume !(0 != test_~tmp~0); 36#L174-1true test_~tmp___0~0 := test_#t~nondet11;havoc test_#t~nondet11; 95#L184true assume !(0 != test_~tmp___0~0); 92#L184-1true test_~tmp___2~0 := test_#t~nondet12;havoc test_#t~nondet12; 15#L194true assume 0 != test_~tmp___2~0; 105#L200-1true assume !(0 != ~pumpRunning~0); 112#L233true assume !(0 != ~systemActive~0); 33#L240true havoc __utac_acc__Specification3_spec__1_#t~ret35, __utac_acc__Specification3_spec__1_#t~ret36, __utac_acc__Specification3_spec__1_#t~ret37, __utac_acc__Specification3_spec__1_~tmp~5, __utac_acc__Specification3_spec__1_~tmp___0~3, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~5;havoc __utac_acc__Specification3_spec__1_~tmp___0~3;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 42#L91true __utac_acc__Specification3_spec__1_#t~ret35 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~5 := __utac_acc__Specification3_spec__1_#t~ret35;havoc __utac_acc__Specification3_spec__1_#t~ret35; 110#L448true assume 0 != __utac_acc__Specification3_spec__1_~tmp~5; 72#L454-1true [2019-01-01 23:44:17,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:44:17,960 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-01 23:44:17,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:44:17,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:44:18,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:18,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:44:18,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:44:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:44:18,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:44:18,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1671186434, now seen corresponding path program 1 times [2019-01-01 23:44:18,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:44:18,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:44:18,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:18,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:44:18,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:44:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:44:18,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:44:18,866 INFO L82 PathProgramCache]: Analyzing trace with hash 43092504, now seen corresponding path program 1 times [2019-01-01 23:44:18,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:44:18,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:44:18,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:18,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:44:18,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:44:19,247 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:44:19,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:44:19,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:44:19,401 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 23:44:19,529 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 23:44:19,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:44:19,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:44:19,568 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 6 states. [2019-01-01 23:44:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:44:20,029 INFO L93 Difference]: Finished difference Result 294 states and 423 transitions. [2019-01-01 23:44:20,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:44:20,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 423 transitions. [2019-01-01 23:44:20,053 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 189 [2019-01-01 23:44:20,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 273 states and 402 transitions. [2019-01-01 23:44:20,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 273 [2019-01-01 23:44:20,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 273 [2019-01-01 23:44:20,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 273 states and 402 transitions. [2019-01-01 23:44:20,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:44:20,076 INFO L705 BuchiCegarLoop]: Abstraction has 273 states and 402 transitions. [2019-01-01 23:44:20,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states and 402 transitions. [2019-01-01 23:44:20,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 162. [2019-01-01 23:44:20,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-01 23:44:20,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 237 transitions. [2019-01-01 23:44:20,127 INFO L728 BuchiCegarLoop]: Abstraction has 162 states and 237 transitions. [2019-01-01 23:44:20,127 INFO L608 BuchiCegarLoop]: Abstraction has 162 states and 237 transitions. [2019-01-01 23:44:20,127 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:44:20,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 237 transitions. [2019-01-01 23:44:20,130 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 112 [2019-01-01 23:44:20,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:44:20,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:44:20,132 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:44:20,132 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:44:20,132 INFO L794 eck$LassoCheckResult]: Stem: 523#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;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~string61.base, #t~string61.offset := #Ultimate.allocOnStack(30);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(9);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(21);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);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(30);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(9);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(25); 434#L-1 havoc main_#res;havoc main_#t~ret38, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 435#L594 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 538#L602 main_#t~ret38 := valid_product_#res;main_~tmp~6 := main_#t~ret38;havoc main_#t~ret38; 541#L558 assume 0 != main_~tmp~6; 474#L532 havoc test_#t~nondet10, test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 473#L454-1 [2019-01-01 23:44:20,133 INFO L796 eck$LassoCheckResult]: Loop: 473#L454-1 assume !false; 506#L165 assume test_~splverifierCounter~0 < 4; 464#L166 test_~tmp~0 := test_#t~nondet10;havoc test_#t~nondet10; 465#L174 assume !(0 != test_~tmp~0); 488#L174-1 test_~tmp___0~0 := test_#t~nondet11;havoc test_#t~nondet11; 489#L184 assume !(0 != test_~tmp___0~0); 480#L184-1 test_~tmp___2~0 := test_#t~nondet12;havoc test_#t~nondet12; 454#L194 assume 0 != test_~tmp___2~0; 455#L200-1 assume !(0 != ~pumpRunning~0); 441#L233 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret15, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 548#L291 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret14, processEnvironment__wrappee__highWaterSensor_~tmp~1;havoc processEnvironment__wrappee__highWaterSensor_~tmp~1; 469#L265-1 assume !(0 == ~pumpRunning~0); 470#L240 havoc __utac_acc__Specification3_spec__1_#t~ret35, __utac_acc__Specification3_spec__1_#t~ret36, __utac_acc__Specification3_spec__1_#t~ret37, __utac_acc__Specification3_spec__1_~tmp~5, __utac_acc__Specification3_spec__1_~tmp___0~3, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~5;havoc __utac_acc__Specification3_spec__1_~tmp___0~3;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 485#L91 __utac_acc__Specification3_spec__1_#t~ret35 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~5 := __utac_acc__Specification3_spec__1_#t~ret35;havoc __utac_acc__Specification3_spec__1_#t~ret35; 496#L448 assume 0 != __utac_acc__Specification3_spec__1_~tmp~5; 473#L454-1 [2019-01-01 23:44:20,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:44:20,133 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-01 23:44:20,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:44:20,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:44:20,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:20,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:44:20,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:44:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:44:20,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:44:20,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1961899900, now seen corresponding path program 1 times [2019-01-01 23:44:20,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:44:20,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:44:20,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:20,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:44:20,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:44:20,497 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:44:20,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:44:20,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:44:20,501 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:44:20,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:44:20,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:44:20,502 INFO L87 Difference]: Start difference. First operand 162 states and 237 transitions. cyclomatic complexity: 78 Second operand 3 states. [2019-01-01 23:44:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:44:20,860 INFO L93 Difference]: Finished difference Result 207 states and 286 transitions. [2019-01-01 23:44:20,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:44:20,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 286 transitions. [2019-01-01 23:44:20,865 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 146 [2019-01-01 23:44:20,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 207 states and 286 transitions. [2019-01-01 23:44:20,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2019-01-01 23:44:20,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 207 [2019-01-01 23:44:20,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 286 transitions. [2019-01-01 23:44:20,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:44:20,871 INFO L705 BuchiCegarLoop]: Abstraction has 207 states and 286 transitions. [2019-01-01 23:44:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 286 transitions. [2019-01-01 23:44:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-01-01 23:44:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-01 23:44:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 286 transitions. [2019-01-01 23:44:20,883 INFO L728 BuchiCegarLoop]: Abstraction has 207 states and 286 transitions. [2019-01-01 23:44:20,883 INFO L608 BuchiCegarLoop]: Abstraction has 207 states and 286 transitions. [2019-01-01 23:44:20,883 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:44:20,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 207 states and 286 transitions. [2019-01-01 23:44:20,886 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 146 [2019-01-01 23:44:20,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:44:20,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:44:20,887 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:44:20,887 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, 1, 1] [2019-01-01 23:44:20,888 INFO L794 eck$LassoCheckResult]: Stem: 902#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;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~string61.base, #t~string61.offset := #Ultimate.allocOnStack(30);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(9);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(21);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);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(30);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(9);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(25); 809#L-1 havoc main_#res;havoc main_#t~ret38, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 810#L594 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 917#L602 main_#t~ret38 := valid_product_#res;main_~tmp~6 := main_#t~ret38;havoc main_#t~ret38; 920#L558 assume 0 != main_~tmp~6; 849#L532 havoc test_#t~nondet10, test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 846#L454-1 [2019-01-01 23:44:20,888 INFO L796 eck$LassoCheckResult]: Loop: 846#L454-1 assume !false; 884#L165 assume test_~splverifierCounter~0 < 4; 839#L166 test_~tmp~0 := test_#t~nondet10;havoc test_#t~nondet10; 840#L174 assume !(0 != test_~tmp~0); 865#L174-1 test_~tmp___0~0 := test_#t~nondet11;havoc test_#t~nondet11; 866#L184 assume !(0 != test_~tmp___0~0); 854#L184-1 test_~tmp___2~0 := test_#t~nondet12;havoc test_#t~nondet12; 829#L194 assume 0 != test_~tmp___2~0; 830#L200-1 assume !(0 != ~pumpRunning~0); 927#L233 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret15, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 931#L291 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret14, processEnvironment__wrappee__highWaterSensor_~tmp~1;havoc processEnvironment__wrappee__highWaterSensor_~tmp~1; 844#L265-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret33, isHighWaterLevel_~retValue_acc~6, isHighWaterLevel_~tmp~3, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~6;havoc isHighWaterLevel_~tmp~3;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 819#L131-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 820#L136-1 isHighWaterLevel_#t~ret33 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~3 := isHighWaterLevel_#t~ret33;havoc isHighWaterLevel_#t~ret33; 825#L393-3 assume 0 != isHighWaterLevel_~tmp~3;isHighWaterLevel_~tmp___0~1 := 0; 907#L393-5 isHighWaterLevel_~retValue_acc~6 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~6; 885#L399-1 processEnvironment__wrappee__highWaterSensor_#t~ret14 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~1 := processEnvironment__wrappee__highWaterSensor_#t~ret14;havoc processEnvironment__wrappee__highWaterSensor_#t~ret14; 886#L269-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~1); 861#L240 havoc __utac_acc__Specification3_spec__1_#t~ret35, __utac_acc__Specification3_spec__1_#t~ret36, __utac_acc__Specification3_spec__1_#t~ret37, __utac_acc__Specification3_spec__1_~tmp~5, __utac_acc__Specification3_spec__1_~tmp___0~3, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~5;havoc __utac_acc__Specification3_spec__1_~tmp___0~3;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 862#L91 __utac_acc__Specification3_spec__1_#t~ret35 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~5 := __utac_acc__Specification3_spec__1_#t~ret35;havoc __utac_acc__Specification3_spec__1_#t~ret35; 874#L448 assume 0 != __utac_acc__Specification3_spec__1_~tmp~5; 846#L454-1 [2019-01-01 23:44:20,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:44:20,888 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-01 23:44:20,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:44:20,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:44:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:20,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:44:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:44:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:44:21,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:44:21,119 INFO L82 PathProgramCache]: Analyzing trace with hash -2099215608, now seen corresponding path program 1 times [2019-01-01 23:44:21,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:44:21,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:44:21,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:21,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:44:21,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:44:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:44:21,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:44:21,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1643144414, now seen corresponding path program 1 times [2019-01-01 23:44:21,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:44:21,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:44:21,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:21,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:44:21,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:44:21,433 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:44:21,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:44:21,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:44:21,940 WARN L181 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-01-01 23:44:22,096 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 23:44:22,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:44:22,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:44:22,103 INFO L87 Difference]: Start difference. First operand 207 states and 286 transitions. cyclomatic complexity: 82 Second operand 5 states. [2019-01-01 23:44:22,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:44:22,372 INFO L93 Difference]: Finished difference Result 705 states and 979 transitions. [2019-01-01 23:44:22,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 23:44:22,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 705 states and 979 transitions. [2019-01-01 23:44:22,381 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 531 [2019-01-01 23:44:22,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 705 states to 705 states and 979 transitions. [2019-01-01 23:44:22,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 705 [2019-01-01 23:44:22,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 705 [2019-01-01 23:44:22,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 705 states and 979 transitions. [2019-01-01 23:44:22,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:44:22,394 INFO L705 BuchiCegarLoop]: Abstraction has 705 states and 979 transitions. [2019-01-01 23:44:22,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states and 979 transitions. [2019-01-01 23:44:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 408. [2019-01-01 23:44:22,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-01-01 23:44:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 554 transitions. [2019-01-01 23:44:22,416 INFO L728 BuchiCegarLoop]: Abstraction has 408 states and 554 transitions. [2019-01-01 23:44:22,416 INFO L608 BuchiCegarLoop]: Abstraction has 408 states and 554 transitions. [2019-01-01 23:44:22,417 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:44:22,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 408 states and 554 transitions. [2019-01-01 23:44:22,421 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 292 [2019-01-01 23:44:22,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:44:22,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:44:22,422 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:44:22,422 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, 1, 1, 1, 1] [2019-01-01 23:44:22,422 INFO L794 eck$LassoCheckResult]: Stem: 1842#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;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~string61.base, #t~string61.offset := #Ultimate.allocOnStack(30);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(9);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(21);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);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(30);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(9);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(25); 1739#L-1 havoc main_#res;havoc main_#t~ret38, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 1740#L594 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 1860#L602 main_#t~ret38 := valid_product_#res;main_~tmp~6 := main_#t~ret38;havoc main_#t~ret38; 1867#L558 assume 0 != main_~tmp~6; 1780#L532 havoc test_#t~nondet10, test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1781#L454-1 [2019-01-01 23:44:22,422 INFO L796 eck$LassoCheckResult]: Loop: 1781#L454-1 assume !false; 2127#L165 assume test_~splverifierCounter~0 < 4; 2125#L166 test_~tmp~0 := test_#t~nondet10;havoc test_#t~nondet10; 2124#L174 assume !(0 != test_~tmp~0); 2122#L174-1 test_~tmp___0~0 := test_#t~nondet11;havoc test_#t~nondet11; 2120#L184 assume !(0 != test_~tmp___0~0); 2119#L184-1 test_~tmp___2~0 := test_#t~nondet12;havoc test_#t~nondet12; 2097#L194 assume 0 != test_~tmp___2~0; 2095#L200-1 assume !(0 != ~pumpRunning~0); 2071#L233 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret15, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 2056#L291 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret14, processEnvironment__wrappee__highWaterSensor_~tmp~1;havoc processEnvironment__wrappee__highWaterSensor_~tmp~1; 2065#L265-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret33, isHighWaterLevel_~retValue_acc~6, isHighWaterLevel_~tmp~3, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~6;havoc isHighWaterLevel_~tmp~3;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 2077#L131-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 2076#L136-1 isHighWaterLevel_#t~ret33 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~3 := isHighWaterLevel_#t~ret33;havoc isHighWaterLevel_#t~ret33; 2072#L393-3 assume 0 != isHighWaterLevel_~tmp~3;isHighWaterLevel_~tmp___0~1 := 0; 2069#L393-5 isHighWaterLevel_~retValue_acc~6 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~6; 2067#L399-1 processEnvironment__wrappee__highWaterSensor_#t~ret14 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~1 := processEnvironment__wrappee__highWaterSensor_#t~ret14;havoc processEnvironment__wrappee__highWaterSensor_#t~ret14; 1999#L269-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~1); 1998#L240 havoc __utac_acc__Specification3_spec__1_#t~ret35, __utac_acc__Specification3_spec__1_#t~ret36, __utac_acc__Specification3_spec__1_#t~ret37, __utac_acc__Specification3_spec__1_~tmp~5, __utac_acc__Specification3_spec__1_~tmp___0~3, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~5;havoc __utac_acc__Specification3_spec__1_~tmp___0~3;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 1808#L91 __utac_acc__Specification3_spec__1_#t~ret35 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~5 := __utac_acc__Specification3_spec__1_#t~ret35;havoc __utac_acc__Specification3_spec__1_#t~ret35; 1809#L448 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~5);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 1870#L123 __utac_acc__Specification3_spec__1_#t~ret36 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~3 := __utac_acc__Specification3_spec__1_#t~ret36;havoc __utac_acc__Specification3_spec__1_#t~ret36; 1871#L454 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~3); 1781#L454-1 [2019-01-01 23:44:22,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:44:22,429 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2019-01-01 23:44:22,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:44:22,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:44:22,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:22,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:44:22,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:44:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:44:22,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:44:22,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1288438010, now seen corresponding path program 1 times [2019-01-01 23:44:22,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:44:22,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:44:22,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:22,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:44:22,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:44:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:44:22,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:44:22,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1486191252, now seen corresponding path program 1 times [2019-01-01 23:44:22,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:44:22,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:44:22,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:22,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:44:22,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:44:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:44:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:44:24,097 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-01-01 23:44:24,294 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-01 23:44:52,792 WARN L181 SmtUtils]: Spent 28.49 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-01 23:45:06,541 WARN L181 SmtUtils]: Spent 13.75 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-01 23:45:06,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:45:06 BoogieIcfgContainer [2019-01-01 23:45:06,627 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:45:06,628 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:45:06,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:45:06,628 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:45:06,628 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:44:17" (3/4) ... [2019-01-01 23:45:06,634 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:45:06,716 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:45:06,718 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:45:06,721 INFO L168 Benchmark]: Toolchain (without parser) took 51291.90 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.9 MB). Free memory was 946.0 MB in the beginning and 840.7 MB in the end (delta: 105.2 MB). Peak memory consumption was 437.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:45:06,726 INFO L168 Benchmark]: CDTParser took 0.16 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:45:06,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:45:06,727 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.06 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:45:06,728 INFO L168 Benchmark]: Boogie Preprocessor took 79.06 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:45:06,728 INFO L168 Benchmark]: RCFGBuilder took 1448.18 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.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:45:06,729 INFO L168 Benchmark]: BuchiAutomizer took 48817.41 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 840.7 MB in the end (delta: 225.7 MB). Peak memory consumption was 420.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:45:06,729 INFO L168 Benchmark]: Witness Printer took 90.28 ms. Allocated memory is still 1.4 GB. Free memory is still 840.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:45:06,737 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.16 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 771.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.06 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 79.06 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. * RCFGBuilder took 1448.18 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.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 48817.41 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 840.7 MB in the end (delta: 225.7 MB). Peak memory consumption was 420.2 MB. Max. memory is 11.5 GB. * Witness Printer took 90.28 ms. Allocated memory is still 1.4 GB. Free memory is still 840.7 MB. 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 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 408 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 48.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 47.3s. Construction of modules took 0.8s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 408 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 408 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 605 SDtfs, 1483 SDslu, 1676 SDs, 0 SdLazy, 117 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont1 unkn0 SFLI1 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: 164]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=5620} State at position 1 is {NULL=0, retValue_acc=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6557787=0, NULL=-11, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2fd2f5a5=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4fc11ed2=0, NULL=5620, NULL=-24, NULL=-7, NULL=0, NULL=0, NULL=-20, retValue_acc=0, NULL=-23, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63365055=0, methaneLevelCritical=0, retValue_acc=1, tmp___0=0, NULL=0, NULL=0, NULL=-21, NULL=0, tmp___1=0, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e9e8841=0, NULL=-13, NULL=-17, cleanupTimeShifts=4, tmp=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3eb98528=0, tmp=0, tmp___0=1, NULL=0, systemActive=1, waterLevel=1, NULL=-15, \result=1, NULL=0, NULL=0, NULL=-6, \result=0, tmp___0=0, NULL=-18, NULL=0, \result=1, retValue_acc=1, NULL=-10, head=0, pumpRunning=0, \result=0, retValue_acc=1, NULL=0, NULL=0, tmp=1, \result=1, NULL=-4, NULL=-22, NULL=-9, NULL=0, NULL=0, tmp=1, NULL=-5, tmp___2=59, NULL=-12, NULL=-8, splverifierCounter=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, \result=0, NULL=-2, NULL=5619, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@541801d0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7630284f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ce6cca4=0, NULL=-16, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@132f2a17=59, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1610bb33=0, tmp___1=0, head=0, NULL=0, NULL=0, NULL=-3, NULL=0, NULL=0, NULL=-14, NULL=-1, NULL=0, NULL=-19} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L48] int waterLevel = 1; [L49] int methaneLevelCritical = 0; [L225] int pumpRunning = 0; [L226] int systemActive = 1; [L473] int cleanupTimeShifts = 4; [L776] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L549] int retValue_acc ; [L550] int tmp ; [L598] int retValue_acc ; [L601] retValue_acc = 1 [L602] return (retValue_acc); [L556] tmp = valid_product() [L558] COND TRUE \read(tmp) [L155] int splverifierCounter ; [L156] int tmp ; [L157] int tmp___0 ; [L158] int tmp___1 ; [L159] int tmp___2 ; [L162] splverifierCounter = 0 Loop: [L164] COND TRUE 1 [L166] COND TRUE splverifierCounter < 4 [L172] tmp = __VERIFIER_nondet_int() [L174] COND FALSE !(\read(tmp)) [L182] tmp___0 = __VERIFIER_nondet_int() [L184] COND FALSE !(\read(tmp___0)) [L192] tmp___2 = __VERIFIER_nondet_int() [L194] COND TRUE \read(tmp___2) [L233] COND FALSE !(\read(pumpRunning)) [L240] COND TRUE \read(systemActive) [L288] int tmp ; [L291] COND FALSE !(\read(pumpRunning)) [L262] int tmp ; [L265] COND TRUE ! pumpRunning [L385] int retValue_acc ; [L386] int tmp ; [L387] int tmp___0 ; [L128] int retValue_acc ; [L131] COND TRUE waterLevel < 2 [L132] retValue_acc = 1 [L133] return (retValue_acc); [L391] tmp = isHighWaterSensorDry() [L393] COND TRUE \read(tmp) [L394] tmp___0 = 0 [L398] retValue_acc = tmp___0 [L399] return (retValue_acc); [L267] tmp = isHighWaterLevel() [L269] COND FALSE !(\read(tmp)) [L440] int tmp ; [L441] int tmp___0 ; [L442] int tmp___1 ; [L87] int retValue_acc ; [L90] retValue_acc = methaneLevelCritical [L91] return (retValue_acc); [L446] tmp = isMethaneLevelCritical() [L448] COND FALSE !(\read(tmp)) [L119] int retValue_acc ; [L122] retValue_acc = waterLevel [L123] return (retValue_acc); [L452] tmp___0 = getWaterLevel() [L454] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...