./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec1_product39.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_259856dd-82d3-4edf-a399-3b1a649843e6/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_259856dd-82d3-4edf-a399-3b1a649843e6/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_259856dd-82d3-4edf-a399-3b1a649843e6/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_259856dd-82d3-4edf-a399-3b1a649843e6/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec1_product39.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_259856dd-82d3-4edf-a399-3b1a649843e6/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_259856dd-82d3-4edf-a399-3b1a649843e6/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 f2f38c4f83f0a2ec969b4b77f5129e3dfefde6fe ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:20:55,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:20:55,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:20:55,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:20:55,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:20:55,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:20:55,226 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:20:55,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:20:55,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:20:55,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:20:55,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:20:55,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:20:55,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:20:55,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:20:55,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:20:55,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:20:55,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:20:55,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:20:55,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:20:55,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:20:55,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:20:55,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:20:55,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:20:55,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:20:55,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:20:55,246 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:20:55,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:20:55,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:20:55,247 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:20:55,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:20:55,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:20:55,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:20:55,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:20:55,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:20:55,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:20:55,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:20:55,252 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:20:55,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:20:55,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:20:55,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:20:55,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:20:55,254 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_259856dd-82d3-4edf-a399-3b1a649843e6/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:20:55,265 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:20:55,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:20:55,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:20:55,266 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:20:55,266 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:20:55,266 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:20:55,266 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:20:55,267 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:20:55,267 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:20:55,267 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:20:55,267 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:20:55,267 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:20:55,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:20:55,268 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:20:55,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:20:55,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:20:55,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:20:55,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:20:55,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:20:55,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:20:55,269 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:20:55,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:20:55,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:20:55,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:20:55,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:20:55,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:20:55,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:20:55,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:20:55,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:20:55,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:20:55,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:20:55,272 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:20:55,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:20:55,272 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:20:55,272 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:20:55,272 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_259856dd-82d3-4edf-a399-3b1a649843e6/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 -> f2f38c4f83f0a2ec969b4b77f5129e3dfefde6fe [2019-10-22 11:20:55,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:20:55,307 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:20:55,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:20:55,311 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:20:55,312 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:20:55,312 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_259856dd-82d3-4edf-a399-3b1a649843e6/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec1_product39.cil.c [2019-10-22 11:20:55,362 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_259856dd-82d3-4edf-a399-3b1a649843e6/bin/utaipan/data/859332747/5d7c4824fc0e4e78820fb72198f33856/FLAG7bba54322 [2019-10-22 11:20:55,790 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:20:55,791 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_259856dd-82d3-4edf-a399-3b1a649843e6/sv-benchmarks/c/product-lines/minepump_spec1_product39.cil.c [2019-10-22 11:20:55,800 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_259856dd-82d3-4edf-a399-3b1a649843e6/bin/utaipan/data/859332747/5d7c4824fc0e4e78820fb72198f33856/FLAG7bba54322 [2019-10-22 11:20:56,159 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_259856dd-82d3-4edf-a399-3b1a649843e6/bin/utaipan/data/859332747/5d7c4824fc0e4e78820fb72198f33856 [2019-10-22 11:20:56,161 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:20:56,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:20:56,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:20:56,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:20:56,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:20:56,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3234252b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56, skipping insertion in model container [2019-10-22 11:20:56,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,175 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:20:56,210 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:20:56,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:20:56,503 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:20:56,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:20:56,639 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:20:56,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56 WrapperNode [2019-10-22 11:20:56,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:20:56,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:20:56,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:20:56,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:20:56,648 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:20:56" (1/1) ... [2019-10-22 11:20:56,666 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:20:56" (1/1) ... [2019-10-22 11:20:56,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:20:56,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:20:56,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:20:56,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:20:56,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:20:56,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:20:56,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:20:56,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:20:56,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_259856dd-82d3-4edf-a399-3b1a649843e6/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:20:56,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:20:56,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:20:56,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:20:56,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:20:57,647 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:20:57,647 INFO L284 CfgBuilder]: Removed 160 assume(true) statements. [2019-10-22 11:20:57,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:57 BoogieIcfgContainer [2019-10-22 11:20:57,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:20:57,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:20:57,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:20:57,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:20:57,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:20:56" (1/3) ... [2019-10-22 11:20:57,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4373e08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:20:57, skipping insertion in model container [2019-10-22 11:20:57,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (2/3) ... [2019-10-22 11:20:57,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4373e08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:20:57, skipping insertion in model container [2019-10-22 11:20:57,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:57" (3/3) ... [2019-10-22 11:20:57,658 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product39.cil.c [2019-10-22 11:20:57,669 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:20:57,678 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:20:57,689 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:20:57,721 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:20:57,722 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:20:57,722 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:20:57,722 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:20:57,723 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:20:57,723 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:20:57,723 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:20:57,723 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:20:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-10-22 11:20:57,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:20:57,753 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:57,754 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:20:57,755 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:57,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:57,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1221872895, now seen corresponding path program 1 times [2019-10-22 11:20:57,771 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:57,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772085143] [2019-10-22 11:20:57,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,772 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,005 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:20:58,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772085143] [2019-10-22 11:20:58,006 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:20:58,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290560508] [2019-10-22 11:20:58,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:20:58,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:20:58,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:20:58,022 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-10-22 11:20:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:58,052 INFO L93 Difference]: Finished difference Result 220 states and 335 transitions. [2019-10-22 11:20:58,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:20:58,054 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-22 11:20:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:58,065 INFO L225 Difference]: With dead ends: 220 [2019-10-22 11:20:58,065 INFO L226 Difference]: Without dead ends: 109 [2019-10-22 11:20:58,068 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:20:58,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-22 11:20:58,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-10-22 11:20:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-22 11:20:58,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2019-10-22 11:20:58,121 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 16 [2019-10-22 11:20:58,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:58,122 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2019-10-22 11:20:58,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:20:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2019-10-22 11:20:58,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:20:58,126 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,126 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:20:58,126 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:58,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,126 INFO L82 PathProgramCache]: Analyzing trace with hash 175115998, now seen corresponding path program 1 times [2019-10-22 11:20:58,127 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498954365] [2019-10-22 11:20:58,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,261 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:20:58,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498954365] [2019-10-22 11:20:58,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:20:58,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660177082] [2019-10-22 11:20:58,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:58,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:58,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:58,264 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand 3 states. [2019-10-22 11:20:58,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:58,279 INFO L93 Difference]: Finished difference Result 109 states and 159 transitions. [2019-10-22 11:20:58,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:58,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 11:20:58,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:58,281 INFO L225 Difference]: With dead ends: 109 [2019-10-22 11:20:58,281 INFO L226 Difference]: Without dead ends: 47 [2019-10-22 11:20:58,282 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:20:58,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-22 11:20:58,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-10-22 11:20:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 11:20:58,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2019-10-22 11:20:58,290 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2019-10-22 11:20:58,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:58,290 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2019-10-22 11:20:58,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:58,290 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2019-10-22 11:20:58,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:20:58,291 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,291 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:20:58,291 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:58,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1744081540, now seen corresponding path program 1 times [2019-10-22 11:20:58,291 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723521617] [2019-10-22 11:20:58,292 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,292 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,402 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:20:58,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723521617] [2019-10-22 11:20:58,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:20:58,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521554087] [2019-10-22 11:20:58,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:20:58,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:20:58,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:20:58,404 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 6 states. [2019-10-22 11:20:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:58,538 INFO L93 Difference]: Finished difference Result 152 states and 226 transitions. [2019-10-22 11:20:58,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:20:58,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-10-22 11:20:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:58,540 INFO L225 Difference]: With dead ends: 152 [2019-10-22 11:20:58,540 INFO L226 Difference]: Without dead ends: 111 [2019-10-22 11:20:58,540 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:20:58,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-22 11:20:58,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 66. [2019-10-22 11:20:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 11:20:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2019-10-22 11:20:58,550 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 22 [2019-10-22 11:20:58,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:58,551 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2019-10-22 11:20:58,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:20:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2019-10-22 11:20:58,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:20:58,551 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,552 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] [2019-10-22 11:20:58,552 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:58,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,552 INFO L82 PathProgramCache]: Analyzing trace with hash -595366227, now seen corresponding path program 1 times [2019-10-22 11:20:58,552 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81559696] [2019-10-22 11:20:58,553 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,553 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,605 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:20:58,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81559696] [2019-10-22 11:20:58,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:20:58,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505590442] [2019-10-22 11:20:58,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:58,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:58,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:58,608 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand 3 states. [2019-10-22 11:20:58,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:58,655 INFO L93 Difference]: Finished difference Result 147 states and 218 transitions. [2019-10-22 11:20:58,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:58,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 11:20:58,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:58,657 INFO L225 Difference]: With dead ends: 147 [2019-10-22 11:20:58,657 INFO L226 Difference]: Without dead ends: 87 [2019-10-22 11:20:58,658 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:20:58,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-22 11:20:58,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-22 11:20:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-22 11:20:58,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2019-10-22 11:20:58,673 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 24 [2019-10-22 11:20:58,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:58,674 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2019-10-22 11:20:58,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:58,674 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2019-10-22 11:20:58,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:20:58,675 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,675 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:20:58,675 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:58,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,675 INFO L82 PathProgramCache]: Analyzing trace with hash 566175321, now seen corresponding path program 1 times [2019-10-22 11:20:58,676 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325574616] [2019-10-22 11:20:58,676 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,676 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,743 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:20:58,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325574616] [2019-10-22 11:20:58,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:20:58,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375925540] [2019-10-22 11:20:58,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:20:58,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:20:58,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:20:58,746 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand 5 states. [2019-10-22 11:20:58,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:58,908 INFO L93 Difference]: Finished difference Result 413 states and 601 transitions. [2019-10-22 11:20:58,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:20:58,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-22 11:20:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:58,912 INFO L225 Difference]: With dead ends: 413 [2019-10-22 11:20:58,912 INFO L226 Difference]: Without dead ends: 334 [2019-10-22 11:20:58,913 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:20:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-10-22 11:20:58,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 156. [2019-10-22 11:20:58,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-22 11:20:58,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 220 transitions. [2019-10-22 11:20:58,953 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 220 transitions. Word has length 25 [2019-10-22 11:20:58,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:58,954 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 220 transitions. [2019-10-22 11:20:58,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:20:58,955 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 220 transitions. [2019-10-22 11:20:58,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:20:58,956 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,956 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:20:58,956 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:58,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,957 INFO L82 PathProgramCache]: Analyzing trace with hash 362368227, now seen corresponding path program 1 times [2019-10-22 11:20:58,957 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525474365] [2019-10-22 11:20:58,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,031 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:20:59,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525474365] [2019-10-22 11:20:59,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:20:59,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345343702] [2019-10-22 11:20:59,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:20:59,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:20:59,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:20:59,033 INFO L87 Difference]: Start difference. First operand 156 states and 220 transitions. Second operand 5 states. [2019-10-22 11:20:59,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,179 INFO L93 Difference]: Finished difference Result 436 states and 619 transitions. [2019-10-22 11:20:59,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:20:59,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-22 11:20:59,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,183 INFO L225 Difference]: With dead ends: 436 [2019-10-22 11:20:59,183 INFO L226 Difference]: Without dead ends: 434 [2019-10-22 11:20:59,184 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:20:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-10-22 11:20:59,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 156. [2019-10-22 11:20:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-22 11:20:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 218 transitions. [2019-10-22 11:20:59,209 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 218 transitions. Word has length 26 [2019-10-22 11:20:59,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,209 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 218 transitions. [2019-10-22 11:20:59,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:20:59,209 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 218 transitions. [2019-10-22 11:20:59,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:20:59,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,215 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] [2019-10-22 11:20:59,215 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:59,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,216 INFO L82 PathProgramCache]: Analyzing trace with hash 922855028, now seen corresponding path program 1 times [2019-10-22 11:20:59,216 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194122746] [2019-10-22 11:20:59,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,266 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:20:59,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194122746] [2019-10-22 11:20:59,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:20:59,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856758276] [2019-10-22 11:20:59,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:20:59,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:20:59,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:20:59,268 INFO L87 Difference]: Start difference. First operand 156 states and 218 transitions. Second operand 5 states. [2019-10-22 11:20:59,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,347 INFO L93 Difference]: Finished difference Result 468 states and 648 transitions. [2019-10-22 11:20:59,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:20:59,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-22 11:20:59,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,348 INFO L225 Difference]: With dead ends: 468 [2019-10-22 11:20:59,349 INFO L226 Difference]: Without dead ends: 318 [2019-10-22 11:20:59,349 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:20:59,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-22 11:20:59,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 168. [2019-10-22 11:20:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-22 11:20:59,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 230 transitions. [2019-10-22 11:20:59,386 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 230 transitions. Word has length 31 [2019-10-22 11:20:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,386 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 230 transitions. [2019-10-22 11:20:59,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:20:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 230 transitions. [2019-10-22 11:20:59,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:20:59,387 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,387 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] [2019-10-22 11:20:59,388 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:59,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,388 INFO L82 PathProgramCache]: Analyzing trace with hash 529828018, now seen corresponding path program 1 times [2019-10-22 11:20:59,388 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042649594] [2019-10-22 11:20:59,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,425 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:20:59,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042649594] [2019-10-22 11:20:59,426 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:20:59,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480415353] [2019-10-22 11:20:59,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:20:59,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:20:59,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:20:59,427 INFO L87 Difference]: Start difference. First operand 168 states and 230 transitions. Second operand 4 states. [2019-10-22 11:20:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,478 INFO L93 Difference]: Finished difference Result 426 states and 580 transitions. [2019-10-22 11:20:59,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:20:59,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-22 11:20:59,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,479 INFO L225 Difference]: With dead ends: 426 [2019-10-22 11:20:59,480 INFO L226 Difference]: Without dead ends: 264 [2019-10-22 11:20:59,480 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:20:59,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-22 11:20:59,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 176. [2019-10-22 11:20:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-10-22 11:20:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 238 transitions. [2019-10-22 11:20:59,497 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 238 transitions. Word has length 31 [2019-10-22 11:20:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,497 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 238 transitions. [2019-10-22 11:20:59,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:20:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 238 transitions. [2019-10-22 11:20:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:20:59,498 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,498 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] [2019-10-22 11:20:59,498 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:59,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,499 INFO L82 PathProgramCache]: Analyzing trace with hash 787993456, now seen corresponding path program 1 times [2019-10-22 11:20:59,499 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666908688] [2019-10-22 11:20:59,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,529 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:20:59,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666908688] [2019-10-22 11:20:59,529 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:20:59,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905937669] [2019-10-22 11:20:59,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:59,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:59,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:59,530 INFO L87 Difference]: Start difference. First operand 176 states and 238 transitions. Second operand 3 states. [2019-10-22 11:20:59,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,567 INFO L93 Difference]: Finished difference Result 434 states and 586 transitions. [2019-10-22 11:20:59,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:59,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-22 11:20:59,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,569 INFO L225 Difference]: With dead ends: 434 [2019-10-22 11:20:59,569 INFO L226 Difference]: Without dead ends: 264 [2019-10-22 11:20:59,570 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:20:59,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-22 11:20:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2019-10-22 11:20:59,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-22 11:20:59,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 348 transitions. [2019-10-22 11:20:59,594 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 348 transitions. Word has length 31 [2019-10-22 11:20:59,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,594 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 348 transitions. [2019-10-22 11:20:59,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:59,594 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 348 transitions. [2019-10-22 11:20:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:20:59,595 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,595 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] [2019-10-22 11:20:59,596 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:59,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1324766414, now seen corresponding path program 1 times [2019-10-22 11:20:59,596 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660119917] [2019-10-22 11:20:59,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:00,135 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:21:00,135 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:21:00,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:00 BoogieIcfgContainer [2019-10-22 11:21:00,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:00,205 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:00,205 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:00,205 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:00,206 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:57" (3/4) ... [2019-10-22 11:21:00,216 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:21:00,281 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_259856dd-82d3-4edf-a399-3b1a649843e6/bin/utaipan/witness.graphml [2019-10-22 11:21:00,281 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:00,283 INFO L168 Benchmark]: Toolchain (without parser) took 4120.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.5 MB in the beginning and 868.2 MB in the end (delta: 76.3 MB). Peak memory consumption was 217.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:00,283 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:00,284 INFO L168 Benchmark]: CACSL2BoogieTranslator took 476.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:00,284 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.24 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:21:00,284 INFO L168 Benchmark]: Boogie Preprocessor took 36.36 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:21:00,284 INFO L168 Benchmark]: RCFGBuilder took 911.63 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: 66.8 MB). Peak memory consumption was 66.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:00,285 INFO L168 Benchmark]: TraceAbstraction took 2555.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 885.7 MB in the end (delta: 161.6 MB). Peak memory consumption was 161.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:00,285 INFO L168 Benchmark]: Witness Printer took 76.14 ms. Allocated memory is still 1.2 GB. Free memory was 885.7 MB in the beginning and 868.2 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:00,287 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 476.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.24 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 36.36 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 911.63 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: 66.8 MB). Peak memory consumption was 66.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2555.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 885.7 MB in the end (delta: 161.6 MB). Peak memory consumption was 161.6 MB. Max. memory is 11.5 GB. * Witness Printer took 76.14 ms. Allocated memory is still 1.2 GB. Free memory was 885.7 MB in the beginning and 868.2 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 439]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L450] int waterLevel = 1; [L451] int methaneLevelCritical = 0; [L617] int pumpRunning = 0; [L618] int systemActive = 1; [L848] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L921] int retValue_acc ; [L922] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L839] int retValue_acc ; [L842] retValue_acc = 1 [L843] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L928] tmp = valid_product() [L930] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L548] int splverifierCounter ; [L549] int tmp ; [L550] int tmp___0 ; [L551] int tmp___1 ; [L552] int tmp___2 ; [L555] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L557] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L559] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L565] tmp = __VERIFIER_nondet_int() [L567] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L468] COND TRUE waterLevel < 2 [L469] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L575] tmp___0 = __VERIFIER_nondet_int() [L577] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L480] COND FALSE !(\read(methaneLevelCritical)) [L483] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L585] tmp___2 = __VERIFIER_nondet_int() [L587] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L624] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L631] COND TRUE \read(systemActive) [L679] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L682] COND FALSE !(\read(pumpRunning)) [L653] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L656] COND TRUE ! pumpRunning [L776] int retValue_acc ; [L777] int tmp ; [L778] int tmp___0 ; [L530] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L533] COND FALSE !(waterLevel < 2) [L537] retValue_acc = 0 [L538] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L782] tmp = isHighWaterSensorDry() [L784] COND FALSE !(\read(tmp)) [L787] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L789] retValue_acc = tmp___0 [L790] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L658] tmp = isHighWaterLevel() [L660] COND TRUE \read(tmp) [L707] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L410] int tmp ; [L411] int tmp___0 ; [L489] int retValue_acc ; [L492] retValue_acc = methaneLevelCritical [L493] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L415] tmp = isMethaneLevelCritical() [L417] COND TRUE \read(tmp) [L731] int retValue_acc ; [L734] retValue_acc = pumpRunning [L735] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L419] tmp___0 = isPumpRunning() [L421] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L439] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 831 SDtfs, 1084 SDslu, 1323 SDs, 0 SdLazy, 169 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred 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, 9 MinimizatonAttempts, 741 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 10707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...