./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec1_product40.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_2cfec52c-84b3-48c8-a64b-a0bde525e5ba/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2cfec52c-84b3-48c8-a64b-a0bde525e5ba/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2cfec52c-84b3-48c8-a64b-a0bde525e5ba/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2cfec52c-84b3-48c8-a64b-a0bde525e5ba/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec1_product40.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2cfec52c-84b3-48c8-a64b-a0bde525e5ba/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2cfec52c-84b3-48c8-a64b-a0bde525e5ba/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 ad65d1d3307a121fce5b7d95113e2f3f66b04b5a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:24:30,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:30,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:30,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:30,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:30,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:30,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:30,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:30,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:30,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:30,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:30,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:30,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:30,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:30,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:30,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:30,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:30,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:30,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:30,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:30,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:30,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:30,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:30,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:30,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:30,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:30,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:30,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:30,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:30,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:30,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:30,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:30,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:30,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:30,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:30,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:30,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:30,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:30,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:30,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:30,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:30,521 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2cfec52c-84b3-48c8-a64b-a0bde525e5ba/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:24:30,531 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:30,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:30,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:30,533 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:30,533 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:30,533 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:30,533 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:24:30,533 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:30,533 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:30,534 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:24:30,534 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:24:30,534 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:30,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:30,535 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:30,535 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:30,535 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:30,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:30,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:24:30,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:30,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:24:30,536 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:30,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:24:30,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:24:30,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:30,537 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:30,537 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:30,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:30,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:30,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:30,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:30,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:24:30,538 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:24:30,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:24:30,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:24:30,539 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:30,539 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_2cfec52c-84b3-48c8-a64b-a0bde525e5ba/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 -> ad65d1d3307a121fce5b7d95113e2f3f66b04b5a [2019-10-22 11:24:30,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:30,587 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:30,592 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:30,594 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:30,595 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:30,595 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2cfec52c-84b3-48c8-a64b-a0bde525e5ba/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec1_product40.cil.c [2019-10-22 11:24:30,644 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2cfec52c-84b3-48c8-a64b-a0bde525e5ba/bin/utaipan/data/b4f1aec39/92b49b15eb9f48fdb7b7993beead5b8a/FLAGfd72a9b14 [2019-10-22 11:24:31,068 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:31,068 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2cfec52c-84b3-48c8-a64b-a0bde525e5ba/sv-benchmarks/c/product-lines/minepump_spec1_product40.cil.c [2019-10-22 11:24:31,079 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2cfec52c-84b3-48c8-a64b-a0bde525e5ba/bin/utaipan/data/b4f1aec39/92b49b15eb9f48fdb7b7993beead5b8a/FLAGfd72a9b14 [2019-10-22 11:24:31,455 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2cfec52c-84b3-48c8-a64b-a0bde525e5ba/bin/utaipan/data/b4f1aec39/92b49b15eb9f48fdb7b7993beead5b8a [2019-10-22 11:24:31,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:31,458 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:31,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:31,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:31,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:31,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:31,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c191d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31, skipping insertion in model container [2019-10-22 11:24:31,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:31,475 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:31,520 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:31,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:31,878 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:31,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:31,997 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:31,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31 WrapperNode [2019-10-22 11:24:31,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:31,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:31,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:31,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:32,007 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:24:31" (1/1) ... [2019-10-22 11:24:32,020 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:24:31" (1/1) ... [2019-10-22 11:24:32,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:32,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:32,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:32,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:32,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:32,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:32,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:32,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:32,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:32,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:32,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:32,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:32,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:32,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:32,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:32,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cfec52c-84b3-48c8-a64b-a0bde525e5ba/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:24:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:24:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:24:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:32,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:32,903 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:32,903 INFO L284 CfgBuilder]: Removed 162 assume(true) statements. [2019-10-22 11:24:32,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:32 BoogieIcfgContainer [2019-10-22 11:24:32,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:32,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:32,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:32,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:32,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:31" (1/3) ... [2019-10-22 11:24:32,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5e90c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:32, skipping insertion in model container [2019-10-22 11:24:32,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31" (2/3) ... [2019-10-22 11:24:32,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5e90c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:32, skipping insertion in model container [2019-10-22 11:24:32,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:32" (3/3) ... [2019-10-22 11:24:32,911 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product40.cil.c [2019-10-22 11:24:32,920 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:32,927 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:24:32,938 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:24:32,966 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:32,966 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:24:32,966 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:32,967 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:32,967 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:32,967 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:32,967 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:32,967 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:32,985 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-10-22 11:24:32,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:24:32,992 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:32,992 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:24:32,994 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:33,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:33,000 INFO L82 PathProgramCache]: Analyzing trace with hash 2074315904, now seen corresponding path program 1 times [2019-10-22 11:24:33,008 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:33,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397038229] [2019-10-22 11:24:33,009 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,009 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:33,220 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:24:33,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397038229] [2019-10-22 11:24:33,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:33,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:33,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677303578] [2019-10-22 11:24:33,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:24:33,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:33,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:24:33,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:24:33,242 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-10-22 11:24:33,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:33,270 INFO L93 Difference]: Finished difference Result 220 states and 335 transitions. [2019-10-22 11:24:33,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:24:33,271 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-22 11:24:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:33,281 INFO L225 Difference]: With dead ends: 220 [2019-10-22 11:24:33,281 INFO L226 Difference]: Without dead ends: 109 [2019-10-22 11:24:33,284 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:24:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-22 11:24:33,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-10-22 11:24:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-22 11:24:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2019-10-22 11:24:33,320 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 16 [2019-10-22 11:24:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:33,321 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2019-10-22 11:24:33,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:24:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2019-10-22 11:24:33,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:24:33,322 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:33,322 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:24:33,322 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:33,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:33,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1027559007, now seen corresponding path program 1 times [2019-10-22 11:24:33,323 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:33,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108519451] [2019-10-22 11:24:33,323 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,323 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:33,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:24:33,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108519451] [2019-10-22 11:24:33,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:33,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:33,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538337610] [2019-10-22 11:24:33,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:33,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:33,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:33,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:33,453 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand 3 states. [2019-10-22 11:24:33,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:33,467 INFO L93 Difference]: Finished difference Result 109 states and 159 transitions. [2019-10-22 11:24:33,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:33,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 11:24:33,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:33,471 INFO L225 Difference]: With dead ends: 109 [2019-10-22 11:24:33,472 INFO L226 Difference]: Without dead ends: 47 [2019-10-22 11:24:33,472 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:24:33,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-22 11:24:33,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-10-22 11:24:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 11:24:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2019-10-22 11:24:33,479 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2019-10-22 11:24:33,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:33,481 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2019-10-22 11:24:33,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2019-10-22 11:24:33,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:24:33,482 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:33,482 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:24:33,482 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:33,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:33,482 INFO L82 PathProgramCache]: Analyzing trace with hash 109011716, now seen corresponding path program 1 times [2019-10-22 11:24:33,483 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:33,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363534820] [2019-10-22 11:24:33,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:33,593 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:24:33,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363534820] [2019-10-22 11:24:33,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:33,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:33,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314548242] [2019-10-22 11:24:33,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:33,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:33,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:33,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:33,595 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 5 states. [2019-10-22 11:24:33,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:33,663 INFO L93 Difference]: Finished difference Result 111 states and 164 transitions. [2019-10-22 11:24:33,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:33,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-22 11:24:33,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:33,665 INFO L225 Difference]: With dead ends: 111 [2019-10-22 11:24:33,665 INFO L226 Difference]: Without dead ends: 70 [2019-10-22 11:24:33,665 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:33,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-22 11:24:33,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2019-10-22 11:24:33,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 11:24:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2019-10-22 11:24:33,674 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 22 [2019-10-22 11:24:33,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:33,674 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2019-10-22 11:24:33,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:33,674 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2019-10-22 11:24:33,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:24:33,675 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:33,675 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:33,676 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:33,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:33,676 INFO L82 PathProgramCache]: Analyzing trace with hash 60563277, now seen corresponding path program 1 times [2019-10-22 11:24:33,676 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:33,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526114360] [2019-10-22 11:24:33,676 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,677 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:33,742 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:24:33,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526114360] [2019-10-22 11:24:33,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:33,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:33,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228633364] [2019-10-22 11:24:33,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:33,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:33,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:33,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:33,744 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand 3 states. [2019-10-22 11:24:33,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:33,792 INFO L93 Difference]: Finished difference Result 147 states and 218 transitions. [2019-10-22 11:24:33,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:33,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 11:24:33,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:33,793 INFO L225 Difference]: With dead ends: 147 [2019-10-22 11:24:33,793 INFO L226 Difference]: Without dead ends: 87 [2019-10-22 11:24:33,794 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:24:33,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-22 11:24:33,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-22 11:24:33,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-22 11:24:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2019-10-22 11:24:33,804 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 24 [2019-10-22 11:24:33,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:33,804 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2019-10-22 11:24:33,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2019-10-22 11:24:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:24:33,805 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:33,805 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:33,806 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:33,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:33,806 INFO L82 PathProgramCache]: Analyzing trace with hash -445763815, now seen corresponding path program 1 times [2019-10-22 11:24:33,806 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:33,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987969751] [2019-10-22 11:24:33,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,807 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:33,892 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:24:33,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987969751] [2019-10-22 11:24:33,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:33,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:33,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434900191] [2019-10-22 11:24:33,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:33,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:33,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:33,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:33,894 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand 5 states. [2019-10-22 11:24:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:34,053 INFO L93 Difference]: Finished difference Result 413 states and 601 transitions. [2019-10-22 11:24:34,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:24:34,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-22 11:24:34,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:34,055 INFO L225 Difference]: With dead ends: 413 [2019-10-22 11:24:34,055 INFO L226 Difference]: Without dead ends: 334 [2019-10-22 11:24:34,056 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:24:34,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-10-22 11:24:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 156. [2019-10-22 11:24:34,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-22 11:24:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 220 transitions. [2019-10-22 11:24:34,080 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 220 transitions. Word has length 25 [2019-10-22 11:24:34,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:34,080 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 220 transitions. [2019-10-22 11:24:34,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 220 transitions. [2019-10-22 11:24:34,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:24:34,081 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:34,082 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:34,082 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:34,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:34,082 INFO L82 PathProgramCache]: Analyzing trace with hash -649570909, now seen corresponding path program 1 times [2019-10-22 11:24:34,082 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:34,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686629301] [2019-10-22 11:24:34,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:34,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:34,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:34,140 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:24:34,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686629301] [2019-10-22 11:24:34,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:34,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:34,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632070697] [2019-10-22 11:24:34,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:34,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:34,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:34,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:34,142 INFO L87 Difference]: Start difference. First operand 156 states and 220 transitions. Second operand 5 states. [2019-10-22 11:24:34,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:34,298 INFO L93 Difference]: Finished difference Result 436 states and 619 transitions. [2019-10-22 11:24:34,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:24:34,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-22 11:24:34,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:34,301 INFO L225 Difference]: With dead ends: 436 [2019-10-22 11:24:34,301 INFO L226 Difference]: Without dead ends: 434 [2019-10-22 11:24:34,301 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:24:34,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-10-22 11:24:34,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 156. [2019-10-22 11:24:34,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-22 11:24:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 218 transitions. [2019-10-22 11:24:34,323 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 218 transitions. Word has length 26 [2019-10-22 11:24:34,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:34,323 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 218 transitions. [2019-10-22 11:24:34,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 218 transitions. [2019-10-22 11:24:34,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:24:34,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:34,324 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:24:34,325 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:34,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:34,325 INFO L82 PathProgramCache]: Analyzing trace with hash 108971892, now seen corresponding path program 1 times [2019-10-22 11:24:34,325 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:34,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473500738] [2019-10-22 11:24:34,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:34,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:34,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:34,405 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:24:34,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473500738] [2019-10-22 11:24:34,405 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:34,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:34,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387673634] [2019-10-22 11:24:34,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:34,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:34,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:34,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:34,408 INFO L87 Difference]: Start difference. First operand 156 states and 218 transitions. Second operand 5 states. [2019-10-22 11:24:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:34,494 INFO L93 Difference]: Finished difference Result 468 states and 648 transitions. [2019-10-22 11:24:34,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:34,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-22 11:24:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:34,497 INFO L225 Difference]: With dead ends: 468 [2019-10-22 11:24:34,497 INFO L226 Difference]: Without dead ends: 318 [2019-10-22 11:24:34,498 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:24:34,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-22 11:24:34,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 168. [2019-10-22 11:24:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-22 11:24:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 230 transitions. [2019-10-22 11:24:34,525 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 230 transitions. Word has length 31 [2019-10-22 11:24:34,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:34,527 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 230 transitions. [2019-10-22 11:24:34,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 230 transitions. [2019-10-22 11:24:34,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:24:34,528 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:34,528 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:24:34,529 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:34,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:34,529 INFO L82 PathProgramCache]: Analyzing trace with hash -284055118, now seen corresponding path program 1 times [2019-10-22 11:24:34,529 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:34,529 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527303450] [2019-10-22 11:24:34,529 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:34,529 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:34,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:34,591 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:24:34,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527303450] [2019-10-22 11:24:34,592 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:34,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:24:34,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249713208] [2019-10-22 11:24:34,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:34,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:34,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:34,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:34,593 INFO L87 Difference]: Start difference. First operand 168 states and 230 transitions. Second operand 6 states. [2019-10-22 11:24:34,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:34,706 INFO L93 Difference]: Finished difference Result 502 states and 682 transitions. [2019-10-22 11:24:34,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:34,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-10-22 11:24:34,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:34,710 INFO L225 Difference]: With dead ends: 502 [2019-10-22 11:24:34,711 INFO L226 Difference]: Without dead ends: 340 [2019-10-22 11:24:34,711 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:24:34,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-10-22 11:24:34,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 176. [2019-10-22 11:24:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-10-22 11:24:34,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 238 transitions. [2019-10-22 11:24:34,744 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 238 transitions. Word has length 31 [2019-10-22 11:24:34,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:34,745 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 238 transitions. [2019-10-22 11:24:34,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 238 transitions. [2019-10-22 11:24:34,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:24:34,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:34,750 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:24:34,750 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:34,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:34,751 INFO L82 PathProgramCache]: Analyzing trace with hash -25889680, now seen corresponding path program 1 times [2019-10-22 11:24:34,751 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:34,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171945317] [2019-10-22 11:24:34,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:34,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:34,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:34,788 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:24:34,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171945317] [2019-10-22 11:24:34,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:34,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:34,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865062758] [2019-10-22 11:24:34,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:34,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:34,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:34,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:34,790 INFO L87 Difference]: Start difference. First operand 176 states and 238 transitions. Second operand 3 states. [2019-10-22 11:24:34,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:34,850 INFO L93 Difference]: Finished difference Result 434 states and 586 transitions. [2019-10-22 11:24:34,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:34,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-22 11:24:34,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:34,852 INFO L225 Difference]: With dead ends: 434 [2019-10-22 11:24:34,852 INFO L226 Difference]: Without dead ends: 264 [2019-10-22 11:24:34,853 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:24:34,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-22 11:24:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2019-10-22 11:24:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-22 11:24:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 348 transitions. [2019-10-22 11:24:34,885 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 348 transitions. Word has length 31 [2019-10-22 11:24:34,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:34,885 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 348 transitions. [2019-10-22 11:24:34,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 348 transitions. [2019-10-22 11:24:34,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:24:34,886 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:34,887 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:24:34,887 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:34,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:34,887 INFO L82 PathProgramCache]: Analyzing trace with hash -2138649550, now seen corresponding path program 1 times [2019-10-22 11:24:34,887 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:34,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815166721] [2019-10-22 11:24:34,887 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:34,888 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:34,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:24:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:24:35,373 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:24:35,373 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:24:35,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:24:35 BoogieIcfgContainer [2019-10-22 11:24:35,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:24:35,468 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:24:35,468 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:24:35,468 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:24:35,469 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:32" (3/4) ... [2019-10-22 11:24:35,471 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:24:35,566 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2cfec52c-84b3-48c8-a64b-a0bde525e5ba/bin/utaipan/witness.graphml [2019-10-22 11:24:35,566 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:24:35,568 INFO L168 Benchmark]: Toolchain (without parser) took 4109.10 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 236.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -134.0 MB). Peak memory consumption was 102.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:35,568 INFO L168 Benchmark]: CDTParser took 0.16 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:24:35,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 538.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -206.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:35,569 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.88 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:24:35,569 INFO L168 Benchmark]: Boogie Preprocessor took 47.49 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:35,570 INFO L168 Benchmark]: RCFGBuilder took 797.48 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: 60.3 MB). Peak memory consumption was 60.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:35,570 INFO L168 Benchmark]: TraceAbstraction took 2562.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -11.7 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:35,570 INFO L168 Benchmark]: Witness Printer took 98.28 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:35,574 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.16 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 538.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -206.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.49 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 797.48 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: 60.3 MB). Peak memory consumption was 60.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2562.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -11.7 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. * Witness Printer took 98.28 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 490]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L51] int pumpRunning = 0; [L52] int systemActive = 1; [L352] int cleanupTimeShifts = 4; [L664] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L862] int waterLevel = 1; [L863] int methaneLevelCritical = 0; [L428] int retValue_acc ; [L429] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L477] int retValue_acc ; [L480] retValue_acc = 1 [L481] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L435] tmp = valid_product() [L437] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L257] int splverifierCounter ; [L258] int tmp ; [L259] int tmp___0 ; [L260] int tmp___1 ; [L261] int tmp___2 ; [L264] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L266] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L268] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L274] tmp = __VERIFIER_nondet_int() [L276] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L880] COND TRUE waterLevel < 2 [L881] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L284] tmp___0 = __VERIFIER_nondet_int() [L286] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L892] COND FALSE !(\read(methaneLevelCritical)) [L895] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L294] tmp___2 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp___2) [L248] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L59] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L66] COND TRUE \read(systemActive) [L114] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L117] COND FALSE !(\read(pumpRunning)) [L88] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L91] COND TRUE ! pumpRunning [L211] int retValue_acc ; [L212] int tmp ; [L213] int tmp___0 ; [L942] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L945] COND FALSE !(waterLevel < 2) [L949] retValue_acc = 0 [L950] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L217] tmp = isHighWaterSensorDry() [L219] COND FALSE !(\read(tmp)) [L222] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L224] retValue_acc = tmp___0 [L225] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L93] tmp = isHighWaterLevel() [L95] COND TRUE \read(tmp) [L142] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L327] int tmp ; [L328] int tmp___0 ; [L901] int retValue_acc ; [L904] retValue_acc = methaneLevelCritical [L905] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L332] tmp = isMethaneLevelCritical() [L334] COND TRUE \read(tmp) [L166] int retValue_acc ; [L169] retValue_acc = pumpRunning [L170] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L336] tmp___0 = isPumpRunning() [L338] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L490] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.5s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 829 SDtfs, 1296 SDslu, 1083 SDs, 0 SdLazy, 160 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 776 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 10236 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...