./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec1_product49.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_90e6d928-c4e0-4cb3-979f-09f8c550f70e/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_90e6d928-c4e0-4cb3-979f-09f8c550f70e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_90e6d928-c4e0-4cb3-979f-09f8c550f70e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_90e6d928-c4e0-4cb3-979f-09f8c550f70e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec1_product49.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_90e6d928-c4e0-4cb3-979f-09f8c550f70e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_90e6d928-c4e0-4cb3-979f-09f8c550f70e/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 5f66ecd5f6aef5b29bc80dee4a57cabf0f421223 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:25:37,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:25:37,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:25:37,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:25:37,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:25:37,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:25:37,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:25:37,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:25:37,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:25:37,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:25:37,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:25:37,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:25:37,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:25:37,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:25:37,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:25:37,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:25:37,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:25:37,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:25:37,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:25:37,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:25:37,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:25:37,688 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:25:37,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:25:37,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:25:37,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:25:37,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:25:37,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:25:37,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:25:37,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:25:37,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:25:37,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:25:37,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:25:37,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:25:37,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:25:37,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:25:37,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:25:37,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:25:37,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:25:37,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:25:37,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:25:37,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:25:37,700 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_90e6d928-c4e0-4cb3-979f-09f8c550f70e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:25:37,715 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:25:37,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:25:37,716 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:25:37,717 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:25:37,717 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:25:37,719 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:25:37,719 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:25:37,719 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:25:37,720 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:25:37,720 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:25:37,720 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:25:37,720 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:25:37,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:25:37,721 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:25:37,721 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:25:37,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:25:37,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:25:37,722 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:25:37,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:25:37,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:25:37,723 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:25:37,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:25:37,723 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:25:37,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:25:37,724 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:25:37,724 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:25:37,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:25:37,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:25:37,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:25:37,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:25:37,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:25:37,726 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:25:37,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:25:37,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:25:37,727 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:25:37,727 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_90e6d928-c4e0-4cb3-979f-09f8c550f70e/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 -> 5f66ecd5f6aef5b29bc80dee4a57cabf0f421223 [2019-10-22 11:25:37,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:25:37,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:25:37,790 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:25:37,791 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:25:37,791 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:25:37,792 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_90e6d928-c4e0-4cb3-979f-09f8c550f70e/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec1_product49.cil.c [2019-10-22 11:25:37,854 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_90e6d928-c4e0-4cb3-979f-09f8c550f70e/bin/utaipan/data/10af6a500/0014982fbad640da9522b32006368834/FLAG90fea07b7 [2019-10-22 11:25:38,306 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:25:38,307 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_90e6d928-c4e0-4cb3-979f-09f8c550f70e/sv-benchmarks/c/product-lines/minepump_spec1_product49.cil.c [2019-10-22 11:25:38,320 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_90e6d928-c4e0-4cb3-979f-09f8c550f70e/bin/utaipan/data/10af6a500/0014982fbad640da9522b32006368834/FLAG90fea07b7 [2019-10-22 11:25:38,332 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_90e6d928-c4e0-4cb3-979f-09f8c550f70e/bin/utaipan/data/10af6a500/0014982fbad640da9522b32006368834 [2019-10-22 11:25:38,334 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:25:38,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:25:38,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:38,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:25:38,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:25:38,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:38" (1/1) ... [2019-10-22 11:25:38,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc74767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:38, skipping insertion in model container [2019-10-22 11:25:38,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:38" (1/1) ... [2019-10-22 11:25:38,352 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:25:38,406 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:25:38,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:38,880 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:25:38,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:39,006 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:25:39,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:39 WrapperNode [2019-10-22 11:25:39,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:39,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:39,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:25:39,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:25:39,018 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:25:39" (1/1) ... [2019-10-22 11:25:39,040 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:25:39" (1/1) ... [2019-10-22 11:25:39,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:39,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:25:39,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:25:39,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:25:39,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:39" (1/1) ... [2019-10-22 11:25:39,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:39" (1/1) ... [2019-10-22 11:25:39,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:39" (1/1) ... [2019-10-22 11:25:39,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:39" (1/1) ... [2019-10-22 11:25:39,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:39" (1/1) ... [2019-10-22 11:25:39,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:39" (1/1) ... [2019-10-22 11:25:39,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:39" (1/1) ... [2019-10-22 11:25:39,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:25:39,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:25:39,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:25:39,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:25:39,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90e6d928-c4e0-4cb3-979f-09f8c550f70e/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:25:39,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:25:39,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:25:39,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:25:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:25:40,224 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:25:40,225 INFO L284 CfgBuilder]: Removed 156 assume(true) statements. [2019-10-22 11:25:40,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:40 BoogieIcfgContainer [2019-10-22 11:25:40,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:25:40,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:25:40,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:25:40,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:25:40,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:25:38" (1/3) ... [2019-10-22 11:25:40,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9e9b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:40, skipping insertion in model container [2019-10-22 11:25:40,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:39" (2/3) ... [2019-10-22 11:25:40,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9e9b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:40, skipping insertion in model container [2019-10-22 11:25:40,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:40" (3/3) ... [2019-10-22 11:25:40,234 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product49.cil.c [2019-10-22 11:25:40,244 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:25:40,251 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:25:40,262 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:25:40,288 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:25:40,288 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:25:40,288 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:25:40,288 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:25:40,288 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:25:40,288 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:25:40,289 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:25:40,289 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:25:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2019-10-22 11:25:40,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:25:40,314 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:40,315 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:25:40,317 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:40,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:40,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1641629540, now seen corresponding path program 1 times [2019-10-22 11:25:40,332 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:40,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992945035] [2019-10-22 11:25:40,332 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:40,333 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:40,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:40,571 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:25:40,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992945035] [2019-10-22 11:25:40,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:40,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:40,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109887032] [2019-10-22 11:25:40,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:25:40,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:40,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:25:40,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:25:40,598 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 2 states. [2019-10-22 11:25:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:40,636 INFO L93 Difference]: Finished difference Result 228 states and 347 transitions. [2019-10-22 11:25:40,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:25:40,638 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-22 11:25:40,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:40,652 INFO L225 Difference]: With dead ends: 228 [2019-10-22 11:25:40,653 INFO L226 Difference]: Without dead ends: 113 [2019-10-22 11:25:40,657 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:25:40,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-22 11:25:40,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-10-22 11:25:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-22 11:25:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2019-10-22 11:25:40,709 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 16 [2019-10-22 11:25:40,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:40,709 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2019-10-22 11:25:40,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:25:40,710 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2019-10-22 11:25:40,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:25:40,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:40,711 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:25:40,711 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:40,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:40,711 INFO L82 PathProgramCache]: Analyzing trace with hash 594872643, now seen corresponding path program 1 times [2019-10-22 11:25:40,712 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:40,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774008180] [2019-10-22 11:25:40,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:40,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:40,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:40,842 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:25:40,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774008180] [2019-10-22 11:25:40,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:40,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:40,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163932092] [2019-10-22 11:25:40,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:40,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:40,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:40,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:40,848 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand 3 states. [2019-10-22 11:25:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:40,865 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2019-10-22 11:25:40,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:40,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 11:25:40,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:40,867 INFO L225 Difference]: With dead ends: 113 [2019-10-22 11:25:40,867 INFO L226 Difference]: Without dead ends: 47 [2019-10-22 11:25:40,868 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:25:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-22 11:25:40,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-10-22 11:25:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 11:25:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2019-10-22 11:25:40,874 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2019-10-22 11:25:40,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:40,875 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2019-10-22 11:25:40,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2019-10-22 11:25:40,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:25:40,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:40,876 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:25:40,876 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:40,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:40,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1404483435, now seen corresponding path program 1 times [2019-10-22 11:25:40,877 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:40,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29963444] [2019-10-22 11:25:40,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:40,878 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:40,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:41,009 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:25:41,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29963444] [2019-10-22 11:25:41,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:41,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:41,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142822014] [2019-10-22 11:25:41,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:25:41,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:41,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:25:41,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:25:41,012 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 6 states. [2019-10-22 11:25:41,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:41,144 INFO L93 Difference]: Finished difference Result 88 states and 130 transitions. [2019-10-22 11:25:41,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:25:41,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-10-22 11:25:41,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:41,148 INFO L225 Difference]: With dead ends: 88 [2019-10-22 11:25:41,148 INFO L226 Difference]: Without dead ends: 47 [2019-10-22 11:25:41,149 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:25:41,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-22 11:25:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-10-22 11:25:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 11:25:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2019-10-22 11:25:41,159 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 22 [2019-10-22 11:25:41,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:41,160 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2019-10-22 11:25:41,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:25:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2019-10-22 11:25:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:25:41,161 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:41,161 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:25:41,161 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:41,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:41,162 INFO L82 PathProgramCache]: Analyzing trace with hash -764351347, now seen corresponding path program 1 times [2019-10-22 11:25:41,162 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:41,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572052357] [2019-10-22 11:25:41,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:41,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:41,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:41,217 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:25:41,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572052357] [2019-10-22 11:25:41,218 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:41,218 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:41,218 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376775126] [2019-10-22 11:25:41,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:41,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:41,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:41,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:41,219 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand 3 states. [2019-10-22 11:25:41,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:41,266 INFO L93 Difference]: Finished difference Result 109 states and 158 transitions. [2019-10-22 11:25:41,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:41,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 11:25:41,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:41,268 INFO L225 Difference]: With dead ends: 109 [2019-10-22 11:25:41,268 INFO L226 Difference]: Without dead ends: 68 [2019-10-22 11:25:41,268 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:25:41,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-22 11:25:41,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-10-22 11:25:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 11:25:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 93 transitions. [2019-10-22 11:25:41,277 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 93 transitions. Word has length 24 [2019-10-22 11:25:41,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:41,278 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 93 transitions. [2019-10-22 11:25:41,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 93 transitions. [2019-10-22 11:25:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:25:41,279 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:41,279 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:25:41,279 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:41,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:41,280 INFO L82 PathProgramCache]: Analyzing trace with hash -805303330, now seen corresponding path program 1 times [2019-10-22 11:25:41,280 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:41,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058864930] [2019-10-22 11:25:41,280 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:41,280 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:41,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:41,408 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:25:41,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058864930] [2019-10-22 11:25:41,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:41,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:41,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265072984] [2019-10-22 11:25:41,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:41,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:41,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:41,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:41,413 INFO L87 Difference]: Start difference. First operand 66 states and 93 transitions. Second operand 5 states. [2019-10-22 11:25:41,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:41,528 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2019-10-22 11:25:41,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:25:41,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-22 11:25:41,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:41,531 INFO L225 Difference]: With dead ends: 175 [2019-10-22 11:25:41,531 INFO L226 Difference]: Without dead ends: 115 [2019-10-22 11:25:41,532 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:25:41,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-22 11:25:41,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2019-10-22 11:25:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 11:25:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2019-10-22 11:25:41,543 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 99 transitions. Word has length 30 [2019-10-22 11:25:41,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:41,545 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 99 transitions. [2019-10-22 11:25:41,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:41,546 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2019-10-22 11:25:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:25:41,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:41,547 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:25:41,547 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:41,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:41,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1857207713, now seen corresponding path program 1 times [2019-10-22 11:25:41,548 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:41,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839807191] [2019-10-22 11:25:41,548 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:41,548 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:41,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:41,608 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:25:41,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839807191] [2019-10-22 11:25:41,609 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:41,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:41,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744362139] [2019-10-22 11:25:41,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:41,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:41,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:41,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:41,611 INFO L87 Difference]: Start difference. First operand 72 states and 99 transitions. Second operand 5 states. [2019-10-22 11:25:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:41,771 INFO L93 Difference]: Finished difference Result 204 states and 283 transitions. [2019-10-22 11:25:41,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:25:41,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-22 11:25:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:41,774 INFO L225 Difference]: With dead ends: 204 [2019-10-22 11:25:41,774 INFO L226 Difference]: Without dead ends: 202 [2019-10-22 11:25:41,774 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:25:41,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-22 11:25:41,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 72. [2019-10-22 11:25:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 11:25:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2019-10-22 11:25:41,787 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 30 [2019-10-22 11:25:41,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:41,788 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2019-10-22 11:25:41,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:41,788 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2019-10-22 11:25:41,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:25:41,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:41,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:25:41,790 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:41,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:41,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1198330340, now seen corresponding path program 1 times [2019-10-22 11:25:41,790 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:41,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346814694] [2019-10-22 11:25:41,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:41,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:41,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:41,872 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:25:41,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346814694] [2019-10-22 11:25:41,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:41,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:25:41,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381462132] [2019-10-22 11:25:41,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:25:41,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:41,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:25:41,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:25:41,874 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand 6 states. [2019-10-22 11:25:41,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:41,966 INFO L93 Difference]: Finished difference Result 188 states and 256 transitions. [2019-10-22 11:25:41,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:25:41,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-10-22 11:25:41,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:41,969 INFO L225 Difference]: With dead ends: 188 [2019-10-22 11:25:41,969 INFO L226 Difference]: Without dead ends: 122 [2019-10-22 11:25:41,970 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:25:41,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-22 11:25:41,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 76. [2019-10-22 11:25:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-22 11:25:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2019-10-22 11:25:41,990 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 30 [2019-10-22 11:25:41,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:41,991 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2019-10-22 11:25:41,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:25:41,991 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2019-10-22 11:25:41,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:25:41,992 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:41,992 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:25:41,993 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:41,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:41,993 INFO L82 PathProgramCache]: Analyzing trace with hash -940164902, now seen corresponding path program 1 times [2019-10-22 11:25:41,993 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:41,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628130597] [2019-10-22 11:25:41,994 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:41,994 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:41,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:42,046 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:25:42,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628130597] [2019-10-22 11:25:42,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:42,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:42,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409134131] [2019-10-22 11:25:42,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:42,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:42,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:42,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:42,051 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 3 states. [2019-10-22 11:25:42,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:42,081 INFO L93 Difference]: Finished difference Result 172 states and 232 transitions. [2019-10-22 11:25:42,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:42,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-22 11:25:42,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:42,082 INFO L225 Difference]: With dead ends: 172 [2019-10-22 11:25:42,083 INFO L226 Difference]: Without dead ends: 102 [2019-10-22 11:25:42,083 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:25:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-22 11:25:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-10-22 11:25:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-22 11:25:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2019-10-22 11:25:42,108 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 30 [2019-10-22 11:25:42,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:42,108 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 134 transitions. [2019-10-22 11:25:42,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:42,108 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2019-10-22 11:25:42,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:25:42,109 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:42,111 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:42,112 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:42,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1346986200, now seen corresponding path program 1 times [2019-10-22 11:25:42,112 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:42,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527085119] [2019-10-22 11:25:42,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:42,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:42,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:42,201 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:25:42,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527085119] [2019-10-22 11:25:42,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:42,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:42,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945238957] [2019-10-22 11:25:42,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:42,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:42,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:42,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:42,203 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. Second operand 5 states. [2019-10-22 11:25:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:42,300 INFO L93 Difference]: Finished difference Result 553 states and 737 transitions. [2019-10-22 11:25:42,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:25:42,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-22 11:25:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:42,303 INFO L225 Difference]: With dead ends: 553 [2019-10-22 11:25:42,303 INFO L226 Difference]: Without dead ends: 457 [2019-10-22 11:25:42,304 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:25:42,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-10-22 11:25:42,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 190. [2019-10-22 11:25:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-22 11:25:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 248 transitions. [2019-10-22 11:25:42,336 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 248 transitions. Word has length 31 [2019-10-22 11:25:42,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:42,336 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 248 transitions. [2019-10-22 11:25:42,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 248 transitions. [2019-10-22 11:25:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:25:42,338 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:42,338 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:25:42,338 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:42,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:42,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1913811026, now seen corresponding path program 1 times [2019-10-22 11:25:42,339 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:42,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584314883] [2019-10-22 11:25:42,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:42,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:42,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:25:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:25:43,313 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:25:43,314 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:25:43,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:25:43 BoogieIcfgContainer [2019-10-22 11:25:43,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:25:43,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:25:43,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:25:43,431 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:25:43,431 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:40" (3/4) ... [2019-10-22 11:25:43,433 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:25:43,531 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_90e6d928-c4e0-4cb3-979f-09f8c550f70e/bin/utaipan/witness.graphml [2019-10-22 11:25:43,531 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:25:43,533 INFO L168 Benchmark]: Toolchain (without parser) took 5196.62 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.9 MB). Free memory was 945.9 MB in the beginning and 1.0 GB in the end (delta: -72.8 MB). Peak memory consumption was 152.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:43,533 INFO L168 Benchmark]: CDTParser took 0.14 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:25:43,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:43,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:43,534 INFO L168 Benchmark]: Boogie Preprocessor took 73.67 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:25:43,534 INFO L168 Benchmark]: RCFGBuilder took 1064.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.4 MB). Peak memory consumption was 79.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:43,536 INFO L168 Benchmark]: TraceAbstraction took 3203.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.9 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.3 MB). Peak memory consumption was 91.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:43,537 INFO L168 Benchmark]: Witness Printer took 100.41 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:43,538 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.14 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 671.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.67 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 1064.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.4 MB). Peak memory consumption was 79.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3203.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.9 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.3 MB). Peak memory consumption was 91.2 MB. Max. memory is 11.5 GB. * Witness Printer took 100.41 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 950]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] int cleanupTimeShifts = 4; [L342] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L545] int pumpRunning = 0; [L546] int systemActive = 1; [L843] int waterLevel = 1; [L844] int methaneLevelCritical = 0; [L150] int retValue_acc ; [L151] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L833] int retValue_acc ; [L836] retValue_acc = 1 [L837] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L157] tmp = valid_product() [L159] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L743] int splverifierCounter ; [L744] int tmp ; [L745] int tmp___0 ; [L746] int tmp___1 ; [L747] int tmp___2 ; [L750] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L752] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L754] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L760] tmp = __VERIFIER_nondet_int() [L762] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L861] COND TRUE waterLevel < 2 [L862] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L770] tmp___0 = __VERIFIER_nondet_int() [L772] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L873] COND FALSE !(\read(methaneLevelCritical)) [L876] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L780] tmp___2 = __VERIFIER_nondet_int() [L782] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L552] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L559] COND TRUE \read(systemActive) [L607] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L610] COND FALSE !(\read(pumpRunning)) [L581] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L584] COND TRUE ! pumpRunning [L704] int retValue_acc ; [L705] int tmp ; [L706] int tmp___0 ; [L923] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L926] COND FALSE !(waterLevel < 2) [L930] retValue_acc = 0 [L931] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L710] tmp = isHighWaterSensorDry() [L712] COND FALSE !(\read(tmp)) [L715] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L717] retValue_acc = tmp___0 [L718] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L586] tmp = isHighWaterLevel() [L588] COND TRUE \read(tmp) [L635] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L44] int tmp ; [L45] int tmp___0 ; [L882] int retValue_acc ; [L885] retValue_acc = methaneLevelCritical [L886] 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) [L659] int retValue_acc ; [L662] retValue_acc = pumpRunning [L663] 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] [L950] __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: 3.1s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 826 SDtfs, 1231 SDslu, 1056 SDs, 0 SdLazy, 148 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s 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, 488 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 12174 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...