./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec1_product50.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_3da6c28d-8998-4896-90c7-470cd7afae3b/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3da6c28d-8998-4896-90c7-470cd7afae3b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3da6c28d-8998-4896-90c7-470cd7afae3b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3da6c28d-8998-4896-90c7-470cd7afae3b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3da6c28d-8998-4896-90c7-470cd7afae3b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3da6c28d-8998-4896-90c7-470cd7afae3b/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 63231100df91d767f63e82b83b0d6c2eaec3a983 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:22:27,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:27,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:27,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:27,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:27,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:27,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:27,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:27,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:27,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:27,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:27,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:27,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:27,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:27,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:27,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:27,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:27,478 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:27,480 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:27,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:27,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:27,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:27,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:27,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:27,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:27,487 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:27,487 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:27,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:27,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:27,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:27,489 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:27,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:27,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:27,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:27,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:27,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:27,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:27,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:27,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:27,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:27,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:27,506 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3da6c28d-8998-4896-90c7-470cd7afae3b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:22:27,518 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:27,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:27,519 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:27,519 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:27,520 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:27,520 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:27,520 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:22:27,520 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:27,520 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:27,521 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:22:27,521 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:22:27,521 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:27,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:27,525 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:27,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:22:27,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:27,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:27,526 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:22:27,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:27,526 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:22:27,526 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:27,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:22:27,527 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:22:27,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:27,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:27,528 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:27,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:27,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:27,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:27,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:27,528 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:22:27,529 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:22:27,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:22:27,529 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:22:27,529 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:27,529 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_3da6c28d-8998-4896-90c7-470cd7afae3b/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 -> 63231100df91d767f63e82b83b0d6c2eaec3a983 [2019-10-22 11:22:27,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:27,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:27,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:27,574 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:27,575 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:27,575 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3da6c28d-8998-4896-90c7-470cd7afae3b/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c [2019-10-22 11:22:27,625 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3da6c28d-8998-4896-90c7-470cd7afae3b/bin/utaipan/data/d61d03e5c/92045873a14a4f3c817ac6313f8957da/FLAG54203a7ef [2019-10-22 11:22:28,138 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:28,138 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3da6c28d-8998-4896-90c7-470cd7afae3b/sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c [2019-10-22 11:22:28,159 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3da6c28d-8998-4896-90c7-470cd7afae3b/bin/utaipan/data/d61d03e5c/92045873a14a4f3c817ac6313f8957da/FLAG54203a7ef [2019-10-22 11:22:28,599 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3da6c28d-8998-4896-90c7-470cd7afae3b/bin/utaipan/data/d61d03e5c/92045873a14a4f3c817ac6313f8957da [2019-10-22 11:22:28,603 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:28,604 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:28,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:28,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:28,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:28,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:28" (1/1) ... [2019-10-22 11:22:28,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c0a6458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:28, skipping insertion in model container [2019-10-22 11:22:28,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:28" (1/1) ... [2019-10-22 11:22:28,619 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:28,659 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:28,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:28,990 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:29,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:29,095 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:29,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:29 WrapperNode [2019-10-22 11:22:29,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:29,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:29,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:29,097 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:29,106 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:22:29" (1/1) ... [2019-10-22 11:22:29,121 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:22:29" (1/1) ... [2019-10-22 11:22:29,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:29,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:29,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:29,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:29,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:29" (1/1) ... [2019-10-22 11:22:29,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:29" (1/1) ... [2019-10-22 11:22:29,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:29" (1/1) ... [2019-10-22 11:22:29,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:29" (1/1) ... [2019-10-22 11:22:29,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:29" (1/1) ... [2019-10-22 11:22:29,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:29" (1/1) ... [2019-10-22 11:22:29,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:29" (1/1) ... [2019-10-22 11:22:29,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:29,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:29,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:29,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:29,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3da6c28d-8998-4896-90c7-470cd7afae3b/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:22:29,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:22:29,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:22:29,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:29,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:30,094 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:30,094 INFO L284 CfgBuilder]: Removed 158 assume(true) statements. [2019-10-22 11:22:30,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:30 BoogieIcfgContainer [2019-10-22 11:22:30,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:30,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:30,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:30,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:30,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:28" (1/3) ... [2019-10-22 11:22:30,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e7fa4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:30, skipping insertion in model container [2019-10-22 11:22:30,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:29" (2/3) ... [2019-10-22 11:22:30,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e7fa4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:30, skipping insertion in model container [2019-10-22 11:22:30,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:30" (3/3) ... [2019-10-22 11:22:30,104 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product50.cil.c [2019-10-22 11:22:30,113 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:30,121 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:22:30,135 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:22:30,165 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:30,165 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:22:30,165 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:30,165 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:30,165 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:30,166 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:30,166 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:30,166 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2019-10-22 11:22:30,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:22:30,186 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:30,186 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:30,188 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:30,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:30,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1800894747, now seen corresponding path program 1 times [2019-10-22 11:22:30,199 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:30,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368679064] [2019-10-22 11:22:30,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:30,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:30,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:30,418 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:22:30,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368679064] [2019-10-22 11:22:30,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:30,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:30,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847457198] [2019-10-22 11:22:30,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:22:30,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:30,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:22:30,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:22:30,438 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 2 states. [2019-10-22 11:22:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:30,471 INFO L93 Difference]: Finished difference Result 228 states and 347 transitions. [2019-10-22 11:22:30,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:22:30,472 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-22 11:22:30,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:30,483 INFO L225 Difference]: With dead ends: 228 [2019-10-22 11:22:30,484 INFO L226 Difference]: Without dead ends: 113 [2019-10-22 11:22:30,487 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:22:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-22 11:22:30,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-10-22 11:22:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-22 11:22:30,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2019-10-22 11:22:30,525 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 16 [2019-10-22 11:22:30,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:30,525 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2019-10-22 11:22:30,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:22:30,526 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2019-10-22 11:22:30,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:22:30,527 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:30,527 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:30,527 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:30,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:30,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1447315652, now seen corresponding path program 1 times [2019-10-22 11:22:30,528 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:30,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823539933] [2019-10-22 11:22:30,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:30,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:30,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:30,673 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:22:30,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823539933] [2019-10-22 11:22:30,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:30,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:30,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319770311] [2019-10-22 11:22:30,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:30,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:30,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:30,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:30,677 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand 3 states. [2019-10-22 11:22:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:30,691 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2019-10-22 11:22:30,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:30,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 11:22:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:30,692 INFO L225 Difference]: With dead ends: 113 [2019-10-22 11:22:30,692 INFO L226 Difference]: Without dead ends: 47 [2019-10-22 11:22:30,693 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:22:30,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-22 11:22:30,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-10-22 11:22:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 11:22:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2019-10-22 11:22:30,697 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2019-10-22 11:22:30,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:30,697 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2019-10-22 11:22:30,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:30,697 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2019-10-22 11:22:30,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:22:30,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:30,698 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:30,698 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:30,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:30,698 INFO L82 PathProgramCache]: Analyzing trace with hash -230586389, now seen corresponding path program 1 times [2019-10-22 11:22:30,699 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:30,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176676791] [2019-10-22 11:22:30,699 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:30,699 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:30,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:30,806 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:22:30,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176676791] [2019-10-22 11:22:30,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:30,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:30,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521096383] [2019-10-22 11:22:30,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:30,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:30,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:30,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:30,808 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 5 states. [2019-10-22 11:22:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:30,886 INFO L93 Difference]: Finished difference Result 88 states and 130 transitions. [2019-10-22 11:22:30,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:30,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-22 11:22:30,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:30,887 INFO L225 Difference]: With dead ends: 88 [2019-10-22 11:22:30,887 INFO L226 Difference]: Without dead ends: 47 [2019-10-22 11:22:30,888 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:22:30,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-22 11:22:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-10-22 11:22:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 11:22:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2019-10-22 11:22:30,894 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 22 [2019-10-22 11:22:30,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:30,894 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2019-10-22 11:22:30,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2019-10-22 11:22:30,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:22:30,895 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:30,895 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:22:30,896 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:30,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:30,896 INFO L82 PathProgramCache]: Analyzing trace with hash -108421843, now seen corresponding path program 1 times [2019-10-22 11:22:30,896 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:30,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536109106] [2019-10-22 11:22:30,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:30,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:30,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:30,948 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:22:30,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536109106] [2019-10-22 11:22:30,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:30,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:30,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081666071] [2019-10-22 11:22:30,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:30,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:30,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:30,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:30,950 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand 3 states. [2019-10-22 11:22:30,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:30,981 INFO L93 Difference]: Finished difference Result 109 states and 158 transitions. [2019-10-22 11:22:30,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:30,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 11:22:30,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:30,983 INFO L225 Difference]: With dead ends: 109 [2019-10-22 11:22:30,983 INFO L226 Difference]: Without dead ends: 68 [2019-10-22 11:22:30,983 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:22:30,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-22 11:22:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-10-22 11:22:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 11:22:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 93 transitions. [2019-10-22 11:22:30,992 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 93 transitions. Word has length 24 [2019-10-22 11:22:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:30,992 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 93 transitions. [2019-10-22 11:22:30,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 93 transitions. [2019-10-22 11:22:30,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:22:30,993 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:30,993 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] [2019-10-22 11:22:30,993 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:30,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:30,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1619186466, now seen corresponding path program 1 times [2019-10-22 11:22:30,994 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:30,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602197966] [2019-10-22 11:22:30,994 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:30,994 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:30,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:31,100 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:22:31,100 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602197966] [2019-10-22 11:22:31,100 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:31,101 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:31,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128927599] [2019-10-22 11:22:31,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:31,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:31,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:31,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:31,102 INFO L87 Difference]: Start difference. First operand 66 states and 93 transitions. Second operand 5 states. [2019-10-22 11:22:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:31,197 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2019-10-22 11:22:31,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:31,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-22 11:22:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:31,198 INFO L225 Difference]: With dead ends: 175 [2019-10-22 11:22:31,199 INFO L226 Difference]: Without dead ends: 115 [2019-10-22 11:22:31,199 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:22:31,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-22 11:22:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2019-10-22 11:22:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 11:22:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2019-10-22 11:22:31,208 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 99 transitions. Word has length 30 [2019-10-22 11:22:31,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:31,208 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 99 transitions. [2019-10-22 11:22:31,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:31,209 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2019-10-22 11:22:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:22:31,209 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:31,210 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] [2019-10-22 11:22:31,210 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:31,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:31,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1043324577, now seen corresponding path program 1 times [2019-10-22 11:22:31,210 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:31,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208619963] [2019-10-22 11:22:31,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:31,268 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:22:31,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208619963] [2019-10-22 11:22:31,269 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:31,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:31,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214401391] [2019-10-22 11:22:31,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:31,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:31,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:31,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:31,271 INFO L87 Difference]: Start difference. First operand 72 states and 99 transitions. Second operand 5 states. [2019-10-22 11:22:31,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:31,384 INFO L93 Difference]: Finished difference Result 204 states and 283 transitions. [2019-10-22 11:22:31,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:22:31,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-22 11:22:31,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:31,386 INFO L225 Difference]: With dead ends: 204 [2019-10-22 11:22:31,386 INFO L226 Difference]: Without dead ends: 202 [2019-10-22 11:22:31,387 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:22:31,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-22 11:22:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 72. [2019-10-22 11:22:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 11:22:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2019-10-22 11:22:31,403 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 30 [2019-10-22 11:22:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:31,404 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2019-10-22 11:22:31,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2019-10-22 11:22:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:22:31,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:31,405 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] [2019-10-22 11:22:31,405 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:31,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:31,405 INFO L82 PathProgramCache]: Analyzing trace with hash -2012213476, now seen corresponding path program 1 times [2019-10-22 11:22:31,405 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:31,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583880458] [2019-10-22 11:22:31,406 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,406 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:31,460 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:22:31,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583880458] [2019-10-22 11:22:31,460 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:31,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:31,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529487204] [2019-10-22 11:22:31,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:31,461 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:31,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:31,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:31,462 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand 4 states. [2019-10-22 11:22:31,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:31,516 INFO L93 Difference]: Finished difference Result 168 states and 229 transitions. [2019-10-22 11:22:31,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:31,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-22 11:22:31,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:31,518 INFO L225 Difference]: With dead ends: 168 [2019-10-22 11:22:31,518 INFO L226 Difference]: Without dead ends: 102 [2019-10-22 11:22:31,518 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:22:31,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-22 11:22:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 76. [2019-10-22 11:22:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-22 11:22:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2019-10-22 11:22:31,537 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 30 [2019-10-22 11:22:31,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:31,538 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2019-10-22 11:22:31,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:31,538 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2019-10-22 11:22:31,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:22:31,538 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:31,539 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] [2019-10-22 11:22:31,539 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:31,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:31,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1754048038, now seen corresponding path program 1 times [2019-10-22 11:22:31,539 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:31,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772792698] [2019-10-22 11:22:31,540 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,540 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:31,601 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:22:31,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772792698] [2019-10-22 11:22:31,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:31,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:31,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197741585] [2019-10-22 11:22:31,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:31,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:31,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:31,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:31,603 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 3 states. [2019-10-22 11:22:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:31,635 INFO L93 Difference]: Finished difference Result 172 states and 232 transitions. [2019-10-22 11:22:31,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:31,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-22 11:22:31,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:31,636 INFO L225 Difference]: With dead ends: 172 [2019-10-22 11:22:31,636 INFO L226 Difference]: Without dead ends: 102 [2019-10-22 11:22:31,637 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:22:31,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-22 11:22:31,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-10-22 11:22:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-22 11:22:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2019-10-22 11:22:31,657 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 30 [2019-10-22 11:22:31,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:31,657 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 134 transitions. [2019-10-22 11:22:31,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:31,657 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2019-10-22 11:22:31,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:22:31,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:31,660 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:31,660 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:31,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:31,660 INFO L82 PathProgramCache]: Analyzing trace with hash 533103064, now seen corresponding path program 1 times [2019-10-22 11:22:31,661 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:31,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782410333] [2019-10-22 11:22:31,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:31,752 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:22:31,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782410333] [2019-10-22 11:22:31,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:31,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:31,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021359987] [2019-10-22 11:22:31,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:31,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:31,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:31,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:31,754 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. Second operand 5 states. [2019-10-22 11:22:31,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:31,880 INFO L93 Difference]: Finished difference Result 553 states and 737 transitions. [2019-10-22 11:22:31,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:22:31,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-22 11:22:31,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:31,882 INFO L225 Difference]: With dead ends: 553 [2019-10-22 11:22:31,883 INFO L226 Difference]: Without dead ends: 457 [2019-10-22 11:22:31,883 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:22:31,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-10-22 11:22:31,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 190. [2019-10-22 11:22:31,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-22 11:22:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 248 transitions. [2019-10-22 11:22:31,911 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 248 transitions. Word has length 31 [2019-10-22 11:22:31,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:31,912 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 248 transitions. [2019-10-22 11:22:31,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:31,912 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 248 transitions. [2019-10-22 11:22:31,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:22:31,913 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:31,913 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:31,913 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:31,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:31,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1099927890, now seen corresponding path program 1 times [2019-10-22 11:22:31,918 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:31,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493793844] [2019-10-22 11:22:31,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:22:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:22:32,975 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:22:32,975 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:22:33,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:22:33 BoogieIcfgContainer [2019-10-22 11:22:33,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:22:33,094 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:22:33,094 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:22:33,095 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:22:33,095 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:30" (3/4) ... [2019-10-22 11:22:33,099 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:22:33,213 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3da6c28d-8998-4896-90c7-470cd7afae3b/bin/utaipan/witness.graphml [2019-10-22 11:22:33,213 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:22:33,215 INFO L168 Benchmark]: Toolchain (without parser) took 4610.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -200.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:33,216 INFO L168 Benchmark]: CDTParser took 0.17 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:22:33,216 INFO L168 Benchmark]: CACSL2BoogieTranslator took 490.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:33,217 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:33,218 INFO L168 Benchmark]: Boogie Preprocessor took 53.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:33,219 INFO L168 Benchmark]: RCFGBuilder took 882.33 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: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:33,220 INFO L168 Benchmark]: TraceAbstraction took 2997.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -108.9 MB). Peak memory consumption was 181.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:33,220 INFO L168 Benchmark]: Witness Printer took 118.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:33,222 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 490.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 882.33 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: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2997.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -108.9 MB). Peak memory consumption was 181.0 MB. Max. memory is 11.5 GB. * Witness Printer took 118.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 388]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L76] int waterLevel = 1; [L77] int methaneLevelCritical = 0; [L179] int cleanupTimeShifts = 4; [L395] int pumpRunning = 0; [L396] int systemActive = 1; [L769] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L258] int retValue_acc ; [L259] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L307] int retValue_acc ; [L310] retValue_acc = 1 [L311] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L265] tmp = valid_product() [L267] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L318] int splverifierCounter ; [L319] int tmp ; [L320] int tmp___0 ; [L321] int tmp___1 ; [L322] int tmp___2 ; [L325] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L327] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L329] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L335] tmp = __VERIFIER_nondet_int() [L337] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L94] COND TRUE waterLevel < 2 [L95] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L345] tmp___0 = __VERIFIER_nondet_int() [L347] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L106] COND FALSE !(\read(methaneLevelCritical)) [L109] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L355] tmp___2 = __VERIFIER_nondet_int() [L357] COND TRUE \read(tmp___2) [L595] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L402] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L409] COND TRUE \read(systemActive) [L457] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L460] COND FALSE !(\read(pumpRunning)) [L431] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L434] COND TRUE ! pumpRunning [L554] int retValue_acc ; [L555] int tmp ; [L556] int tmp___0 ; [L156] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L159] COND FALSE !(waterLevel < 2) [L163] retValue_acc = 0 [L164] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L560] tmp = isHighWaterSensorDry() [L562] COND FALSE !(\read(tmp)) [L565] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L567] retValue_acc = tmp___0 [L568] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L436] tmp = isHighWaterLevel() [L438] COND TRUE \read(tmp) [L485] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L44] int tmp ; [L45] int tmp___0 ; [L115] int retValue_acc ; [L118] retValue_acc = methaneLevelCritical [L119] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L49] tmp = isMethaneLevelCritical() [L51] COND TRUE \read(tmp) [L509] int retValue_acc ; [L512] retValue_acc = pumpRunning [L513] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L53] tmp___0 = isPumpRunning() [L55] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L388] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 117 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.9s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 828 SDtfs, 1030 SDslu, 1038 SDs, 0 SdLazy, 141 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 468 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 11349 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...