./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec1_product44.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_6241ee00-4503-4ab0-8b83-5065ab0aea48/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6241ee00-4503-4ab0-8b83-5065ab0aea48/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6241ee00-4503-4ab0-8b83-5065ab0aea48/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6241ee00-4503-4ab0-8b83-5065ab0aea48/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6241ee00-4503-4ab0-8b83-5065ab0aea48/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6241ee00-4503-4ab0-8b83-5065ab0aea48/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 b18fc9f0044b48e81511337a91deb94a0dfeec26 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:23:26,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:26,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:26,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:26,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:26,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:26,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:26,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:26,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:26,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:26,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:26,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:26,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:26,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:26,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:26,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:26,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:26,997 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:26,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:27,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:27,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:27,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:27,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:27,004 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:27,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:27,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:27,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:27,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:27,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:27,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:27,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:27,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:27,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:27,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:27,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:27,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:27,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:27,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:27,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:27,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:27,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:27,018 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6241ee00-4503-4ab0-8b83-5065ab0aea48/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:23:27,031 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:27,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:27,032 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:27,032 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:27,032 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:27,032 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:27,032 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:23:27,033 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:27,033 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:27,033 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:23:27,033 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:23:27,033 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:27,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:27,034 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:27,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:23:27,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:27,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:27,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:23:27,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:27,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:23:27,035 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:27,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:23:27,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:23:27,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:27,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:27,036 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:27,036 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:27,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:27,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:27,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:27,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:23:27,036 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:23:27,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:23:27,037 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:23:27,037 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:27,037 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_6241ee00-4503-4ab0-8b83-5065ab0aea48/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 -> b18fc9f0044b48e81511337a91deb94a0dfeec26 [2019-10-22 11:23:27,060 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:27,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:27,074 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:27,076 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:27,076 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:27,077 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6241ee00-4503-4ab0-8b83-5065ab0aea48/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c [2019-10-22 11:23:27,122 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6241ee00-4503-4ab0-8b83-5065ab0aea48/bin/utaipan/data/1095bde51/49b93a933e80470198b8b107ba21e29c/FLAG48eee82c1 [2019-10-22 11:23:27,543 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:27,544 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6241ee00-4503-4ab0-8b83-5065ab0aea48/sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c [2019-10-22 11:23:27,553 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6241ee00-4503-4ab0-8b83-5065ab0aea48/bin/utaipan/data/1095bde51/49b93a933e80470198b8b107ba21e29c/FLAG48eee82c1 [2019-10-22 11:23:27,901 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6241ee00-4503-4ab0-8b83-5065ab0aea48/bin/utaipan/data/1095bde51/49b93a933e80470198b8b107ba21e29c [2019-10-22 11:23:27,903 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:27,903 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:27,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:27,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:27,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:27,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:27" (1/1) ... [2019-10-22 11:23:27,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df6e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:27, skipping insertion in model container [2019-10-22 11:23:27,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:27" (1/1) ... [2019-10-22 11:23:27,918 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:27,959 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:28,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:28,269 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:28,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:28,375 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:28,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:28 WrapperNode [2019-10-22 11:23:28,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:28,376 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:28,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:28,376 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:28,383 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:23:28" (1/1) ... [2019-10-22 11:23:28,397 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:23:28" (1/1) ... [2019-10-22 11:23:28,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:28,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:28,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:28,447 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:28,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:28" (1/1) ... [2019-10-22 11:23:28,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:28" (1/1) ... [2019-10-22 11:23:28,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:28" (1/1) ... [2019-10-22 11:23:28,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:28" (1/1) ... [2019-10-22 11:23:28,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:28" (1/1) ... [2019-10-22 11:23:28,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:28" (1/1) ... [2019-10-22 11:23:28,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:28" (1/1) ... [2019-10-22 11:23:28,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:28,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:28,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:28,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:28,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6241ee00-4503-4ab0-8b83-5065ab0aea48/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:23:28,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:23:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:23:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:28,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:29,280 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:29,280 INFO L284 CfgBuilder]: Removed 120 assume(true) statements. [2019-10-22 11:23:29,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:29 BoogieIcfgContainer [2019-10-22 11:23:29,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:29,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:29,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:29,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:29,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:27" (1/3) ... [2019-10-22 11:23:29,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9c468f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:29, skipping insertion in model container [2019-10-22 11:23:29,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:28" (2/3) ... [2019-10-22 11:23:29,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9c468f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:29, skipping insertion in model container [2019-10-22 11:23:29,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:29" (3/3) ... [2019-10-22 11:23:29,287 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product44.cil.c [2019-10-22 11:23:29,296 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:29,303 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:23:29,315 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:23:29,337 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:29,338 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:23:29,338 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:29,338 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:29,338 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:29,338 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:29,338 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:29,338 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:29,353 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-10-22 11:23:29,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:23:29,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:29,360 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:23:29,362 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:29,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:29,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1782116946, now seen corresponding path program 1 times [2019-10-22 11:23:29,375 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:29,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666196530] [2019-10-22 11:23:29,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:29,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:29,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:29,543 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:23:29,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666196530] [2019-10-22 11:23:29,549 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:29,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:29,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449435857] [2019-10-22 11:23:29,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:23:29,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:29,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:23:29,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:23:29,572 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 2 states. [2019-10-22 11:23:29,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:29,603 INFO L93 Difference]: Finished difference Result 172 states and 257 transitions. [2019-10-22 11:23:29,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:23:29,606 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-22 11:23:29,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:29,616 INFO L225 Difference]: With dead ends: 172 [2019-10-22 11:23:29,616 INFO L226 Difference]: Without dead ends: 85 [2019-10-22 11:23:29,619 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:23:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-22 11:23:29,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-10-22 11:23:29,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-22 11:23:29,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2019-10-22 11:23:29,657 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 16 [2019-10-22 11:23:29,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:29,657 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2019-10-22 11:23:29,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:23:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2019-10-22 11:23:29,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:23:29,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:29,659 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:23:29,659 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:29,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:29,659 INFO L82 PathProgramCache]: Analyzing trace with hash 735360049, now seen corresponding path program 1 times [2019-10-22 11:23:29,659 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:29,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402811191] [2019-10-22 11:23:29,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:29,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:29,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:29,757 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:23:29,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402811191] [2019-10-22 11:23:29,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:29,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:29,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45749839] [2019-10-22 11:23:29,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:29,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:29,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:29,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:29,762 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand 3 states. [2019-10-22 11:23:29,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:29,778 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2019-10-22 11:23:29,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:29,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 11:23:29,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:29,780 INFO L225 Difference]: With dead ends: 85 [2019-10-22 11:23:29,780 INFO L226 Difference]: Without dead ends: 39 [2019-10-22 11:23:29,781 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:23:29,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-22 11:23:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-22 11:23:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 11:23:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-10-22 11:23:29,793 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 17 [2019-10-22 11:23:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:29,793 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-10-22 11:23:29,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-10-22 11:23:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:23:29,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:29,794 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:23:29,795 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:29,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:29,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1297648259, now seen corresponding path program 1 times [2019-10-22 11:23:29,797 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:29,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331975938] [2019-10-22 11:23:29,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:29,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:29,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:29,877 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:23:29,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331975938] [2019-10-22 11:23:29,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:29,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:29,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790109116] [2019-10-22 11:23:29,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:29,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:29,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:29,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:29,879 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 5 states. [2019-10-22 11:23:29,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:29,938 INFO L93 Difference]: Finished difference Result 95 states and 138 transitions. [2019-10-22 11:23:29,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:23:29,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-22 11:23:29,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:29,939 INFO L225 Difference]: With dead ends: 95 [2019-10-22 11:23:29,939 INFO L226 Difference]: Without dead ends: 62 [2019-10-22 11:23:29,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:23:29,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-22 11:23:29,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2019-10-22 11:23:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-22 11:23:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2019-10-22 11:23:29,949 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 22 [2019-10-22 11:23:29,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:29,949 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2019-10-22 11:23:29,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:29,949 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2019-10-22 11:23:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:23:29,950 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:29,950 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:23:29,950 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:29,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:29,951 INFO L82 PathProgramCache]: Analyzing trace with hash -372126526, now seen corresponding path program 1 times [2019-10-22 11:23:29,951 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:29,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872716332] [2019-10-22 11:23:29,951 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:29,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:29,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:30,017 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:23:30,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872716332] [2019-10-22 11:23:30,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:30,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:30,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120646173] [2019-10-22 11:23:30,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:30,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:30,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:30,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:30,019 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 3 states. [2019-10-22 11:23:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:30,049 INFO L93 Difference]: Finished difference Result 131 states and 192 transitions. [2019-10-22 11:23:30,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:30,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 11:23:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:30,050 INFO L225 Difference]: With dead ends: 131 [2019-10-22 11:23:30,050 INFO L226 Difference]: Without dead ends: 79 [2019-10-22 11:23:30,051 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:23:30,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-22 11:23:30,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-10-22 11:23:30,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-22 11:23:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2019-10-22 11:23:30,059 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 23 [2019-10-22 11:23:30,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:30,060 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2019-10-22 11:23:30,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2019-10-22 11:23:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:23:30,060 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:30,061 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:23:30,061 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:30,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:30,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1852423790, now seen corresponding path program 1 times [2019-10-22 11:23:30,061 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:30,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280823599] [2019-10-22 11:23:30,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:30,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:30,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:30,114 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:23:30,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280823599] [2019-10-22 11:23:30,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:30,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:30,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337304099] [2019-10-22 11:23:30,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:30,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:30,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:30,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:30,116 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand 5 states. [2019-10-22 11:23:30,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:30,283 INFO L93 Difference]: Finished difference Result 371 states and 539 transitions. [2019-10-22 11:23:30,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:23:30,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-22 11:23:30,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:30,287 INFO L225 Difference]: With dead ends: 371 [2019-10-22 11:23:30,288 INFO L226 Difference]: Without dead ends: 300 [2019-10-22 11:23:30,288 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:23:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-22 11:23:30,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 140. [2019-10-22 11:23:30,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-22 11:23:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 196 transitions. [2019-10-22 11:23:30,321 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 196 transitions. Word has length 25 [2019-10-22 11:23:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:30,321 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 196 transitions. [2019-10-22 11:23:30,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 196 transitions. [2019-10-22 11:23:30,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:23:30,323 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:30,323 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:23:30,323 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:30,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:30,327 INFO L82 PathProgramCache]: Analyzing trace with hash -2056230884, now seen corresponding path program 1 times [2019-10-22 11:23:30,328 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:30,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815707632] [2019-10-22 11:23:30,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:30,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:30,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:30,409 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:23:30,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815707632] [2019-10-22 11:23:30,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:30,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:30,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777122900] [2019-10-22 11:23:30,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:30,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:30,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:30,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:30,411 INFO L87 Difference]: Start difference. First operand 140 states and 196 transitions. Second operand 5 states. [2019-10-22 11:23:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:30,531 INFO L93 Difference]: Finished difference Result 392 states and 553 transitions. [2019-10-22 11:23:30,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:23:30,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-22 11:23:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:30,534 INFO L225 Difference]: With dead ends: 392 [2019-10-22 11:23:30,534 INFO L226 Difference]: Without dead ends: 390 [2019-10-22 11:23:30,534 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:23:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-10-22 11:23:30,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 140. [2019-10-22 11:23:30,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-22 11:23:30,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-10-22 11:23:30,560 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 26 [2019-10-22 11:23:30,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:30,560 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-10-22 11:23:30,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-10-22 11:23:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 11:23:30,562 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:30,562 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:23:30,562 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:30,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:30,562 INFO L82 PathProgramCache]: Analyzing trace with hash 437867349, now seen corresponding path program 1 times [2019-10-22 11:23:30,563 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:30,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61752653] [2019-10-22 11:23:30,563 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:30,563 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:30,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:30,713 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:23:30,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61752653] [2019-10-22 11:23:30,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:30,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:30,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116619479] [2019-10-22 11:23:30,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:30,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:30,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:30,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:30,715 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 5 states. [2019-10-22 11:23:30,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:30,825 INFO L93 Difference]: Finished difference Result 426 states and 588 transitions. [2019-10-22 11:23:30,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:23:30,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-10-22 11:23:30,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:30,827 INFO L225 Difference]: With dead ends: 426 [2019-10-22 11:23:30,827 INFO L226 Difference]: Without dead ends: 292 [2019-10-22 11:23:30,828 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:23:30,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-22 11:23:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 146. [2019-10-22 11:23:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-22 11:23:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2019-10-22 11:23:30,848 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 200 transitions. Word has length 33 [2019-10-22 11:23:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:30,849 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 200 transitions. [2019-10-22 11:23:30,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 200 transitions. [2019-10-22 11:23:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 11:23:30,850 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:30,850 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:23:30,850 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:30,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:30,851 INFO L82 PathProgramCache]: Analyzing trace with hash -148938665, now seen corresponding path program 1 times [2019-10-22 11:23:30,851 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:30,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924966445] [2019-10-22 11:23:30,851 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:30,853 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:30,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:30,906 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:23:30,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924966445] [2019-10-22 11:23:30,907 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:30,907 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:30,907 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953772173] [2019-10-22 11:23:30,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:30,908 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:30,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:30,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:30,909 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. Second operand 4 states. [2019-10-22 11:23:30,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:30,971 INFO L93 Difference]: Finished difference Result 370 states and 506 transitions. [2019-10-22 11:23:30,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:30,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-10-22 11:23:30,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:30,974 INFO L225 Difference]: With dead ends: 370 [2019-10-22 11:23:30,974 INFO L226 Difference]: Without dead ends: 230 [2019-10-22 11:23:30,975 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:30,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-22 11:23:30,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 150. [2019-10-22 11:23:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-22 11:23:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 204 transitions. [2019-10-22 11:23:30,993 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 204 transitions. Word has length 33 [2019-10-22 11:23:30,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:30,993 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 204 transitions. [2019-10-22 11:23:30,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 204 transitions. [2019-10-22 11:23:30,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 11:23:30,998 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:30,999 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:23:30,999 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:30,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:30,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1428802343, now seen corresponding path program 1 times [2019-10-22 11:23:30,999 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:30,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739023004] [2019-10-22 11:23:31,000 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:31,000 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:31,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:31,045 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:23:31,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739023004] [2019-10-22 11:23:31,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:31,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:31,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421845039] [2019-10-22 11:23:31,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:31,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:31,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:31,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:31,047 INFO L87 Difference]: Start difference. First operand 150 states and 204 transitions. Second operand 3 states. [2019-10-22 11:23:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:31,083 INFO L93 Difference]: Finished difference Result 380 states and 516 transitions. [2019-10-22 11:23:31,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:31,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-22 11:23:31,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:31,085 INFO L225 Difference]: With dead ends: 380 [2019-10-22 11:23:31,085 INFO L226 Difference]: Without dead ends: 236 [2019-10-22 11:23:31,085 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:23:31,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-10-22 11:23:31,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2019-10-22 11:23:31,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-22 11:23:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 312 transitions. [2019-10-22 11:23:31,109 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 312 transitions. Word has length 33 [2019-10-22 11:23:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:31,111 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 312 transitions. [2019-10-22 11:23:31,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 312 transitions. [2019-10-22 11:23:31,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 11:23:31,112 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:31,112 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:23:31,113 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:31,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:31,113 INFO L82 PathProgramCache]: Analyzing trace with hash -271506405, now seen corresponding path program 1 times [2019-10-22 11:23:31,113 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:31,113 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194531657] [2019-10-22 11:23:31,113 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:31,113 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:31,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:31,178 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:23:31,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194531657] [2019-10-22 11:23:31,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:31,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:23:31,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612349694] [2019-10-22 11:23:31,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:23:31,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:31,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:23:31,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:31,180 INFO L87 Difference]: Start difference. First operand 236 states and 312 transitions. Second operand 6 states. [2019-10-22 11:23:31,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:31,368 INFO L93 Difference]: Finished difference Result 726 states and 964 transitions. [2019-10-22 11:23:31,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:23:31,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-10-22 11:23:31,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:31,370 INFO L225 Difference]: With dead ends: 726 [2019-10-22 11:23:31,370 INFO L226 Difference]: Without dead ends: 496 [2019-10-22 11:23:31,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:23:31,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-10-22 11:23:31,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 236. [2019-10-22 11:23:31,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-22 11:23:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 306 transitions. [2019-10-22 11:23:31,395 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 306 transitions. Word has length 34 [2019-10-22 11:23:31,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:31,395 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 306 transitions. [2019-10-22 11:23:31,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:23:31,395 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 306 transitions. [2019-10-22 11:23:31,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 11:23:31,396 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:31,396 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:23:31,396 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:31,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:31,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1907454321, now seen corresponding path program 1 times [2019-10-22 11:23:31,397 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:31,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210766431] [2019-10-22 11:23:31,397 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:31,397 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:31,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:23:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:23:31,896 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:23:31,897 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:23:31,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:23:31 BoogieIcfgContainer [2019-10-22 11:23:31,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:23:31,984 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:23:31,984 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:23:31,984 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:23:31,985 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:29" (3/4) ... [2019-10-22 11:23:31,987 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:23:32,079 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6241ee00-4503-4ab0-8b83-5065ab0aea48/bin/utaipan/witness.graphml [2019-10-22 11:23:32,079 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:23:32,081 INFO L168 Benchmark]: Toolchain (without parser) took 4177.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 941.0 MB in the beginning and 877.5 MB in the end (delta: 63.5 MB). Peak memory consumption was 205.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:32,082 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:32,082 INFO L168 Benchmark]: CACSL2BoogieTranslator took 471.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:32,082 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.73 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-10-22 11:23:32,082 INFO L168 Benchmark]: Boogie Preprocessor took 55.52 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-10-22 11:23:32,083 INFO L168 Benchmark]: RCFGBuilder took 778.67 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: 66.7 MB). Peak memory consumption was 66.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:32,083 INFO L168 Benchmark]: TraceAbstraction took 2701.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 900.1 MB in the end (delta: 153.7 MB). Peak memory consumption was 153.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:32,084 INFO L168 Benchmark]: Witness Printer took 95.38 ms. Allocated memory is still 1.2 GB. Free memory was 900.1 MB in the beginning and 877.5 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:32,085 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 471.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.73 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 55.52 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 778.67 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: 66.7 MB). Peak memory consumption was 66.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2701.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 900.1 MB in the end (delta: 153.7 MB). Peak memory consumption was 153.7 MB. Max. memory is 11.5 GB. * Witness Printer took 95.38 ms. Allocated memory is still 1.2 GB. Free memory was 900.1 MB in the beginning and 877.5 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 44]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L218] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L498] int pumpRunning = 0; [L499] int systemActive = 1; [L693] int waterLevel = 1; [L694] int methaneLevelCritical = 0; [L851] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L924] int retValue_acc ; [L925] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L842] int retValue_acc ; [L845] retValue_acc = 1 [L846] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L931] tmp = valid_product() [L933] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L422] int splverifierCounter ; [L423] int tmp ; [L424] int tmp___0 ; [L425] int tmp___1 ; [L426] int tmp___2 ; [L429] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L431] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L433] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L439] tmp = __VERIFIER_nondet_int() [L441] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L711] COND TRUE waterLevel < 2 [L712] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L449] tmp___0 = __VERIFIER_nondet_int() [L451] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L459] tmp___2 = __VERIFIER_nondet_int() [L461] COND TRUE \read(tmp___2) [L687] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L506] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L513] COND TRUE \read(systemActive) [L535] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L538] COND TRUE ! pumpRunning [L650] int retValue_acc ; [L651] int tmp ; [L652] int tmp___0 ; [L773] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L776] COND FALSE !(waterLevel < 2) [L780] retValue_acc = 0 [L781] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L656] tmp = isHighWaterSensorDry() [L658] COND FALSE !(\read(tmp)) [L661] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L663] retValue_acc = tmp___0 [L664] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L540] tmp = isHighWaterLevel() [L542] COND TRUE \read(tmp) [L569] int tmp ; [L594] int retValue_acc ; [L732] int retValue_acc ; [L735] retValue_acc = methaneLevelCritical [L736] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L598] retValue_acc = isMethaneLevelCritical() [L600] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L573] tmp = isMethaneAlarm() [L575] COND FALSE !(\read(tmp)) [L563] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L788] int tmp ; [L789] int tmp___0 ; [L732] int retValue_acc ; [L735] retValue_acc = methaneLevelCritical [L736] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L793] tmp = isMethaneLevelCritical() [L795] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L431] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L433] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L439] tmp = __VERIFIER_nondet_int() [L441] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L449] tmp___0 = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L723] COND FALSE !(\read(methaneLevelCritical)) [L726] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L459] tmp___2 = __VERIFIER_nondet_int() [L461] COND TRUE \read(tmp___2) [L687] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L506] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L699] COND TRUE waterLevel > 0 [L700] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L513] COND TRUE \read(systemActive) [L535] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L538] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L788] int tmp ; [L789] int tmp___0 ; [L732] int retValue_acc ; [L735] retValue_acc = methaneLevelCritical [L736] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L793] tmp = isMethaneLevelCritical() [L795] COND TRUE \read(tmp) [L605] int retValue_acc ; [L608] retValue_acc = pumpRunning [L609] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L797] tmp___0 = isPumpRunning() [L799] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L44] __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: 2.6s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 821 SDtfs, 1204 SDslu, 1337 SDs, 0 SdLazy, 175 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 902 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 12350 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...