./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec1_product43.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_49ebe0d9-34f6-406b-b467-eb4785dea919/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_49ebe0d9-34f6-406b-b467-eb4785dea919/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_49ebe0d9-34f6-406b-b467-eb4785dea919/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_49ebe0d9-34f6-406b-b467-eb4785dea919/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec1_product43.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_49ebe0d9-34f6-406b-b467-eb4785dea919/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_49ebe0d9-34f6-406b-b467-eb4785dea919/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 63b48aee14c7431a4aa25f8de4f2dd8129d50ad4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:25:42,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:25:42,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:25:42,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:25:42,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:25:42,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:25:42,404 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:25:42,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:25:42,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:25:42,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:25:42,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:25:42,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:25:42,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:25:42,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:25:42,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:25:42,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:25:42,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:25:42,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:25:42,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:25:42,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:25:42,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:25:42,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:25:42,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:25:42,422 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:25:42,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:25:42,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:25:42,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:25:42,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:25:42,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:25:42,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:25:42,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:25:42,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:25:42,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:25:42,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:25:42,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:25:42,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:25:42,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:25:42,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:25:42,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:25:42,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:25:42,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:25:42,433 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_49ebe0d9-34f6-406b-b467-eb4785dea919/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:25:42,445 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:25:42,445 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:25:42,446 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:25:42,446 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:25:42,446 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:25:42,446 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:25:42,446 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:25:42,446 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:25:42,447 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:25:42,447 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:25:42,447 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:25:42,447 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:25:42,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:25:42,448 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:25:42,449 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:25:42,449 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:25:42,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:25:42,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:25:42,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:25:42,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:25:42,450 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:25:42,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:25:42,450 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:25:42,450 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:25:42,450 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:25:42,450 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:25:42,450 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:25:42,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:25:42,451 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:25:42,451 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:25:42,451 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:25:42,451 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:25:42,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:25:42,451 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:25:42,452 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:25:42,452 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_49ebe0d9-34f6-406b-b467-eb4785dea919/bin/utaipan 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(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 63b48aee14c7431a4aa25f8de4f2dd8129d50ad4 [2019-10-22 11:25:42,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:25:42,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:25:42,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:25:42,507 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:25:42,508 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:25:42,508 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_49ebe0d9-34f6-406b-b467-eb4785dea919/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec1_product43.cil.c [2019-10-22 11:25:42,563 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_49ebe0d9-34f6-406b-b467-eb4785dea919/bin/utaipan/data/5b050786e/66d6d2eedb43429ba11d5e89dad9a2e4/FLAGae8467cf1 [2019-10-22 11:25:43,004 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:25:43,005 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_49ebe0d9-34f6-406b-b467-eb4785dea919/sv-benchmarks/c/product-lines/minepump_spec1_product43.cil.c [2019-10-22 11:25:43,015 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_49ebe0d9-34f6-406b-b467-eb4785dea919/bin/utaipan/data/5b050786e/66d6d2eedb43429ba11d5e89dad9a2e4/FLAGae8467cf1 [2019-10-22 11:25:43,527 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_49ebe0d9-34f6-406b-b467-eb4785dea919/bin/utaipan/data/5b050786e/66d6d2eedb43429ba11d5e89dad9a2e4 [2019-10-22 11:25:43,529 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:25:43,530 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:25:43,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:43,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:25:43,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:25:43,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:43" (1/1) ... [2019-10-22 11:25:43,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9160ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:43, skipping insertion in model container [2019-10-22 11:25:43,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:43" (1/1) ... [2019-10-22 11:25:43,545 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:25:43,607 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:25:43,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:44,015 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:25:44,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:44,184 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:25:44,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44 WrapperNode [2019-10-22 11:25:44,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:44,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:44,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:25:44,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:25:44,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... [2019-10-22 11:25:44,215 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... [2019-10-22 11:25:44,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:44,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:25:44,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:25:44,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:25:44,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... [2019-10-22 11:25:44,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... [2019-10-22 11:25:44,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... [2019-10-22 11:25:44,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... [2019-10-22 11:25:44,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... [2019-10-22 11:25:44,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... [2019-10-22 11:25:44,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... [2019-10-22 11:25:44,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:25:44,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:25:44,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:25:44,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:25:44,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49ebe0d9-34f6-406b-b467-eb4785dea919/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:25:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:25:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:25:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:25:44,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:25:45,062 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:25:45,062 INFO L284 CfgBuilder]: Removed 118 assume(true) statements. [2019-10-22 11:25:45,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:45 BoogieIcfgContainer [2019-10-22 11:25:45,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:25:45,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:25:45,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:25:45,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:25:45,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:25:43" (1/3) ... [2019-10-22 11:25:45,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee550f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:45, skipping insertion in model container [2019-10-22 11:25:45,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (2/3) ... [2019-10-22 11:25:45,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee550f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:45, skipping insertion in model container [2019-10-22 11:25:45,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:45" (3/3) ... [2019-10-22 11:25:45,075 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product43.cil.c [2019-10-22 11:25:45,088 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:25:45,098 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:25:45,107 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:25:45,131 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:25:45,131 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:25:45,132 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:25:45,132 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:25:45,132 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:25:45,132 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:25:45,132 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:25:45,132 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:25:45,150 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-10-22 11:25:45,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:25:45,163 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:45,164 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:45,166 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:45,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:45,170 INFO L82 PathProgramCache]: Analyzing trace with hash 929673937, now seen corresponding path program 1 times [2019-10-22 11:25:45,177 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:45,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492402894] [2019-10-22 11:25:45,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:45,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:45,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:45,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492402894] [2019-10-22 11:25:45,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:45,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:45,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672276002] [2019-10-22 11:25:45,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:25:45,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:45,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:25:45,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:25:45,425 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 2 states. [2019-10-22 11:25:45,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:45,454 INFO L93 Difference]: Finished difference Result 172 states and 257 transitions. [2019-10-22 11:25:45,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:25:45,456 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-22 11:25:45,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:45,467 INFO L225 Difference]: With dead ends: 172 [2019-10-22 11:25:45,468 INFO L226 Difference]: Without dead ends: 85 [2019-10-22 11:25:45,471 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:25:45,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-22 11:25:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-10-22 11:25:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-22 11:25:45,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2019-10-22 11:25:45,513 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 16 [2019-10-22 11:25:45,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:45,514 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2019-10-22 11:25:45,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:25:45,514 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2019-10-22 11:25:45,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:25:45,515 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:45,515 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:45,515 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:45,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:45,516 INFO L82 PathProgramCache]: Analyzing trace with hash -117082960, now seen corresponding path program 1 times [2019-10-22 11:25:45,516 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:45,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26118194] [2019-10-22 11:25:45,516 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:45,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:45,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:45,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26118194] [2019-10-22 11:25:45,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:45,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:45,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408320881] [2019-10-22 11:25:45,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:45,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:45,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:45,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:45,666 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand 3 states. [2019-10-22 11:25:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:45,683 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2019-10-22 11:25:45,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:45,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 11:25:45,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:45,685 INFO L225 Difference]: With dead ends: 85 [2019-10-22 11:25:45,685 INFO L226 Difference]: Without dead ends: 39 [2019-10-22 11:25:45,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:45,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-22 11:25:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-22 11:25:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 11:25:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-10-22 11:25:45,691 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 17 [2019-10-22 11:25:45,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:45,691 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-10-22 11:25:45,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-10-22 11:25:45,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:25:45,692 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:45,692 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:45,692 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:45,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:45,693 INFO L82 PathProgramCache]: Analyzing trace with hash 337421565, now seen corresponding path program 1 times [2019-10-22 11:25:45,693 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:45,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993750884] [2019-10-22 11:25:45,693 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:45,693 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:45,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:45,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993750884] [2019-10-22 11:25:45,769 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:45,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:45,769 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425291396] [2019-10-22 11:25:45,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:25:45,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:45,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:25:45,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:25:45,770 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 6 states. [2019-10-22 11:25:45,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:45,896 INFO L93 Difference]: Finished difference Result 128 states and 187 transitions. [2019-10-22 11:25:45,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:25:45,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-10-22 11:25:45,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:45,897 INFO L225 Difference]: With dead ends: 128 [2019-10-22 11:25:45,897 INFO L226 Difference]: Without dead ends: 95 [2019-10-22 11:25:45,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:25:45,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-22 11:25:45,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 58. [2019-10-22 11:25:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-22 11:25:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2019-10-22 11:25:45,906 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 22 [2019-10-22 11:25:45,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:45,906 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2019-10-22 11:25:45,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:25:45,907 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2019-10-22 11:25:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:25:45,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:45,907 INFO L380 BasicCegarLoop]: trace 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-10-22 11:25:45,908 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:45,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:45,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1224569535, now seen corresponding path program 1 times [2019-10-22 11:25:45,908 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:45,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604861886] [2019-10-22 11:25:45,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:45,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:45,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:45,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:45,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604861886] [2019-10-22 11:25:45,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:45,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:45,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754412644] [2019-10-22 11:25:45,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:45,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:45,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:45,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:45,985 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 3 states. [2019-10-22 11:25:46,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:46,039 INFO L93 Difference]: Finished difference Result 131 states and 192 transitions. [2019-10-22 11:25:46,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:46,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 11:25:46,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:46,041 INFO L225 Difference]: With dead ends: 131 [2019-10-22 11:25:46,041 INFO L226 Difference]: Without dead ends: 79 [2019-10-22 11:25:46,042 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:46,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-22 11:25:46,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-10-22 11:25:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-22 11:25:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2019-10-22 11:25:46,061 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 23 [2019-10-22 11:25:46,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:46,061 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2019-10-22 11:25:46,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:46,061 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2019-10-22 11:25:46,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:25:46,062 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:46,062 INFO L380 BasicCegarLoop]: trace 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, 1] [2019-10-22 11:25:46,062 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:46,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:46,062 INFO L82 PathProgramCache]: Analyzing trace with hash -840484654, now seen corresponding path program 1 times [2019-10-22 11:25:46,063 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:46,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809462781] [2019-10-22 11:25:46,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:46,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:46,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:46,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809462781] [2019-10-22 11:25:46,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:46,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:46,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462678617] [2019-10-22 11:25:46,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:46,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:46,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:46,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:46,150 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand 5 states. [2019-10-22 11:25:46,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:46,296 INFO L93 Difference]: Finished difference Result 371 states and 539 transitions. [2019-10-22 11:25:46,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:25:46,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-22 11:25:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:46,299 INFO L225 Difference]: With dead ends: 371 [2019-10-22 11:25:46,299 INFO L226 Difference]: Without dead ends: 300 [2019-10-22 11:25:46,300 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:25:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-22 11:25:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 140. [2019-10-22 11:25:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-22 11:25:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 196 transitions. [2019-10-22 11:25:46,323 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 196 transitions. Word has length 25 [2019-10-22 11:25:46,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:46,323 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 196 transitions. [2019-10-22 11:25:46,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:46,323 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 196 transitions. [2019-10-22 11:25:46,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:25:46,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:46,325 INFO L380 BasicCegarLoop]: trace 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, 1, 1] [2019-10-22 11:25:46,325 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:46,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:46,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1044291748, now seen corresponding path program 1 times [2019-10-22 11:25:46,326 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:46,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559092744] [2019-10-22 11:25:46,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:46,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:46,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:46,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559092744] [2019-10-22 11:25:46,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:46,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:46,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594604262] [2019-10-22 11:25:46,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:46,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:46,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:46,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:46,453 INFO L87 Difference]: Start difference. First operand 140 states and 196 transitions. Second operand 5 states. [2019-10-22 11:25:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:46,589 INFO L93 Difference]: Finished difference Result 392 states and 553 transitions. [2019-10-22 11:25:46,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:25:46,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-22 11:25:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:46,593 INFO L225 Difference]: With dead ends: 392 [2019-10-22 11:25:46,593 INFO L226 Difference]: Without dead ends: 390 [2019-10-22 11:25:46,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:25:46,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-10-22 11:25:46,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 140. [2019-10-22 11:25:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-22 11:25:46,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-10-22 11:25:46,638 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 26 [2019-10-22 11:25:46,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:46,638 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-10-22 11:25:46,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:46,638 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-10-22 11:25:46,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 11:25:46,640 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:46,640 INFO L380 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:46,643 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:46,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:46,643 INFO L82 PathProgramCache]: Analyzing trace with hash 895513141, now seen corresponding path program 1 times [2019-10-22 11:25:46,643 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:46,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816656849] [2019-10-22 11:25:46,644 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:46,644 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:46,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:46,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816656849] [2019-10-22 11:25:46,719 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:46,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:46,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121872027] [2019-10-22 11:25:46,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:46,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:46,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:46,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:46,722 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 5 states. [2019-10-22 11:25:46,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:46,785 INFO L93 Difference]: Finished difference Result 426 states and 588 transitions. [2019-10-22 11:25:46,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:25:46,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-10-22 11:25:46,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:46,788 INFO L225 Difference]: With dead ends: 426 [2019-10-22 11:25:46,788 INFO L226 Difference]: Without dead ends: 292 [2019-10-22 11:25:46,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:46,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-22 11:25:46,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 146. [2019-10-22 11:25:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-22 11:25:46,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2019-10-22 11:25:46,819 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 200 transitions. Word has length 33 [2019-10-22 11:25:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:46,820 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 200 transitions. [2019-10-22 11:25:46,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 200 transitions. [2019-10-22 11:25:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 11:25:46,822 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:46,822 INFO L380 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:46,822 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:46,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:46,823 INFO L82 PathProgramCache]: Analyzing trace with hash 308707127, now seen corresponding path program 1 times [2019-10-22 11:25:46,823 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:46,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333450661] [2019-10-22 11:25:46,823 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:46,823 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:46,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:46,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:46,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333450661] [2019-10-22 11:25:46,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:46,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:25:46,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104599230] [2019-10-22 11:25:46,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:25:46,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:46,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:25:46,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:25:46,905 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. Second operand 6 states. [2019-10-22 11:25:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:47,001 INFO L93 Difference]: Finished difference Result 444 states and 606 transitions. [2019-10-22 11:25:47,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:25:47,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-10-22 11:25:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:47,003 INFO L225 Difference]: With dead ends: 444 [2019-10-22 11:25:47,003 INFO L226 Difference]: Without dead ends: 304 [2019-10-22 11:25:47,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:25:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-10-22 11:25:47,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 150. [2019-10-22 11:25:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-22 11:25:47,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 204 transitions. [2019-10-22 11:25:47,025 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 204 transitions. Word has length 33 [2019-10-22 11:25:47,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:47,025 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 204 transitions. [2019-10-22 11:25:47,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:25:47,025 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 204 transitions. [2019-10-22 11:25:47,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 11:25:47,026 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:47,027 INFO L380 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:47,027 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:47,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:47,027 INFO L82 PathProgramCache]: Analyzing trace with hash -971156551, now seen corresponding path program 1 times [2019-10-22 11:25:47,027 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:47,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068852800] [2019-10-22 11:25:47,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:47,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:47,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:47,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:47,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068852800] [2019-10-22 11:25:47,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:47,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:47,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701539686] [2019-10-22 11:25:47,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:47,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:47,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:47,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:47,074 INFO L87 Difference]: Start difference. First operand 150 states and 204 transitions. Second operand 3 states. [2019-10-22 11:25:47,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:47,111 INFO L93 Difference]: Finished difference Result 380 states and 516 transitions. [2019-10-22 11:25:47,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:47,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-22 11:25:47,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:47,113 INFO L225 Difference]: With dead ends: 380 [2019-10-22 11:25:47,113 INFO L226 Difference]: Without dead ends: 236 [2019-10-22 11:25:47,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-10-22 11:25:47,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2019-10-22 11:25:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-22 11:25:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 312 transitions. [2019-10-22 11:25:47,141 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 312 transitions. Word has length 33 [2019-10-22 11:25:47,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:47,141 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 312 transitions. [2019-10-22 11:25:47,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 312 transitions. [2019-10-22 11:25:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 11:25:47,143 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:47,143 INFO L380 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:47,143 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:47,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:47,143 INFO L82 PathProgramCache]: Analyzing trace with hash 186139387, now seen corresponding path program 1 times [2019-10-22 11:25:47,143 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:47,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636935347] [2019-10-22 11:25:47,144 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:47,144 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:47,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:47,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:47,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636935347] [2019-10-22 11:25:47,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:47,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:25:47,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18009266] [2019-10-22 11:25:47,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:25:47,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:47,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:25:47,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:25:47,212 INFO L87 Difference]: Start difference. First operand 236 states and 312 transitions. Second operand 8 states. [2019-10-22 11:25:47,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:47,632 INFO L93 Difference]: Finished difference Result 874 states and 1160 transitions. [2019-10-22 11:25:47,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 11:25:47,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-10-22 11:25:47,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:47,635 INFO L225 Difference]: With dead ends: 874 [2019-10-22 11:25:47,635 INFO L226 Difference]: Without dead ends: 644 [2019-10-22 11:25:47,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-10-22 11:25:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-10-22 11:25:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 236. [2019-10-22 11:25:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-22 11:25:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 306 transitions. [2019-10-22 11:25:47,666 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 306 transitions. Word has length 34 [2019-10-22 11:25:47,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:47,667 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 306 transitions. [2019-10-22 11:25:47,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:25:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 306 transitions. [2019-10-22 11:25:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 11:25:47,668 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:47,668 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:25:47,668 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:47,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:47,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1466712466, now seen corresponding path program 1 times [2019-10-22 11:25:47,669 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:47,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624528298] [2019-10-22 11:25:47,669 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:47,669 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:47,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:25:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:25:48,411 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:25:48,411 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:25:48,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:25:48 BoogieIcfgContainer [2019-10-22 11:25:48,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:25:48,524 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:25:48,525 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:25:48,525 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:25:48,525 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:45" (3/4) ... [2019-10-22 11:25:48,527 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:25:48,642 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_49ebe0d9-34f6-406b-b467-eb4785dea919/bin/utaipan/witness.graphml [2019-10-22 11:25:48,643 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:25:48,645 INFO L168 Benchmark]: Toolchain (without parser) took 5115.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 944.5 MB in the beginning and 911.0 MB in the end (delta: 33.5 MB). Peak memory consumption was 250.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:48,646 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:25:48,646 INFO L168 Benchmark]: CACSL2BoogieTranslator took 654.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:48,647 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.82 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:48,647 INFO L168 Benchmark]: Boogie Preprocessor took 37.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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:48,648 INFO L168 Benchmark]: RCFGBuilder took 752.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.0 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:48,648 INFO L168 Benchmark]: TraceAbstraction took 3459.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 90.7 MB). Free memory was 1.0 GB in the beginning and 939.8 MB in the end (delta: 93.8 MB). Peak memory consumption was 184.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:48,648 INFO L168 Benchmark]: Witness Printer took 119.09 ms. Allocated memory is still 1.2 GB. Free memory was 939.8 MB in the beginning and 911.0 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:48,650 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 654.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.82 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 752.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.0 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3459.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 90.7 MB). Free memory was 1.0 GB in the beginning and 939.8 MB in the end (delta: 93.8 MB). Peak memory consumption was 184.5 MB. Max. memory is 11.5 GB. * Witness Printer took 119.09 ms. Allocated memory is still 1.2 GB. Free memory was 939.8 MB in the beginning and 911.0 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 405]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L147] int pumpRunning = 0; [L148] int systemActive = 1; [L436] int cleanupTimeShifts = 4; [L704] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L512] int retValue_acc ; [L513] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L927] int retValue_acc ; [L930] retValue_acc = 1 [L931] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L519] tmp = valid_product() [L521] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L335] int splverifierCounter ; [L336] int tmp ; [L337] int tmp___0 ; [L338] int tmp___1 ; [L339] int tmp___2 ; [L342] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L344] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L346] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L352] tmp = __VERIFIER_nondet_int() [L354] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L65] COND TRUE waterLevel < 2 [L66] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L362] tmp___0 = __VERIFIER_nondet_int() [L364] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L372] tmp___2 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L155] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L162] COND TRUE \read(systemActive) [L184] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L187] COND TRUE ! pumpRunning [L299] int retValue_acc ; [L300] int tmp ; [L301] int tmp___0 ; [L127] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L130] COND FALSE !(waterLevel < 2) [L134] retValue_acc = 0 [L135] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L305] tmp = isHighWaterSensorDry() [L307] COND FALSE !(\read(tmp)) [L310] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L312] retValue_acc = tmp___0 [L313] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L189] tmp = isHighWaterLevel() [L191] COND TRUE \read(tmp) [L218] int tmp ; [L243] int retValue_acc ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L247] retValue_acc = isMethaneLevelCritical() [L249] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L222] tmp = isMethaneAlarm() [L224] COND FALSE !(\read(tmp)) [L212] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L411] int tmp ; [L412] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L416] tmp = isMethaneLevelCritical() [L418] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L344] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L346] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L352] tmp = __VERIFIER_nondet_int() [L354] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L362] tmp___0 = __VERIFIER_nondet_int() [L364] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L77] COND FALSE !(\read(methaneLevelCritical)) [L80] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L372] tmp___2 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L155] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L53] COND TRUE waterLevel > 0 [L54] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L162] COND TRUE \read(systemActive) [L184] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L187] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L411] int tmp ; [L412] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L416] tmp = isMethaneLevelCritical() [L418] COND TRUE \read(tmp) [L254] int retValue_acc ; [L257] retValue_acc = pumpRunning [L258] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L420] tmp___0 = isPumpRunning() [L422] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L405] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 89 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.3s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 870 SDtfs, 1375 SDslu, 1757 SDs, 0 SdLazy, 219 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1157 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 13787 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...