./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec5_product41.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2366578b-98df-4863-bd7e-c254d0b406e3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2366578b-98df-4863-bd7e-c254d0b406e3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2366578b-98df-4863-bd7e-c254d0b406e3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2366578b-98df-4863-bd7e-c254d0b406e3/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec5_product41.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2366578b-98df-4863-bd7e-c254d0b406e3/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2366578b-98df-4863-bd7e-c254d0b406e3/bin/uautomizer --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 5f4fa6f1cc0ba42b6f98a2dfe04ac0e8501306bf ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-678e011 [2019-11-20 00:15:03,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:15:03,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:15:03,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:15:03,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:15:03,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:15:03,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:15:03,432 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:15:03,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:15:03,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:15:03,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:15:03,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:15:03,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:15:03,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:15:03,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:15:03,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:15:03,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:15:03,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:15:03,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:15:03,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:15:03,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:15:03,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:15:03,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:15:03,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:15:03,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:15:03,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:15:03,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:15:03,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:15:03,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:15:03,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:15:03,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:15:03,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:15:03,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:15:03,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:15:03,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:15:03,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:15:03,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:15:03,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:15:03,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:15:03,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:15:03,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:15:03,476 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2366578b-98df-4863-bd7e-c254d0b406e3/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 00:15:03,496 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:15:03,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:15:03,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:15:03,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:15:03,498 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:15:03,498 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 00:15:03,498 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 00:15:03,498 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 00:15:03,498 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 00:15:03,499 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 00:15:03,499 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 00:15:03,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:15:03,499 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:15:03,499 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 00:15:03,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:15:03,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:15:03,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:15:03,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 00:15:03,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 00:15:03,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 00:15:03,501 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:15:03,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:15:03,501 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 00:15:03,501 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:15:03,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 00:15:03,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:15:03,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:15:03,502 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 00:15:03,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:15:03,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:15:03,502 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 00:15:03,503 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 00:15:03,503 INFO L138 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_2366578b-98df-4863-bd7e-c254d0b406e3/bin/uautomizer 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 -> 5f4fa6f1cc0ba42b6f98a2dfe04ac0e8501306bf [2019-11-20 00:15:03,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:15:03,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:15:03,657 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:15:03,658 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:15:03,659 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:15:03,659 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2366578b-98df-4863-bd7e-c254d0b406e3/bin/uautomizer/../../sv-benchmarks/c/product-lines/minepump_spec5_product41.cil.c [2019-11-20 00:15:03,718 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2366578b-98df-4863-bd7e-c254d0b406e3/bin/uautomizer/data/541ba2e73/e7ef126bf26c48cc9e09bf25b4ff49d0/FLAGef28241fa [2019-11-20 00:15:04,177 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:15:04,178 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2366578b-98df-4863-bd7e-c254d0b406e3/sv-benchmarks/c/product-lines/minepump_spec5_product41.cil.c [2019-11-20 00:15:04,195 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2366578b-98df-4863-bd7e-c254d0b406e3/bin/uautomizer/data/541ba2e73/e7ef126bf26c48cc9e09bf25b4ff49d0/FLAGef28241fa [2019-11-20 00:15:04,680 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2366578b-98df-4863-bd7e-c254d0b406e3/bin/uautomizer/data/541ba2e73/e7ef126bf26c48cc9e09bf25b4ff49d0 [2019-11-20 00:15:04,682 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:15:04,683 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:15:04,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:15:04,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:15:04,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:15:04,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:15:04" (1/1) ... [2019-11-20 00:15:04,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6e7c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:04, skipping insertion in model container [2019-11-20 00:15:04,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:15:04" (1/1) ... [2019-11-20 00:15:04,698 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:15:04,759 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:15:05,094 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:15:05,106 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:15:05,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:15:05,209 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:15:05,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:05 WrapperNode [2019-11-20 00:15:05,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:15:05,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:15:05,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:15:05,211 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:15:05,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:05" (1/1) ... [2019-11-20 00:15:05,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:05" (1/1) ... [2019-11-20 00:15:05,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:15:05,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:15:05,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:15:05,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:15:05,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:05" (1/1) ... [2019-11-20 00:15:05,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:05" (1/1) ... [2019-11-20 00:15:05,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:05" (1/1) ... [2019-11-20 00:15:05,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:05" (1/1) ... [2019-11-20 00:15:05,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:05" (1/1) ... [2019-11-20 00:15:05,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:05" (1/1) ... [2019-11-20 00:15:05,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:05" (1/1) ... [2019-11-20 00:15:05,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:15:05,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:15:05,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:15:05,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:15:05,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2366578b-98df-4863-bd7e-c254d0b406e3/bin/uautomizer/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-11-20 00:15:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 00:15:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-20 00:15:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:15:05,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:15:06,059 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:15:06,060 INFO L285 CfgBuilder]: Removed 128 assume(true) statements. [2019-11-20 00:15:06,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:15:06 BoogieIcfgContainer [2019-11-20 00:15:06,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:15:06,061 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 00:15:06,061 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 00:15:06,064 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 00:15:06,065 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 00:15:06,067 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 12:15:04" (1/3) ... [2019-11-20 00:15:06,068 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21fd3915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 12:15:06, skipping insertion in model container [2019-11-20 00:15:06,068 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 00:15:06,068 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:05" (2/3) ... [2019-11-20 00:15:06,069 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21fd3915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 12:15:06, skipping insertion in model container [2019-11-20 00:15:06,069 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 00:15:06,069 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:15:06" (3/3) ... [2019-11-20 00:15:06,070 INFO L371 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product41.cil.c [2019-11-20 00:15:06,117 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 00:15:06,117 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 00:15:06,117 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 00:15:06,117 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:15:06,117 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:15:06,118 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 00:15:06,118 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:15:06,118 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 00:15:06,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states. [2019-11-20 00:15:06,159 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2019-11-20 00:15:06,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:15:06,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:15:06,167 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:06,167 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:06,167 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 00:15:06,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states. [2019-11-20 00:15:06,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2019-11-20 00:15:06,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:15:06,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:15:06,174 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:06,174 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:06,178 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string6.base, #t~string6.offset, 1);call write~init~int(77, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(101, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(116, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(104, #t~string6.base, 4 + #t~string6.offset, 1);call write~init~int(58, #t~string6.base, 5 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 6 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string8.base, #t~string8.offset, 1);call write~init~int(82, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(73, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(84, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 4 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(75, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string12.base, #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 1 + #t~string12.offset, 1);~cleanupTimeShifts~0 := 4;~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);~head~0.base, ~head~0.offset := 0, 0;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25); 15#L-1true havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~3, main_~tmp~1;havoc main_~retValue_acc~3;havoc main_~tmp~1; 76#L923true havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 78#L931true main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 25#L281true assume 0 != main_~tmp~1; 39#L253true ~switchedOnBeforeTS~0 := 0; 60#L49true havoc test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 31#L70-1true [2019-11-20 00:15:06,179 INFO L796 eck$LassoCheckResult]: Loop: 31#L70-1true assume !false; 79#L481true assume test_~splverifierCounter~0 < 4; 10#L482true test_~tmp~5 := test_#t~nondet34;havoc test_#t~nondet34; 44#L490true assume !(0 != test_~tmp~5); 16#L490-1true test_~tmp___0~2 := test_#t~nondet35;havoc test_#t~nondet35; 82#L500true assume !(0 != test_~tmp___0~2); 85#L500-1true test_~tmp___2~0 := test_#t~nondet36;havoc test_#t~nondet36; 68#L510true assume 0 != test_~tmp___2~0; 36#L516-2true havoc __utac_acc__Specification5_spec__2_#t~ret0;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 54#L410true __utac_acc__Specification5_spec__2_#t~ret0 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret0;havoc __utac_acc__Specification5_spec__2_#t~ret0; 33#L59true assume !(0 != ~pumpRunning~0); 18#L307true assume !(0 != ~systemActive~0); 27#L314true havoc __utac_acc__Specification5_spec__3_#t~ret1, __utac_acc__Specification5_spec__3_#t~ret2, __utac_acc__Specification5_spec__3_~tmp~0, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~0;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;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; 75#L173true __utac_acc__Specification5_spec__3_#t~ret1 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~0 := __utac_acc__Specification5_spec__3_#t~ret1;havoc __utac_acc__Specification5_spec__3_#t~ret1; 34#L70true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~0); 31#L70-1true [2019-11-20 00:15:06,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:06,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-11-20 00:15:06,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:06,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324896651] [2019-11-20 00:15:06,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:15:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:15:06,473 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:15:06,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:06,474 INFO L82 PathProgramCache]: Analyzing trace with hash 94689452, now seen corresponding path program 1 times [2019-11-20 00:15:06,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:06,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502208577] [2019-11-20 00:15:06,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:15:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:15:06,492 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:15:06,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:06,493 INFO L82 PathProgramCache]: Analyzing trace with hash 2028714662, now seen corresponding path program 1 times [2019-11-20 00:15:06,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:06,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347803362] [2019-11-20 00:15:06,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:15:06,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347803362] [2019-11-20 00:15:06,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:06,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:15:06,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915919487] [2019-11-20 00:15:06,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:06,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 00:15:06,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:15:06,819 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 6 states. [2019-11-20 00:15:06,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:06,959 INFO L93 Difference]: Finished difference Result 93 states and 127 transitions. [2019-11-20 00:15:06,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:15:06,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 127 transitions. [2019-11-20 00:15:06,967 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2019-11-20 00:15:06,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 86 states and 120 transitions. [2019-11-20 00:15:06,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2019-11-20 00:15:06,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2019-11-20 00:15:06,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 120 transitions. [2019-11-20 00:15:06,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 00:15:06,978 INFO L688 BuchiCegarLoop]: Abstraction has 86 states and 120 transitions. [2019-11-20 00:15:06,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 120 transitions. [2019-11-20 00:15:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-11-20 00:15:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-20 00:15:07,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2019-11-20 00:15:07,006 INFO L711 BuchiCegarLoop]: Abstraction has 86 states and 120 transitions. [2019-11-20 00:15:07,006 INFO L591 BuchiCegarLoop]: Abstraction has 86 states and 120 transitions. [2019-11-20 00:15:07,007 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 00:15:07,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 120 transitions. [2019-11-20 00:15:07,009 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2019-11-20 00:15:07,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:15:07,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:15:07,010 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:07,010 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:07,010 INFO L794 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string6.base, #t~string6.offset, 1);call write~init~int(77, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(101, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(116, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(104, #t~string6.base, 4 + #t~string6.offset, 1);call write~init~int(58, #t~string6.base, 5 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 6 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string8.base, #t~string8.offset, 1);call write~init~int(82, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(73, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(84, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 4 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(75, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string12.base, #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 1 + #t~string12.offset, 1);~cleanupTimeShifts~0 := 4;~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);~head~0.base, ~head~0.offset := 0, 0;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25); 226#L-1 havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~3, main_~tmp~1;havoc main_~retValue_acc~3;havoc main_~tmp~1; 227#L923 havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 284#L931 main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 243#L281 assume 0 != main_~tmp~1; 244#L253 ~switchedOnBeforeTS~0 := 0; 263#L49 havoc test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 251#L70-1 [2019-11-20 00:15:07,011 INFO L796 eck$LassoCheckResult]: Loop: 251#L70-1 assume !false; 252#L481 assume test_~splverifierCounter~0 < 4; 217#L482 test_~tmp~5 := test_#t~nondet34;havoc test_#t~nondet34; 218#L490 assume !(0 != test_~tmp~5); 230#L490-1 test_~tmp___0~2 := test_#t~nondet35;havoc test_#t~nondet35; 231#L500 assume !(0 != test_~tmp___0~2); 269#L500-1 test_~tmp___2~0 := test_#t~nondet36;havoc test_#t~nondet36; 282#L510 assume 0 != test_~tmp___2~0; 246#L516-2 havoc __utac_acc__Specification5_spec__2_#t~ret0;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 259#L410 __utac_acc__Specification5_spec__2_#t~ret0 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret0;havoc __utac_acc__Specification5_spec__2_#t~ret0; 253#L59 assume !(0 != ~pumpRunning~0); 232#L307 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret14, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 233#L339 assume !(0 == ~pumpRunning~0); 216#L314 havoc __utac_acc__Specification5_spec__3_#t~ret1, __utac_acc__Specification5_spec__3_#t~ret2, __utac_acc__Specification5_spec__3_~tmp~0, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~0;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;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; 242#L173 __utac_acc__Specification5_spec__3_#t~ret1 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~0 := __utac_acc__Specification5_spec__3_#t~ret1;havoc __utac_acc__Specification5_spec__3_#t~ret1; 255#L70 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~0); 251#L70-1 [2019-11-20 00:15:07,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:07,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-11-20 00:15:07,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:07,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20358152] [2019-11-20 00:15:07,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:15:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:15:07,092 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:15:07,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:07,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1401363709, now seen corresponding path program 1 times [2019-11-20 00:15:07,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:07,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032709201] [2019-11-20 00:15:07,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:15:07,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032709201] [2019-11-20 00:15:07,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:07,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:15:07,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380608669] [2019-11-20 00:15:07,110 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 00:15:07,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:07,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:07,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:07,111 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. cyclomatic complexity: 36 Second operand 3 states. [2019-11-20 00:15:07,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:07,204 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2019-11-20 00:15:07,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:07,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 182 transitions. [2019-11-20 00:15:07,208 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 94 [2019-11-20 00:15:07,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 135 states and 182 transitions. [2019-11-20 00:15:07,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2019-11-20 00:15:07,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2019-11-20 00:15:07,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 182 transitions. [2019-11-20 00:15:07,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 00:15:07,223 INFO L688 BuchiCegarLoop]: Abstraction has 135 states and 182 transitions. [2019-11-20 00:15:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 182 transitions. [2019-11-20 00:15:07,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-11-20 00:15:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-20 00:15:07,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 182 transitions. [2019-11-20 00:15:07,236 INFO L711 BuchiCegarLoop]: Abstraction has 135 states and 182 transitions. [2019-11-20 00:15:07,236 INFO L591 BuchiCegarLoop]: Abstraction has 135 states and 182 transitions. [2019-11-20 00:15:07,236 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 00:15:07,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 182 transitions. [2019-11-20 00:15:07,240 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 94 [2019-11-20 00:15:07,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:15:07,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:15:07,244 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:07,245 INFO L850 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] [2019-11-20 00:15:07,246 INFO L794 eck$LassoCheckResult]: Stem: 496#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string6.base, #t~string6.offset, 1);call write~init~int(77, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(101, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(116, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(104, #t~string6.base, 4 + #t~string6.offset, 1);call write~init~int(58, #t~string6.base, 5 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 6 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string8.base, #t~string8.offset, 1);call write~init~int(82, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(73, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(84, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 4 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(75, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string12.base, #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 1 + #t~string12.offset, 1);~cleanupTimeShifts~0 := 4;~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);~head~0.base, ~head~0.offset := 0, 0;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25); 455#L-1 havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~3, main_~tmp~1;havoc main_~retValue_acc~3;havoc main_~tmp~1; 456#L923 havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 520#L931 main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 469#L281 assume 0 != main_~tmp~1; 470#L253 ~switchedOnBeforeTS~0 := 0; 490#L49 havoc test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 507#L70-1 [2019-11-20 00:15:07,246 INFO L796 eck$LassoCheckResult]: Loop: 507#L70-1 assume !false; 548#L481 assume test_~splverifierCounter~0 < 4; 445#L482 test_~tmp~5 := test_#t~nondet34;havoc test_#t~nondet34; 446#L490 assume !(0 != test_~tmp~5); 457#L490-1 test_~tmp___0~2 := test_#t~nondet35;havoc test_#t~nondet35; 458#L500 assume !(0 != test_~tmp___0~2); 498#L500-1 test_~tmp___2~0 := test_#t~nondet36;havoc test_#t~nondet36; 514#L510 assume 0 != test_~tmp___2~0; 475#L516-2 havoc __utac_acc__Specification5_spec__2_#t~ret0;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 487#L410 __utac_acc__Specification5_spec__2_#t~ret0 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret0;havoc __utac_acc__Specification5_spec__2_#t~ret0; 482#L59 assume !(0 != ~pumpRunning~0); 461#L307 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret14, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 462#L339 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret33, isHighWaterLevel_~retValue_acc~6, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~6;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 524#L181 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 435#L186 isHighWaterLevel_#t~ret33 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret33;havoc isHighWaterLevel_#t~ret33; 436#L459 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 512#L459-2 isHighWaterLevel_~retValue_acc~6 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~6; 499#L465 processEnvironment_#t~ret14 := isHighWaterLevel_#res;processEnvironment_~tmp~2 := processEnvironment_#t~ret14;havoc processEnvironment_#t~ret14; 447#L343 assume !(0 != processEnvironment_~tmp~2); 441#L314 havoc __utac_acc__Specification5_spec__3_#t~ret1, __utac_acc__Specification5_spec__3_#t~ret2, __utac_acc__Specification5_spec__3_~tmp~0, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~0;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;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; 558#L173 __utac_acc__Specification5_spec__3_#t~ret1 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~0 := __utac_acc__Specification5_spec__3_#t~ret1;havoc __utac_acc__Specification5_spec__3_#t~ret1; 550#L70 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~0); 507#L70-1 [2019-11-20 00:15:07,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:07,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-11-20 00:15:07,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:07,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411993724] [2019-11-20 00:15:07,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:15:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:15:07,376 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:15:07,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:07,378 INFO L82 PathProgramCache]: Analyzing trace with hash 394057807, now seen corresponding path program 1 times [2019-11-20 00:15:07,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:07,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855984046] [2019-11-20 00:15:07,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:15:07,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855984046] [2019-11-20 00:15:07,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:07,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:15:07,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986564439] [2019-11-20 00:15:07,439 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 00:15:07,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:07,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:15:07,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:15:07,440 INFO L87 Difference]: Start difference. First operand 135 states and 182 transitions. cyclomatic complexity: 49 Second operand 5 states. [2019-11-20 00:15:07,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:07,680 INFO L93 Difference]: Finished difference Result 520 states and 705 transitions. [2019-11-20 00:15:07,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 00:15:07,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 520 states and 705 transitions. [2019-11-20 00:15:07,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 361 [2019-11-20 00:15:07,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 520 states to 520 states and 705 transitions. [2019-11-20 00:15:07,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 520 [2019-11-20 00:15:07,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 520 [2019-11-20 00:15:07,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 520 states and 705 transitions. [2019-11-20 00:15:07,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 00:15:07,708 INFO L688 BuchiCegarLoop]: Abstraction has 520 states and 705 transitions. [2019-11-20 00:15:07,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states and 705 transitions. [2019-11-20 00:15:07,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 260. [2019-11-20 00:15:07,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-20 00:15:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 345 transitions. [2019-11-20 00:15:07,748 INFO L711 BuchiCegarLoop]: Abstraction has 260 states and 345 transitions. [2019-11-20 00:15:07,748 INFO L591 BuchiCegarLoop]: Abstraction has 260 states and 345 transitions. [2019-11-20 00:15:07,748 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 00:15:07,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 345 transitions. [2019-11-20 00:15:07,751 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 186 [2019-11-20 00:15:07,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:15:07,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:15:07,752 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:07,752 INFO L850 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, 1] [2019-11-20 00:15:07,752 INFO L794 eck$LassoCheckResult]: Stem: 1174#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string6.base, #t~string6.offset, 1);call write~init~int(77, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(101, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(116, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(104, #t~string6.base, 4 + #t~string6.offset, 1);call write~init~int(58, #t~string6.base, 5 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 6 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string8.base, #t~string8.offset, 1);call write~init~int(82, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(73, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(84, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 4 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(75, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string12.base, #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 1 + #t~string12.offset, 1);~cleanupTimeShifts~0 := 4;~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);~head~0.base, ~head~0.offset := 0, 0;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25); 1130#L-1 havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~3, main_~tmp~1;havoc main_~retValue_acc~3;havoc main_~tmp~1; 1131#L923 havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 1209#L931 main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 1146#L281 assume 0 != main_~tmp~1; 1147#L253 ~switchedOnBeforeTS~0 := 0; 1168#L49 havoc test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1188#L70-1 [2019-11-20 00:15:07,753 INFO L796 eck$LassoCheckResult]: Loop: 1188#L70-1 assume !false; 1336#L481 assume test_~splverifierCounter~0 < 4; 1332#L482 test_~tmp~5 := test_#t~nondet34;havoc test_#t~nondet34; 1330#L490 assume !(0 != test_~tmp~5); 1326#L490-1 test_~tmp___0~2 := test_#t~nondet35;havoc test_#t~nondet35; 1324#L500 assume !(0 != test_~tmp___0~2); 1321#L500-1 test_~tmp___2~0 := test_#t~nondet36;havoc test_#t~nondet36; 1319#L510 assume 0 != test_~tmp___2~0; 1316#L516-2 havoc __utac_acc__Specification5_spec__2_#t~ret0;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 1315#L410 __utac_acc__Specification5_spec__2_#t~ret0 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret0;havoc __utac_acc__Specification5_spec__2_#t~ret0; 1314#L59 assume !(0 != ~pumpRunning~0); 1313#L307 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret14, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 1312#L339 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret33, isHighWaterLevel_~retValue_acc~6, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~6;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 1215#L181 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 1109#L186 isHighWaterLevel_#t~ret33 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret33;havoc isHighWaterLevel_#t~ret33; 1110#L459 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 1196#L459-2 isHighWaterLevel_~retValue_acc~6 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~6; 1177#L465 processEnvironment_#t~ret14 := isHighWaterLevel_#res;processEnvironment_~tmp~2 := processEnvironment_#t~ret14;havoc processEnvironment_#t~ret14; 1121#L343 assume !(0 != processEnvironment_~tmp~2); 1117#L314 havoc __utac_acc__Specification5_spec__3_#t~ret1, __utac_acc__Specification5_spec__3_#t~ret2, __utac_acc__Specification5_spec__3_~tmp~0, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~0;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;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; 1207#L173 __utac_acc__Specification5_spec__3_#t~ret1 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~0 := __utac_acc__Specification5_spec__3_#t~ret1;havoc __utac_acc__Specification5_spec__3_#t~ret1; 1208#L70 assume 2 != __utac_acc__Specification5_spec__3_~tmp~0;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 1154#L410-1 __utac_acc__Specification5_spec__3_#t~ret2 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~0 := __utac_acc__Specification5_spec__3_#t~ret2;havoc __utac_acc__Specification5_spec__3_#t~ret2; 1155#L74 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~0); 1188#L70-1 [2019-11-20 00:15:07,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:07,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2019-11-20 00:15:07,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:07,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134941470] [2019-11-20 00:15:07,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:15:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:15:07,835 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:15:07,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:07,836 INFO L82 PathProgramCache]: Analyzing trace with hash 732416842, now seen corresponding path program 1 times [2019-11-20 00:15:07,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:07,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32693737] [2019-11-20 00:15:07,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:15:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:15:07,858 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:15:07,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:07,859 INFO L82 PathProgramCache]: Analyzing trace with hash 591823504, now seen corresponding path program 1 times [2019-11-20 00:15:07,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:07,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850227242] [2019-11-20 00:15:07,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:15:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:15:07,963 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:15:08,155 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-11-20 00:15:38,215 WARN L191 SmtUtils]: Spent 29.97 s on a formula simplification. DAG size of input: 456 DAG size of output: 404 [2019-11-20 00:15:55,592 WARN L191 SmtUtils]: Spent 17.37 s on a formula simplification that was a NOOP. DAG size: 402 [2019-11-20 00:15:55,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 12:15:55 BoogieIcfgContainer [2019-11-20 00:15:55,677 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 00:15:55,678 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:15:55,678 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:15:55,678 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:15:55,679 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:15:06" (3/4) ... [2019-11-20 00:15:55,683 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-20 00:15:55,752 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2366578b-98df-4863-bd7e-c254d0b406e3/bin/uautomizer/witness.graphml [2019-11-20 00:15:55,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:15:55,754 INFO L168 Benchmark]: Toolchain (without parser) took 51070.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 946.1 MB in the beginning and 1.0 GB in the end (delta: -74.1 MB). Peak memory consumption was 121.5 MB. Max. memory is 11.5 GB. [2019-11-20 00:15:55,754 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:15:55,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 526.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:15:55,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.96 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:15:55,756 INFO L168 Benchmark]: Boogie Preprocessor took 42.04 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-11-20 00:15:55,757 INFO L168 Benchmark]: RCFGBuilder took 743.95 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:15:55,757 INFO L168 Benchmark]: BuchiAutomizer took 49616.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 36.7 MB). Peak memory consumption was 243.9 MB. Max. memory is 11.5 GB. [2019-11-20 00:15:55,758 INFO L168 Benchmark]: Witness Printer took 74.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:15:55,761 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 526.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.96 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.04 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 743.95 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 49616.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 36.7 MB). Peak memory consumption was 243.9 MB. Max. memory is 11.5 GB. * Witness Printer took 74.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 260 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 49.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 48.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 260 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 260 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 408 SDtfs, 1001 SDslu, 561 SDs, 0 SdLazy, 131 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 480]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=4007} State at position 1 is {NULL=0, NULL=4019, NULL=4007, retValue_acc=0, NULL=0, NULL=0, NULL=4023, methaneLevelCritical=0, NULL=4018, tmp___0=0, retValue_acc=1, NULL=0, NULL=0, tmp=0, NULL=0, NULL=0, NULL=4029, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@233a5c2c=0, tmp___1=0, tmp=1, retValue_acc=0, NULL=0, NULL=0, NULL=0, NULL=4021, NULL=4008, cleanupTimeShifts=4, switchedOnBeforeTS=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61104d33=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6358d6e2=66, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1034a9e3=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c191b5e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@728bc6f7=0, NULL=0, systemActive=1, waterLevel=1, NULL=4012, \result=1, NULL=0, NULL=0, NULL=4022, NULL=0, NULL=4017, \result=0, NULL=0, NULL=4016, NULL=0, NULL=0, NULL=0, NULL=4020, tmp___0=0, \result=1, retValue_acc=1, NULL=4034, head=0, pumpRunning=0, NULL=4028, \result=0, NULL=4033, tmp=1, retValue_acc=1, NULL=0, NULL=0, \result=1, NULL=4027, NULL=4014, NULL=4010, tmp=1, tmp___2=66, tmp___0=0, NULL=4032, NULL=4009, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64c6d25b=0, splverifierCounter=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71bf1d1f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@9ffedb=0, NULL=4013, NULL=4024, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e9c0a21=0, NULL=4031, tmp=0, head=0, NULL=0, NULL=0, NULL=4011, NULL=0, NULL=0, NULL=4030, NULL=0, NULL=4015, retValue_acc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L43] int switchedOnBeforeTS ; [L98] int waterLevel = 1; [L99] int methaneLevelCritical = 0; [L192] int cleanupTimeShifts = 4; [L297] int pumpRunning = 0; [L298] int systemActive = 1; [L704] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L272] int retValue_acc ; [L273] int tmp ; [L927] int retValue_acc ; [L930] retValue_acc = 1 [L931] return (retValue_acc); [L279] tmp = valid_product() [L281] COND TRUE \read(tmp) [L48] switchedOnBeforeTS = 0 [L471] int splverifierCounter ; [L472] int tmp ; [L473] int tmp___0 ; [L474] int tmp___1 ; [L475] int tmp___2 ; [L478] splverifierCounter = 0 Loop: [L480] COND TRUE 1 [L482] COND TRUE splverifierCounter < 4 [L488] tmp = __VERIFIER_nondet_int() [L490] COND FALSE !(\read(tmp)) [L498] tmp___0 = __VERIFIER_nondet_int() [L500] COND FALSE !(\read(tmp___0)) [L508] tmp___2 = __VERIFIER_nondet_int() [L510] COND TRUE \read(tmp___2) [L406] int retValue_acc ; [L409] retValue_acc = pumpRunning [L410] return (retValue_acc); [L57] switchedOnBeforeTS = isPumpRunning() [L307] COND FALSE !(\read(pumpRunning)) [L314] COND TRUE \read(systemActive) [L336] int tmp ; [L339] COND TRUE ! pumpRunning [L451] int retValue_acc ; [L452] int tmp ; [L453] int tmp___0 ; [L178] int retValue_acc ; [L181] COND TRUE waterLevel < 2 [L182] retValue_acc = 1 [L183] return (retValue_acc); [L457] tmp = isHighWaterSensorDry() [L459] COND TRUE \read(tmp) [L460] tmp___0 = 0 [L464] retValue_acc = tmp___0 [L465] return (retValue_acc); [L341] tmp = isHighWaterLevel() [L343] COND FALSE !(\read(tmp)) [L63] int tmp ; [L64] int tmp___0 ; [L169] int retValue_acc ; [L172] retValue_acc = waterLevel [L173] return (retValue_acc); [L68] tmp = getWaterLevel() [L70] COND TRUE tmp != 2 [L406] int retValue_acc ; [L409] retValue_acc = pumpRunning [L410] return (retValue_acc); [L72] tmp___0 = isPumpRunning() [L74] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...