./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec2_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_fa866768-2ce9-4713-9afe-ff44d3cbbf92/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fa866768-2ce9-4713-9afe-ff44d3cbbf92/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fa866768-2ce9-4713-9afe-ff44d3cbbf92/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fa866768-2ce9-4713-9afe-ff44d3cbbf92/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec2_product44.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fa866768-2ce9-4713-9afe-ff44d3cbbf92/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fa866768-2ce9-4713-9afe-ff44d3cbbf92/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 1e304dec1a19556a559249c7b1ef76290bc8b678 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:27:33,253 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:27:33,254 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:27:33,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:27:33,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:27:33,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:27:33,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:27:33,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:27:33,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:27:33,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:27:33,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:27:33,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:27:33,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:27:33,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:27:33,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:27:33,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:27:33,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:27:33,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:27:33,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:27:33,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:27:33,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:27:33,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:27:33,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:27:33,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:27:33,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:27:33,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:27:33,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:27:33,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:27:33,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:27:33,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:27:33,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:27:33,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:27:33,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:27:33,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:27:33,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:27:33,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:27:33,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:27:33,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:27:33,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:27:33,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:27:33,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:27:33,297 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fa866768-2ce9-4713-9afe-ff44d3cbbf92/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:27:33,310 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:27:33,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:27:33,311 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:27:33,311 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:27:33,311 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:27:33,311 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:27:33,311 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:27:33,312 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:27:33,312 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:27:33,312 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:27:33,312 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:27:33,312 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:27:33,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:27:33,313 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:27:33,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:27:33,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:27:33,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:27:33,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:27:33,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:27:33,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:27:33,315 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:27:33,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:27:33,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:27:33,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:27:33,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:27:33,316 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:27:33,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:27:33,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:27:33,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:27:33,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:27:33,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:27:33,317 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:27:33,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:27:33,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:27:33,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:27:33,317 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_fa866768-2ce9-4713-9afe-ff44d3cbbf92/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 -> 1e304dec1a19556a559249c7b1ef76290bc8b678 [2019-10-22 11:27:33,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:27:33,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:27:33,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:27:33,354 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:27:33,354 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:27:33,355 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fa866768-2ce9-4713-9afe-ff44d3cbbf92/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec2_product44.cil.c [2019-10-22 11:27:33,398 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa866768-2ce9-4713-9afe-ff44d3cbbf92/bin/utaipan/data/20cfee27d/9232d356ee464c968d08045f8a091e55/FLAGe0ca5fa45 [2019-10-22 11:27:33,822 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:27:33,822 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fa866768-2ce9-4713-9afe-ff44d3cbbf92/sv-benchmarks/c/product-lines/minepump_spec2_product44.cil.c [2019-10-22 11:27:33,831 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa866768-2ce9-4713-9afe-ff44d3cbbf92/bin/utaipan/data/20cfee27d/9232d356ee464c968d08045f8a091e55/FLAGe0ca5fa45 [2019-10-22 11:27:34,192 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fa866768-2ce9-4713-9afe-ff44d3cbbf92/bin/utaipan/data/20cfee27d/9232d356ee464c968d08045f8a091e55 [2019-10-22 11:27:34,193 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:27:34,194 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:27:34,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:34,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:27:34,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:27:34,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:34" (1/1) ... [2019-10-22 11:27:34,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350c055c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:34, skipping insertion in model container [2019-10-22 11:27:34,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:34" (1/1) ... [2019-10-22 11:27:34,207 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:27:34,242 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:27:34,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:34,587 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:27:34,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:34,685 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:27:34,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:34 WrapperNode [2019-10-22 11:27:34,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:34,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:34,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:27:34,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:27:34,693 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:27:34" (1/1) ... [2019-10-22 11:27:34,716 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:27:34" (1/1) ... [2019-10-22 11:27:34,746 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:34,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:27:34,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:27:34,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:27:34,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:34" (1/1) ... [2019-10-22 11:27:34,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:34" (1/1) ... [2019-10-22 11:27:34,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:34" (1/1) ... [2019-10-22 11:27:34,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:34" (1/1) ... [2019-10-22 11:27:34,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:34" (1/1) ... [2019-10-22 11:27:34,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:34" (1/1) ... [2019-10-22 11:27:34,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:34" (1/1) ... [2019-10-22 11:27:34,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:27:34,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:27:34,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:27:34,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:27:34,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa866768-2ce9-4713-9afe-ff44d3cbbf92/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:27:34,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:27:34,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:27:34,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:27:34,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:27:35,492 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:27:35,492 INFO L284 CfgBuilder]: Removed 122 assume(true) statements. [2019-10-22 11:27:35,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:35 BoogieIcfgContainer [2019-10-22 11:27:35,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:27:35,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:27:35,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:27:35,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:27:35,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:27:34" (1/3) ... [2019-10-22 11:27:35,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5909c762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:35, skipping insertion in model container [2019-10-22 11:27:35,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:34" (2/3) ... [2019-10-22 11:27:35,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5909c762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:35, skipping insertion in model container [2019-10-22 11:27:35,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:35" (3/3) ... [2019-10-22 11:27:35,501 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product44.cil.c [2019-10-22 11:27:35,510 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:27:35,516 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:27:35,527 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:27:35,564 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:27:35,566 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:27:35,566 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:27:35,566 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:27:35,566 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:27:35,566 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:27:35,567 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:27:35,567 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:27:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2019-10-22 11:27:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:27:35,586 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:35,586 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:35,588 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:35,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:35,593 INFO L82 PathProgramCache]: Analyzing trace with hash -732978716, now seen corresponding path program 1 times [2019-10-22 11:27:35,601 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:35,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708639763] [2019-10-22 11:27:35,601 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:35,601 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:35,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:35,792 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:27:35,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708639763] [2019-10-22 11:27:35,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:35,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:27:35,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775306555] [2019-10-22 11:27:35,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:27:35,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:35,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:27:35,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:27:35,808 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 2 states. [2019-10-22 11:27:35,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:35,835 INFO L93 Difference]: Finished difference Result 179 states and 270 transitions. [2019-10-22 11:27:35,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:27:35,836 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-10-22 11:27:35,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:35,843 INFO L225 Difference]: With dead ends: 179 [2019-10-22 11:27:35,843 INFO L226 Difference]: Without dead ends: 89 [2019-10-22 11:27:35,846 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:27:35,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-22 11:27:35,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-10-22 11:27:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 11:27:35,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2019-10-22 11:27:35,881 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 18 [2019-10-22 11:27:35,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:35,881 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2019-10-22 11:27:35,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:27:35,881 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2019-10-22 11:27:35,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:27:35,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:35,882 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:35,883 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:35,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:35,883 INFO L82 PathProgramCache]: Analyzing trace with hash -951814685, now seen corresponding path program 1 times [2019-10-22 11:27:35,883 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:35,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419751305] [2019-10-22 11:27:35,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:35,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:35,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:35,988 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:27:35,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419751305] [2019-10-22 11:27:35,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:35,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:35,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699785311] [2019-10-22 11:27:35,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:35,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:35,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:35,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:35,991 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand 3 states. [2019-10-22 11:27:36,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:36,000 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-10-22 11:27:36,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:36,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 11:27:36,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:36,002 INFO L225 Difference]: With dead ends: 89 [2019-10-22 11:27:36,002 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 11:27:36,002 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:27:36,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 11:27:36,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-22 11:27:36,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-22 11:27:36,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2019-10-22 11:27:36,007 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 19 [2019-10-22 11:27:36,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:36,007 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2019-10-22 11:27:36,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:36,008 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2019-10-22 11:27:36,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:27:36,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:36,008 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:27:36,009 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:36,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:36,009 INFO L82 PathProgramCache]: Analyzing trace with hash -2025304256, now seen corresponding path program 1 times [2019-10-22 11:27:36,009 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:36,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114432481] [2019-10-22 11:27:36,009 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:36,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:36,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:36,069 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:27:36,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114432481] [2019-10-22 11:27:36,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:36,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:36,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595501308] [2019-10-22 11:27:36,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:36,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:36,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:36,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:36,071 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 3 states. [2019-10-22 11:27:36,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:36,099 INFO L93 Difference]: Finished difference Result 109 states and 160 transitions. [2019-10-22 11:27:36,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:36,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 11:27:36,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:36,101 INFO L225 Difference]: With dead ends: 109 [2019-10-22 11:27:36,101 INFO L226 Difference]: Without dead ends: 75 [2019-10-22 11:27:36,101 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:27:36,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-22 11:27:36,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-10-22 11:27:36,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-22 11:27:36,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 104 transitions. [2019-10-22 11:27:36,110 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 104 transitions. Word has length 24 [2019-10-22 11:27:36,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:36,110 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 104 transitions. [2019-10-22 11:27:36,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:36,110 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 104 transitions. [2019-10-22 11:27:36,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:27:36,111 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:36,111 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:27:36,111 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:36,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:36,111 INFO L82 PathProgramCache]: Analyzing trace with hash 193545241, now seen corresponding path program 1 times [2019-10-22 11:27:36,112 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:36,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953118612] [2019-10-22 11:27:36,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:36,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:36,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:36,161 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:27:36,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953118612] [2019-10-22 11:27:36,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:36,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:27:36,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329230358] [2019-10-22 11:27:36,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:36,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:36,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:36,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:36,163 INFO L87 Difference]: Start difference. First operand 71 states and 104 transitions. Second operand 3 states. [2019-10-22 11:27:36,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:36,196 INFO L93 Difference]: Finished difference Result 178 states and 267 transitions. [2019-10-22 11:27:36,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:36,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 11:27:36,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:36,198 INFO L225 Difference]: With dead ends: 178 [2019-10-22 11:27:36,198 INFO L226 Difference]: Without dead ends: 114 [2019-10-22 11:27:36,199 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:27:36,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-22 11:27:36,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-10-22 11:27:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-22 11:27:36,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2019-10-22 11:27:36,214 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 25 [2019-10-22 11:27:36,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:36,214 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2019-10-22 11:27:36,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2019-10-22 11:27:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:27:36,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:36,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] [2019-10-22 11:27:36,215 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:36,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:36,216 INFO L82 PathProgramCache]: Analyzing trace with hash 433385865, now seen corresponding path program 1 times [2019-10-22 11:27:36,216 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:36,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506446045] [2019-10-22 11:27:36,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:36,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:36,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:36,271 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:27:36,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506446045] [2019-10-22 11:27:36,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:36,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:36,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672062939] [2019-10-22 11:27:36,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:36,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:36,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:36,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:36,273 INFO L87 Difference]: Start difference. First operand 112 states and 164 transitions. Second operand 5 states. [2019-10-22 11:27:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:36,404 INFO L93 Difference]: Finished difference Result 544 states and 809 transitions. [2019-10-22 11:27:36,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:27:36,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-10-22 11:27:36,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:36,408 INFO L225 Difference]: With dead ends: 544 [2019-10-22 11:27:36,408 INFO L226 Difference]: Without dead ends: 439 [2019-10-22 11:27:36,409 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:27:36,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-10-22 11:27:36,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 203. [2019-10-22 11:27:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-10-22 11:27:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 292 transitions. [2019-10-22 11:27:36,456 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 292 transitions. Word has length 27 [2019-10-22 11:27:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:36,460 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 292 transitions. [2019-10-22 11:27:36,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 292 transitions. [2019-10-22 11:27:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:27:36,461 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:36,461 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] [2019-10-22 11:27:36,461 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:36,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:36,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1000759295, now seen corresponding path program 1 times [2019-10-22 11:27:36,462 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:36,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614405799] [2019-10-22 11:27:36,462 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:36,462 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:36,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:36,546 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:27:36,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614405799] [2019-10-22 11:27:36,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:36,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:36,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273214348] [2019-10-22 11:27:36,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:36,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:36,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:36,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:36,548 INFO L87 Difference]: Start difference. First operand 203 states and 292 transitions. Second operand 5 states. [2019-10-22 11:27:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:36,681 INFO L93 Difference]: Finished difference Result 769 states and 1111 transitions. [2019-10-22 11:27:36,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:27:36,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-22 11:27:36,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:36,685 INFO L225 Difference]: With dead ends: 769 [2019-10-22 11:27:36,685 INFO L226 Difference]: Without dead ends: 573 [2019-10-22 11:27:36,686 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:27:36,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-10-22 11:27:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 201. [2019-10-22 11:27:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-22 11:27:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 286 transitions. [2019-10-22 11:27:36,722 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 286 transitions. Word has length 28 [2019-10-22 11:27:36,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:36,722 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 286 transitions. [2019-10-22 11:27:36,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:36,723 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 286 transitions. [2019-10-22 11:27:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:27:36,724 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:36,724 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, 1] [2019-10-22 11:27:36,724 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:36,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:36,725 INFO L82 PathProgramCache]: Analyzing trace with hash 341285158, now seen corresponding path program 1 times [2019-10-22 11:27:36,725 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:36,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741958756] [2019-10-22 11:27:36,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:36,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:36,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:36,809 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:27:36,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741958756] [2019-10-22 11:27:36,810 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:36,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:36,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738593758] [2019-10-22 11:27:36,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:36,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:36,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:36,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:36,811 INFO L87 Difference]: Start difference. First operand 201 states and 286 transitions. Second operand 5 states. [2019-10-22 11:27:36,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:36,868 INFO L93 Difference]: Finished difference Result 555 states and 781 transitions. [2019-10-22 11:27:36,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:27:36,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-10-22 11:27:36,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:36,870 INFO L225 Difference]: With dead ends: 555 [2019-10-22 11:27:36,871 INFO L226 Difference]: Without dead ends: 361 [2019-10-22 11:27:36,871 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:27:36,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-10-22 11:27:36,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 213. [2019-10-22 11:27:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-10-22 11:27:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 298 transitions. [2019-10-22 11:27:36,896 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 298 transitions. Word has length 35 [2019-10-22 11:27:36,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:36,896 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 298 transitions. [2019-10-22 11:27:36,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:36,897 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 298 transitions. [2019-10-22 11:27:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:27:36,898 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:36,898 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, 1] [2019-10-22 11:27:36,901 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:36,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:36,902 INFO L82 PathProgramCache]: Analyzing trace with hash -669832092, now seen corresponding path program 1 times [2019-10-22 11:27:36,902 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:36,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336290512] [2019-10-22 11:27:36,902 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:36,902 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:36,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:36,951 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:27:36,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336290512] [2019-10-22 11:27:36,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:36,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:36,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108519451] [2019-10-22 11:27:36,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:36,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:36,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:36,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:36,952 INFO L87 Difference]: Start difference. First operand 213 states and 298 transitions. Second operand 4 states. [2019-10-22 11:27:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:36,987 INFO L93 Difference]: Finished difference Result 515 states and 715 transitions. [2019-10-22 11:27:36,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:36,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-10-22 11:27:36,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:36,989 INFO L225 Difference]: With dead ends: 515 [2019-10-22 11:27:36,989 INFO L226 Difference]: Without dead ends: 309 [2019-10-22 11:27:36,990 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:27:36,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-10-22 11:27:37,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 221. [2019-10-22 11:27:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-22 11:27:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 306 transitions. [2019-10-22 11:27:37,008 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 306 transitions. Word has length 35 [2019-10-22 11:27:37,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:37,009 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 306 transitions. [2019-10-22 11:27:37,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:37,009 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 306 transitions. [2019-10-22 11:27:37,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:27:37,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:37,013 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, 1] [2019-10-22 11:27:37,013 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:37,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:37,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1690900446, now seen corresponding path program 1 times [2019-10-22 11:27:37,014 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:37,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118957182] [2019-10-22 11:27:37,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:37,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:37,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:37,059 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:27:37,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118957182] [2019-10-22 11:27:37,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:37,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:27:37,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541045252] [2019-10-22 11:27:37,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:37,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:37,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:37,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:37,060 INFO L87 Difference]: Start difference. First operand 221 states and 306 transitions. Second operand 3 states. [2019-10-22 11:27:37,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:37,100 INFO L93 Difference]: Finished difference Result 535 states and 735 transitions. [2019-10-22 11:27:37,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:37,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 11:27:37,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:37,102 INFO L225 Difference]: With dead ends: 535 [2019-10-22 11:27:37,102 INFO L226 Difference]: Without dead ends: 321 [2019-10-22 11:27:37,103 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:27:37,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-10-22 11:27:37,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2019-10-22 11:27:37,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-10-22 11:27:37,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 428 transitions. [2019-10-22 11:27:37,132 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 428 transitions. Word has length 35 [2019-10-22 11:27:37,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:37,133 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 428 transitions. [2019-10-22 11:27:37,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:37,133 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 428 transitions. [2019-10-22 11:27:37,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:27:37,134 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:37,135 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, 1, 1] [2019-10-22 11:27:37,135 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:37,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:37,135 INFO L82 PathProgramCache]: Analyzing trace with hash -2015558942, now seen corresponding path program 1 times [2019-10-22 11:27:37,135 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:37,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381008354] [2019-10-22 11:27:37,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:37,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:37,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:37,218 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:27:37,218 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381008354] [2019-10-22 11:27:37,218 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:37,218 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:27:37,218 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347399299] [2019-10-22 11:27:37,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:27:37,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:37,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:27:37,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:27:37,220 INFO L87 Difference]: Start difference. First operand 321 states and 428 transitions. Second operand 8 states. [2019-10-22 11:27:37,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:37,735 INFO L93 Difference]: Finished difference Result 1403 states and 1854 transitions. [2019-10-22 11:27:37,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-22 11:27:37,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-10-22 11:27:37,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:37,738 INFO L225 Difference]: With dead ends: 1403 [2019-10-22 11:27:37,738 INFO L226 Difference]: Without dead ends: 1089 [2019-10-22 11:27:37,739 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2019-10-22 11:27:37,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-10-22 11:27:37,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 321. [2019-10-22 11:27:37,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-10-22 11:27:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 420 transitions. [2019-10-22 11:27:37,766 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 420 transitions. Word has length 36 [2019-10-22 11:27:37,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:37,766 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 420 transitions. [2019-10-22 11:27:37,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:27:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 420 transitions. [2019-10-22 11:27:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 11:27:37,767 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:37,767 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, 1, 1] [2019-10-22 11:27:37,768 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:37,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:37,768 INFO L82 PathProgramCache]: Analyzing trace with hash -59965040, now seen corresponding path program 1 times [2019-10-22 11:27:37,768 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:37,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727976222] [2019-10-22 11:27:37,768 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:37,768 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:37,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:37,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727976222] [2019-10-22 11:27:37,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:37,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:37,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13944487] [2019-10-22 11:27:37,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:37,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:37,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:37,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:37,804 INFO L87 Difference]: Start difference. First operand 321 states and 420 transitions. Second operand 3 states. [2019-10-22 11:27:37,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:37,848 INFO L93 Difference]: Finished difference Result 471 states and 623 transitions. [2019-10-22 11:27:37,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:37,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-22 11:27:37,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:37,850 INFO L225 Difference]: With dead ends: 471 [2019-10-22 11:27:37,850 INFO L226 Difference]: Without dead ends: 469 [2019-10-22 11:27:37,850 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:27:37,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-10-22 11:27:37,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 361. [2019-10-22 11:27:37,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-10-22 11:27:37,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 481 transitions. [2019-10-22 11:27:37,875 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 481 transitions. Word has length 51 [2019-10-22 11:27:37,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:37,875 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 481 transitions. [2019-10-22 11:27:37,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:37,875 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 481 transitions. [2019-10-22 11:27:37,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-22 11:27:37,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:37,876 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 11:27:37,876 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:37,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:37,877 INFO L82 PathProgramCache]: Analyzing trace with hash -376855367, now seen corresponding path program 1 times [2019-10-22 11:27:37,877 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:37,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387333318] [2019-10-22 11:27:37,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:37,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:37,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:27:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:27:38,684 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:27:38,684 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:27:38,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:27:38 BoogieIcfgContainer [2019-10-22 11:27:38,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:27:38,837 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:27:38,837 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:27:38,837 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:27:38,838 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:35" (3/4) ... [2019-10-22 11:27:38,840 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:27:39,000 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fa866768-2ce9-4713-9afe-ff44d3cbbf92/bin/utaipan/witness.graphml [2019-10-22 11:27:39,000 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:27:39,002 INFO L168 Benchmark]: Toolchain (without parser) took 4807.10 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 356.0 MB). Free memory was 943.1 MB in the beginning and 1.3 GB in the end (delta: -404.8 MB). Peak memory consumption was 358.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:39,003 INFO L168 Benchmark]: CDTParser took 0.20 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:27:39,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 490.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:39,003 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.50 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:27:39,003 INFO L168 Benchmark]: Boogie Preprocessor took 30.69 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:27:39,004 INFO L168 Benchmark]: RCFGBuilder took 716.26 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: 67.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:39,004 INFO L168 Benchmark]: TraceAbstraction took 3342.09 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 852.1 MB in the end (delta: 218.2 MB). Peak memory consumption was 297.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:39,004 INFO L168 Benchmark]: Witness Printer took 163.43 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 113.8 MB). Free memory was 852.1 MB in the beginning and 1.3 GB in the end (delta: -495.8 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:39,006 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.20 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 490.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.50 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. * Boogie Preprocessor took 30.69 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 716.26 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: 67.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3342.09 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 852.1 MB in the end (delta: 218.2 MB). Peak memory consumption was 297.4 MB. Max. memory is 11.5 GB. * Witness Printer took 163.43 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 113.8 MB). Free memory was 852.1 MB in the beginning and 1.3 GB in the end (delta: -495.8 MB). Peak memory consumption was 25.4 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: [L132] int pumpRunning = 0; [L133] int systemActive = 1; [L364] int cleanupTimeShifts = 4; [L462] int methAndRunningLastTime ; [L502] int waterLevel = 1; [L503] int methaneLevelCritical = 0; [L765] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L439] int retValue_acc ; [L440] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L355] int retValue_acc ; [L358] retValue_acc = 1 [L359] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L446] tmp = valid_product() [L448] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L467] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L56] int splverifierCounter ; [L57] int tmp ; [L58] int tmp___0 ; [L59] int tmp___1 ; [L60] int tmp___2 ; [L63] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L65] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L67] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L73] tmp = __VERIFIER_nondet_int() [L75] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L520] COND TRUE waterLevel < 2 [L521] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L83] tmp___0 = __VERIFIER_nondet_int() [L85] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L93] tmp___2 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___2) [L321] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L140] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L147] COND TRUE \read(systemActive) [L169] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L172] COND TRUE ! pumpRunning [L284] int retValue_acc ; [L285] int tmp ; [L286] int tmp___0 ; [L582] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L585] COND FALSE !(waterLevel < 2) [L589] retValue_acc = 0 [L590] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L290] tmp = isHighWaterSensorDry() [L292] COND FALSE !(\read(tmp)) [L295] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L297] retValue_acc = tmp___0 [L298] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L174] tmp = isHighWaterLevel() [L176] COND TRUE \read(tmp) [L203] int tmp ; [L228] int retValue_acc ; [L541] int retValue_acc ; [L544] retValue_acc = methaneLevelCritical [L545] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L232] retValue_acc = isMethaneLevelCritical() [L234] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L207] tmp = isMethaneAlarm() [L209] COND FALSE !(\read(tmp)) [L197] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L472] int tmp ; [L473] int tmp___0 ; [L541] int retValue_acc ; [L544] retValue_acc = methaneLevelCritical [L545] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L477] tmp = isMethaneLevelCritical() [L479] COND FALSE !(\read(tmp)) [L495] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L65] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L67] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L73] tmp = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L83] tmp___0 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L532] COND FALSE !(\read(methaneLevelCritical)) [L535] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L93] tmp___2 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___2) [L321] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L140] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L508] COND TRUE waterLevel > 0 [L509] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L147] COND TRUE \read(systemActive) [L169] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L172] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L472] int tmp ; [L473] int tmp___0 ; [L541] int retValue_acc ; [L544] retValue_acc = methaneLevelCritical [L545] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L477] tmp = isMethaneLevelCritical() [L479] COND TRUE \read(tmp) [L239] int retValue_acc ; [L242] retValue_acc = pumpRunning [L243] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L481] tmp___0 = isPumpRunning() [L483] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L484] COND FALSE !(\read(methAndRunningLastTime)) [L489] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L65] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L67] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L73] tmp = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L83] tmp___0 = __VERIFIER_nondet_int() [L85] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L93] tmp___2 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___2) [L321] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L140] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L508] COND TRUE waterLevel > 0 [L509] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L147] COND TRUE \read(systemActive) [L169] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L172] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L472] int tmp ; [L473] int tmp___0 ; [L541] int retValue_acc ; [L544] retValue_acc = methaneLevelCritical [L545] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L477] tmp = isMethaneLevelCritical() [L479] COND TRUE \read(tmp) [L239] int retValue_acc ; [L242] retValue_acc = pumpRunning [L243] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L481] tmp___0 = isPumpRunning() [L483] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L484] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L44] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 93 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.2s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 966 SDtfs, 1119 SDslu, 2015 SDs, 0 SdLazy, 277 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361occurred in iteration=11, 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, 11 MinimizatonAttempts, 1726 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 18652 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 14/14 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...