./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec1_product34.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_5548a1c6-0d61-4c92-b448-575da2ee8c10/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5548a1c6-0d61-4c92-b448-575da2ee8c10/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5548a1c6-0d61-4c92-b448-575da2ee8c10/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5548a1c6-0d61-4c92-b448-575da2ee8c10/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec1_product34.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5548a1c6-0d61-4c92-b448-575da2ee8c10/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5548a1c6-0d61-4c92-b448-575da2ee8c10/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 45e9be5ff3d2c5f3e04037cd81f89ba3fcf7e541 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:26:44,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:44,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:44,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:44,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:44,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:44,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:44,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:44,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:44,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:44,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:44,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:44,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:44,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:44,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:44,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:44,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:44,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:44,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:44,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:44,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:44,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:44,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:44,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:44,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:44,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:44,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:44,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:44,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:44,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:44,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:44,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:44,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:44,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:44,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:44,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:44,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:44,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:44,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:44,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:44,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:44,610 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5548a1c6-0d61-4c92-b448-575da2ee8c10/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:26:44,622 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:44,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:44,623 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:44,623 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:44,623 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:44,623 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:44,624 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:26:44,624 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:44,624 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:44,624 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:26:44,624 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:26:44,624 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:44,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:44,625 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:26:44,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:26:44,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:26:44,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:44,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:26:44,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:44,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:26:44,627 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:26:44,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:26:44,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:26:44,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:44,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:44,628 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:44,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:44,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:44,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:44,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:44,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:26:44,629 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:26:44,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:26:44,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:26:44,629 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:44,630 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_5548a1c6-0d61-4c92-b448-575da2ee8c10/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 -> 45e9be5ff3d2c5f3e04037cd81f89ba3fcf7e541 [2019-10-22 11:26:44,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:44,665 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:44,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:44,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:44,670 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:44,670 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5548a1c6-0d61-4c92-b448-575da2ee8c10/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec1_product34.cil.c [2019-10-22 11:26:44,717 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5548a1c6-0d61-4c92-b448-575da2ee8c10/bin/utaipan/data/c92d44452/7d558fd4eb1b4acb93829bd39f7ed535/FLAG30ff13a71 [2019-10-22 11:26:45,122 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:45,123 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5548a1c6-0d61-4c92-b448-575da2ee8c10/sv-benchmarks/c/product-lines/minepump_spec1_product34.cil.c [2019-10-22 11:26:45,133 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5548a1c6-0d61-4c92-b448-575da2ee8c10/bin/utaipan/data/c92d44452/7d558fd4eb1b4acb93829bd39f7ed535/FLAG30ff13a71 [2019-10-22 11:26:45,144 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5548a1c6-0d61-4c92-b448-575da2ee8c10/bin/utaipan/data/c92d44452/7d558fd4eb1b4acb93829bd39f7ed535 [2019-10-22 11:26:45,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:45,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:45,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:45,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:45,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:45,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:45" (1/1) ... [2019-10-22 11:26:45,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582e0139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:45, skipping insertion in model container [2019-10-22 11:26:45,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:45" (1/1) ... [2019-10-22 11:26:45,163 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:45,197 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:45,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:45,520 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:45,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:45,647 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:45,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:45 WrapperNode [2019-10-22 11:26:45,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:45,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:45,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:45,648 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:45,656 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:26:45" (1/1) ... [2019-10-22 11:26:45,670 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:26:45" (1/1) ... [2019-10-22 11:26:45,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:45,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:45,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:45,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:45,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:45" (1/1) ... [2019-10-22 11:26:45,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:45" (1/1) ... [2019-10-22 11:26:45,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:45" (1/1) ... [2019-10-22 11:26:45,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:45" (1/1) ... [2019-10-22 11:26:45,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:45" (1/1) ... [2019-10-22 11:26:45,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:45" (1/1) ... [2019-10-22 11:26:45,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:45" (1/1) ... [2019-10-22 11:26:45,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:45,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:45,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:45,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:45,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5548a1c6-0d61-4c92-b448-575da2ee8c10/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:26:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:26:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:26:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:45,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:46,562 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:26:46,562 INFO L284 CfgBuilder]: Removed 98 assume(true) statements. [2019-10-22 11:26:46,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:46 BoogieIcfgContainer [2019-10-22 11:26:46,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:26:46,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:26:46,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:26:46,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:26:46,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:45" (1/3) ... [2019-10-22 11:26:46,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2682ca08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:46, skipping insertion in model container [2019-10-22 11:26:46,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:45" (2/3) ... [2019-10-22 11:26:46,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2682ca08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:46, skipping insertion in model container [2019-10-22 11:26:46,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:46" (3/3) ... [2019-10-22 11:26:46,574 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product34.cil.c [2019-10-22 11:26:46,584 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:26:46,595 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:26:46,606 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:26:46,637 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:26:46,637 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:26:46,637 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:26:46,638 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:26:46,638 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:26:46,638 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:26:46,638 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:26:46,638 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:26:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-10-22 11:26:46,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:26:46,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:46,661 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:26:46,664 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:46,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:46,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1424204181, now seen corresponding path program 1 times [2019-10-22 11:26:46,678 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:46,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95963059] [2019-10-22 11:26:46,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:46,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:46,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:46,861 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:26:46,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95963059] [2019-10-22 11:26:46,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:46,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:46,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746698125] [2019-10-22 11:26:46,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:26:46,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:46,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:26:46,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:26:46,880 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2019-10-22 11:26:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:46,904 INFO L93 Difference]: Finished difference Result 150 states and 227 transitions. [2019-10-22 11:26:46,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:26:46,906 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-22 11:26:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:46,915 INFO L225 Difference]: With dead ends: 150 [2019-10-22 11:26:46,915 INFO L226 Difference]: Without dead ends: 74 [2019-10-22 11:26:46,918 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:26:46,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-22 11:26:46,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-22 11:26:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 11:26:46,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2019-10-22 11:26:46,958 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 16 [2019-10-22 11:26:46,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:46,959 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2019-10-22 11:26:46,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:26:46,959 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2019-10-22 11:26:46,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:26:46,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:46,960 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:26:46,960 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:46,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:46,960 INFO L82 PathProgramCache]: Analyzing trace with hash -631654862, now seen corresponding path program 1 times [2019-10-22 11:26:46,960 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:46,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464359072] [2019-10-22 11:26:46,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:46,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:46,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:47,044 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:26:47,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464359072] [2019-10-22 11:26:47,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:47,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:47,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125883886] [2019-10-22 11:26:47,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:47,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:47,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:47,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:47,047 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand 3 states. [2019-10-22 11:26:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:47,064 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2019-10-22 11:26:47,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:47,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 11:26:47,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:47,071 INFO L225 Difference]: With dead ends: 74 [2019-10-22 11:26:47,071 INFO L226 Difference]: Without dead ends: 34 [2019-10-22 11:26:47,072 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:26:47,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-22 11:26:47,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-22 11:26:47,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:26:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2019-10-22 11:26:47,079 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 17 [2019-10-22 11:26:47,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:47,079 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2019-10-22 11:26:47,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:47,079 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2019-10-22 11:26:47,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:26:47,080 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:47,080 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:26:47,080 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:47,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:47,080 INFO L82 PathProgramCache]: Analyzing trace with hash -964945646, now seen corresponding path program 1 times [2019-10-22 11:26:47,081 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:47,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897387557] [2019-10-22 11:26:47,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:47,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:47,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:47,208 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:26:47,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897387557] [2019-10-22 11:26:47,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:47,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:47,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140647294] [2019-10-22 11:26:47,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:47,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:47,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:47,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:47,210 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 5 states. [2019-10-22 11:26:47,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:47,259 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2019-10-22 11:26:47,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:47,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-22 11:26:47,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:47,261 INFO L225 Difference]: With dead ends: 62 [2019-10-22 11:26:47,261 INFO L226 Difference]: Without dead ends: 34 [2019-10-22 11:26:47,261 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:26:47,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-22 11:26:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-22 11:26:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:26:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2019-10-22 11:26:47,266 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 22 [2019-10-22 11:26:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:47,266 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-10-22 11:26:47,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2019-10-22 11:26:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:26:47,267 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:47,267 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:47,267 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:47,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:47,267 INFO L82 PathProgramCache]: Analyzing trace with hash -952202930, now seen corresponding path program 1 times [2019-10-22 11:26:47,268 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:47,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820166358] [2019-10-22 11:26:47,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:47,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:47,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:47,311 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:26:47,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820166358] [2019-10-22 11:26:47,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:47,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:47,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293159679] [2019-10-22 11:26:47,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:47,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:47,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:47,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:47,313 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand 3 states. [2019-10-22 11:26:47,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:47,355 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2019-10-22 11:26:47,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:47,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 11:26:47,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:47,356 INFO L225 Difference]: With dead ends: 83 [2019-10-22 11:26:47,356 INFO L226 Difference]: Without dead ends: 55 [2019-10-22 11:26:47,356 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:26:47,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-22 11:26:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-10-22 11:26:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 11:26:47,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2019-10-22 11:26:47,366 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 23 [2019-10-22 11:26:47,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:47,366 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2019-10-22 11:26:47,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2019-10-22 11:26:47,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 11:26:47,369 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:47,369 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] [2019-10-22 11:26:47,370 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:47,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:47,370 INFO L82 PathProgramCache]: Analyzing trace with hash -2049720417, now seen corresponding path program 1 times [2019-10-22 11:26:47,370 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:47,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216618453] [2019-10-22 11:26:47,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:47,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:47,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:47,449 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:26:47,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216618453] [2019-10-22 11:26:47,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:47,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:47,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276817927] [2019-10-22 11:26:47,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:47,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:47,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:47,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:47,451 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand 5 states. [2019-10-22 11:26:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:47,524 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2019-10-22 11:26:47,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:26:47,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-10-22 11:26:47,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:47,525 INFO L225 Difference]: With dead ends: 139 [2019-10-22 11:26:47,525 INFO L226 Difference]: Without dead ends: 92 [2019-10-22 11:26:47,526 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:26:47,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-22 11:26:47,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2019-10-22 11:26:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-22 11:26:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2019-10-22 11:26:47,537 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 29 [2019-10-22 11:26:47,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:47,538 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2019-10-22 11:26:47,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2019-10-22 11:26:47,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 11:26:47,539 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:47,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] [2019-10-22 11:26:47,539 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:47,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:47,539 INFO L82 PathProgramCache]: Analyzing trace with hash 612790626, now seen corresponding path program 1 times [2019-10-22 11:26:47,539 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:47,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901067792] [2019-10-22 11:26:47,540 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:47,540 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:47,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:47,619 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:26:47,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901067792] [2019-10-22 11:26:47,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:47,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:47,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534615464] [2019-10-22 11:26:47,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:47,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:47,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:47,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:47,621 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand 5 states. [2019-10-22 11:26:47,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:47,757 INFO L93 Difference]: Finished difference Result 270 states and 384 transitions. [2019-10-22 11:26:47,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:26:47,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-10-22 11:26:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:47,763 INFO L225 Difference]: With dead ends: 270 [2019-10-22 11:26:47,763 INFO L226 Difference]: Without dead ends: 220 [2019-10-22 11:26:47,764 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:26:47,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-22 11:26:47,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 100. [2019-10-22 11:26:47,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-22 11:26:47,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2019-10-22 11:26:47,787 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 29 [2019-10-22 11:26:47,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:47,788 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2019-10-22 11:26:47,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:47,788 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2019-10-22 11:26:47,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:26:47,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:47,789 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:26:47,789 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:47,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:47,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1166654740, now seen corresponding path program 1 times [2019-10-22 11:26:47,790 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:47,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361627161] [2019-10-22 11:26:47,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:47,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:47,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:47,857 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:26:47,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361627161] [2019-10-22 11:26:47,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:47,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:47,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949202205] [2019-10-22 11:26:47,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:47,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:47,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:47,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:47,860 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand 5 states. [2019-10-22 11:26:47,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:47,983 INFO L93 Difference]: Finished difference Result 280 states and 386 transitions. [2019-10-22 11:26:47,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:26:47,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-22 11:26:47,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:47,985 INFO L225 Difference]: With dead ends: 280 [2019-10-22 11:26:47,986 INFO L226 Difference]: Without dead ends: 278 [2019-10-22 11:26:47,986 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:26:47,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-10-22 11:26:47,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 100. [2019-10-22 11:26:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-22 11:26:48,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 136 transitions. [2019-10-22 11:26:48,001 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 136 transitions. Word has length 30 [2019-10-22 11:26:48,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:48,001 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 136 transitions. [2019-10-22 11:26:48,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:48,001 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 136 transitions. [2019-10-22 11:26:48,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:26:48,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:48,003 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:26:48,003 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:48,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:48,003 INFO L82 PathProgramCache]: Analyzing trace with hash 72774503, now seen corresponding path program 1 times [2019-10-22 11:26:48,004 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:48,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477758321] [2019-10-22 11:26:48,004 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:48,004 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:48,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:48,057 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:26:48,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477758321] [2019-10-22 11:26:48,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:48,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:48,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539583287] [2019-10-22 11:26:48,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:48,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:48,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:48,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:48,059 INFO L87 Difference]: Start difference. First operand 100 states and 136 transitions. Second operand 4 states. [2019-10-22 11:26:48,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:48,096 INFO L93 Difference]: Finished difference Result 240 states and 326 transitions. [2019-10-22 11:26:48,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:48,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-22 11:26:48,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:48,098 INFO L225 Difference]: With dead ends: 240 [2019-10-22 11:26:48,098 INFO L226 Difference]: Without dead ends: 146 [2019-10-22 11:26:48,100 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:26:48,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-22 11:26:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2019-10-22 11:26:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-22 11:26:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 140 transitions. [2019-10-22 11:26:48,118 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 140 transitions. Word has length 30 [2019-10-22 11:26:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:48,119 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 140 transitions. [2019-10-22 11:26:48,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:48,119 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 140 transitions. [2019-10-22 11:26:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:26:48,120 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:48,120 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:26:48,120 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:48,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:48,121 INFO L82 PathProgramCache]: Analyzing trace with hash 330939941, now seen corresponding path program 1 times [2019-10-22 11:26:48,121 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:48,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72515424] [2019-10-22 11:26:48,121 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:48,121 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:48,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:48,182 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:26:48,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72515424] [2019-10-22 11:26:48,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:48,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:48,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996334057] [2019-10-22 11:26:48,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:48,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:48,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:48,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:48,184 INFO L87 Difference]: Start difference. First operand 104 states and 140 transitions. Second operand 3 states. [2019-10-22 11:26:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:48,212 INFO L93 Difference]: Finished difference Result 250 states and 336 transitions. [2019-10-22 11:26:48,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:48,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-22 11:26:48,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:48,214 INFO L225 Difference]: With dead ends: 250 [2019-10-22 11:26:48,214 INFO L226 Difference]: Without dead ends: 152 [2019-10-22 11:26:48,215 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:26:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-22 11:26:48,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-10-22 11:26:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-22 11:26:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 198 transitions. [2019-10-22 11:26:48,264 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 198 transitions. Word has length 30 [2019-10-22 11:26:48,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:48,264 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 198 transitions. [2019-10-22 11:26:48,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:48,264 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2019-10-22 11:26:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:26:48,265 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:48,265 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:26:48,265 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:48,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:48,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1676876253, now seen corresponding path program 1 times [2019-10-22 11:26:48,266 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:48,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079270613] [2019-10-22 11:26:48,269 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:48,269 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:48,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:26:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:26:49,072 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:26:49,072 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:26:49,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:26:49 BoogieIcfgContainer [2019-10-22 11:26:49,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:26:49,152 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:26:49,153 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:26:49,153 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:26:49,153 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:46" (3/4) ... [2019-10-22 11:26:49,158 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:26:49,257 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5548a1c6-0d61-4c92-b448-575da2ee8c10/bin/utaipan/witness.graphml [2019-10-22 11:26:49,257 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:26:49,259 INFO L168 Benchmark]: Toolchain (without parser) took 4111.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.7 MB in the beginning and 916.5 MB in the end (delta: 28.2 MB). Peak memory consumption was 169.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:49,260 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:49,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 499.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -186.1 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:49,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.30 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:49,261 INFO L168 Benchmark]: Boogie Preprocessor took 60.05 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:26:49,261 INFO L168 Benchmark]: RCFGBuilder took 781.76 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: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:49,261 INFO L168 Benchmark]: TraceAbstraction took 2587.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 933.7 MB in the end (delta: 129.1 MB). Peak memory consumption was 129.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:49,262 INFO L168 Benchmark]: Witness Printer took 105.08 ms. Allocated memory is still 1.2 GB. Free memory was 933.7 MB in the beginning and 916.5 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:49,263 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.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 499.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -186.1 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.30 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.05 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 781.76 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: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2587.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 933.7 MB in the end (delta: 129.1 MB). Peak memory consumption was 129.1 MB. Max. memory is 11.5 GB. * Witness Printer took 105.08 ms. Allocated memory is still 1.2 GB. Free memory was 933.7 MB in the beginning and 916.5 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 514]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L313] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L524] int waterLevel = 1; [L525] int methaneLevelCritical = 0; [L689] int pumpRunning = 0; [L690] int systemActive = 1; [L121] int retValue_acc ; [L122] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L902] int retValue_acc ; [L905] retValue_acc = 1 [L906] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L128] tmp = valid_product() [L130] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L620] int splverifierCounter ; [L621] int tmp ; [L622] int tmp___0 ; [L623] int tmp___1 ; [L624] int tmp___2 ; [L627] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L629] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L631] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L637] tmp = __VERIFIER_nondet_int() [L639] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L542] COND TRUE waterLevel < 2 [L543] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L647] tmp___0 = __VERIFIER_nondet_int() [L649] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L554] COND FALSE !(\read(methaneLevelCritical)) [L557] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L657] tmp___2 = __VERIFIER_nondet_int() [L659] COND TRUE \read(tmp___2) [L845] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L697] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L704] COND TRUE \read(systemActive) [L726] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L729] COND TRUE ! pumpRunning [L823] int retValue_acc ; [L824] int tmp ; [L825] int tmp___0 ; [L604] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L607] COND FALSE !(waterLevel < 2) [L611] retValue_acc = 0 [L612] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L829] tmp = isHighWaterSensorDry() [L831] COND FALSE !(\read(tmp)) [L834] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L836] retValue_acc = tmp___0 [L837] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L731] tmp = isHighWaterLevel() [L733] COND TRUE \read(tmp) [L754] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L851] int tmp ; [L852] int tmp___0 ; [L563] int retValue_acc ; [L566] retValue_acc = methaneLevelCritical [L567] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L856] tmp = isMethaneLevelCritical() [L858] COND TRUE \read(tmp) [L778] int retValue_acc ; [L781] retValue_acc = pumpRunning [L782] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L860] tmp___0 = isPumpRunning() [L862] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L514] __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, 78 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.5s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 577 SDtfs, 722 SDslu, 756 SDs, 0 SdLazy, 101 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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=152occurred 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, 378 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 10827 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...