./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec2_product41.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_baf22513-f84b-44c6-8bfe-78db87d2d966/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_baf22513-f84b-44c6-8bfe-78db87d2d966/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_baf22513-f84b-44c6-8bfe-78db87d2d966/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_baf22513-f84b-44c6-8bfe-78db87d2d966/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec2_product41.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_baf22513-f84b-44c6-8bfe-78db87d2d966/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_baf22513-f84b-44c6-8bfe-78db87d2d966/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 fa3516ef35b9a868c2359cecbd34fc3153ca14ae .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:22:19,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:19,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:19,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:19,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:19,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:19,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:19,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:19,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:19,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:19,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:19,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:19,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:19,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:19,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:19,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:19,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:19,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:19,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:19,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:19,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:19,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:19,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:19,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:19,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:19,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:19,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:19,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:19,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:19,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:19,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:19,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:19,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:19,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:19,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:19,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:19,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:19,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:19,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:19,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:19,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:19,277 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_baf22513-f84b-44c6-8bfe-78db87d2d966/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:22:19,289 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:19,289 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:19,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:19,289 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:19,290 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:19,290 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:19,290 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:22:19,290 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:19,290 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:19,290 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:22:19,291 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:22:19,291 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:19,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:19,291 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:19,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:22:19,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:19,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:19,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:22:19,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:19,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:22:19,302 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:19,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:22:19,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:22:19,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:19,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:19,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:19,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:19,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:19,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:19,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:19,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:22:19,304 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:22:19,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:22:19,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:22:19,304 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:19,305 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_baf22513-f84b-44c6-8bfe-78db87d2d966/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 -> fa3516ef35b9a868c2359cecbd34fc3153ca14ae [2019-10-22 11:22:19,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:19,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:19,347 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:19,349 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:19,349 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:19,350 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_baf22513-f84b-44c6-8bfe-78db87d2d966/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec2_product41.cil.c [2019-10-22 11:22:19,395 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_baf22513-f84b-44c6-8bfe-78db87d2d966/bin/utaipan/data/ceea47ef4/8e2a6545a59f44789248b6f998d7b0e6/FLAG97863c41d [2019-10-22 11:22:19,809 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:19,809 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_baf22513-f84b-44c6-8bfe-78db87d2d966/sv-benchmarks/c/product-lines/minepump_spec2_product41.cil.c [2019-10-22 11:22:19,819 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_baf22513-f84b-44c6-8bfe-78db87d2d966/bin/utaipan/data/ceea47ef4/8e2a6545a59f44789248b6f998d7b0e6/FLAG97863c41d [2019-10-22 11:22:19,830 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_baf22513-f84b-44c6-8bfe-78db87d2d966/bin/utaipan/data/ceea47ef4/8e2a6545a59f44789248b6f998d7b0e6 [2019-10-22 11:22:19,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:19,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:19,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:19,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:19,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:19,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:19" (1/1) ... [2019-10-22 11:22:19,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c7e792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:19, skipping insertion in model container [2019-10-22 11:22:19,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:19" (1/1) ... [2019-10-22 11:22:19,850 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:19,886 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:20,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:20,198 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:20,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:20,309 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:20,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:20 WrapperNode [2019-10-22 11:22:20,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:20,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:20,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:20,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:20,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:20" (1/1) ... [2019-10-22 11:22:20,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:20" (1/1) ... [2019-10-22 11:22:20,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:20,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:20,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:20,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:20,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:20" (1/1) ... [2019-10-22 11:22:20,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:20" (1/1) ... [2019-10-22 11:22:20,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:20" (1/1) ... [2019-10-22 11:22:20,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:20" (1/1) ... [2019-10-22 11:22:20,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:20" (1/1) ... [2019-10-22 11:22:20,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:20" (1/1) ... [2019-10-22 11:22:20,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:20" (1/1) ... [2019-10-22 11:22:20,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:20,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:20,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:20,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:20,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf22513-f84b-44c6-8bfe-78db87d2d966/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:20,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:22:20,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:22:20,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:20,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:21,217 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:21,217 INFO L284 CfgBuilder]: Removed 116 assume(true) statements. [2019-10-22 11:22:21,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:21 BoogieIcfgContainer [2019-10-22 11:22:21,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:21,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:21,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:21,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:21,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:19" (1/3) ... [2019-10-22 11:22:21,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341471dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:21, skipping insertion in model container [2019-10-22 11:22:21,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:20" (2/3) ... [2019-10-22 11:22:21,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341471dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:21, skipping insertion in model container [2019-10-22 11:22:21,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:21" (3/3) ... [2019-10-22 11:22:21,225 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product41.cil.c [2019-10-22 11:22:21,235 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:21,243 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:22:21,258 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:22:21,300 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:21,308 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:22:21,308 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:21,308 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:21,316 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:21,316 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:21,316 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:21,316 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2019-10-22 11:22:21,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:22:21,349 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:21,350 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:21,352 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:21,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:21,360 INFO L82 PathProgramCache]: Analyzing trace with hash -466361678, now seen corresponding path program 1 times [2019-10-22 11:22:21,369 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:21,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900292872] [2019-10-22 11:22:21,370 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:21,370 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:21,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:21,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:21,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900292872] [2019-10-22 11:22:21,592 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:21,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:21,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667019411] [2019-10-22 11:22:21,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:22:21,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:21,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:22:21,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:22:21,623 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2019-10-22 11:22:21,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:21,649 INFO L93 Difference]: Finished difference Result 175 states and 264 transitions. [2019-10-22 11:22:21,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:22:21,650 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-10-22 11:22:21,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:21,660 INFO L225 Difference]: With dead ends: 175 [2019-10-22 11:22:21,660 INFO L226 Difference]: Without dead ends: 87 [2019-10-22 11:22:21,663 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:22:21,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-22 11:22:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-10-22 11:22:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-22 11:22:21,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2019-10-22 11:22:21,709 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 18 [2019-10-22 11:22:21,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:21,710 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2019-10-22 11:22:21,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:22:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2019-10-22 11:22:21,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:22:21,711 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:21,711 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:21,711 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:21,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:21,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1078824867, now seen corresponding path program 1 times [2019-10-22 11:22:21,711 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:21,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867197637] [2019-10-22 11:22:21,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:21,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:21,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:21,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867197637] [2019-10-22 11:22:21,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:21,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:21,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546749948] [2019-10-22 11:22:21,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:21,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:21,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:21,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:21,815 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand 3 states. [2019-10-22 11:22:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:21,824 INFO L93 Difference]: Finished difference Result 87 states and 124 transitions. [2019-10-22 11:22:21,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:21,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 11:22:21,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:21,826 INFO L225 Difference]: With dead ends: 87 [2019-10-22 11:22:21,826 INFO L226 Difference]: Without dead ends: 39 [2019-10-22 11:22:21,827 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:21,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-22 11:22:21,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-22 11:22:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 11:22:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-10-22 11:22:21,832 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 19 [2019-10-22 11:22:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:21,832 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-10-22 11:22:21,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:21,832 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-10-22 11:22:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:22:21,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:21,833 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:21,833 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:21,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:21,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1959799754, now seen corresponding path program 1 times [2019-10-22 11:22:21,834 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:21,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826271165] [2019-10-22 11:22:21,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:21,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:21,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:21,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826271165] [2019-10-22 11:22:21,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:21,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:21,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581389032] [2019-10-22 11:22:21,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:21,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:21,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:21,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:21,923 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 6 states. [2019-10-22 11:22:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:22,021 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2019-10-22 11:22:22,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:22,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-22 11:22:22,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:22,022 INFO L225 Difference]: With dead ends: 71 [2019-10-22 11:22:22,022 INFO L226 Difference]: Without dead ends: 39 [2019-10-22 11:22:22,023 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:22:22,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-22 11:22:22,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-22 11:22:22,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 11:22:22,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2019-10-22 11:22:22,027 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 24 [2019-10-22 11:22:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:22,028 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-10-22 11:22:22,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2019-10-22 11:22:22,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:22:22,032 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:22,032 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:22:22,032 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:22,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:22,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2070782503, now seen corresponding path program 1 times [2019-10-22 11:22:22,033 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:22,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641308795] [2019-10-22 11:22:22,033 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,033 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:22,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641308795] [2019-10-22 11:22:22,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:22,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:22,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010866788] [2019-10-22 11:22:22,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:22,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:22,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:22,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:22,124 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 3 states. [2019-10-22 11:22:22,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:22,146 INFO L93 Difference]: Finished difference Result 93 states and 133 transitions. [2019-10-22 11:22:22,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:22,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 11:22:22,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:22,147 INFO L225 Difference]: With dead ends: 93 [2019-10-22 11:22:22,147 INFO L226 Difference]: Without dead ends: 61 [2019-10-22 11:22:22,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:22,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-22 11:22:22,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-22 11:22:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-22 11:22:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2019-10-22 11:22:22,160 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 25 [2019-10-22 11:22:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:22,161 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2019-10-22 11:22:22,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2019-10-22 11:22:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:22:22,161 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:22,162 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:22,162 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:22,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:22,162 INFO L82 PathProgramCache]: Analyzing trace with hash -576163675, now seen corresponding path program 1 times [2019-10-22 11:22:22,162 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:22,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675070642] [2019-10-22 11:22:22,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:22,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675070642] [2019-10-22 11:22:22,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:22,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:22,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71978439] [2019-10-22 11:22:22,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:22,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:22,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:22,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:22,261 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand 5 states. [2019-10-22 11:22:22,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:22,374 INFO L93 Difference]: Finished difference Result 271 states and 394 transitions. [2019-10-22 11:22:22,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:22:22,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-22 11:22:22,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:22,376 INFO L225 Difference]: With dead ends: 271 [2019-10-22 11:22:22,376 INFO L226 Difference]: Without dead ends: 219 [2019-10-22 11:22:22,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:22:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-10-22 11:22:22,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 103. [2019-10-22 11:22:22,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-22 11:22:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 144 transitions. [2019-10-22 11:22:22,399 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 144 transitions. Word has length 31 [2019-10-22 11:22:22,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:22,400 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 144 transitions. [2019-10-22 11:22:22,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:22,400 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2019-10-22 11:22:22,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:22:22,401 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:22,401 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:22,401 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:22,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:22,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1086399261, now seen corresponding path program 1 times [2019-10-22 11:22:22,402 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:22,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520754870] [2019-10-22 11:22:22,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:22,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520754870] [2019-10-22 11:22:22,484 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:22,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:22,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789002091] [2019-10-22 11:22:22,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:22,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:22,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:22,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:22,486 INFO L87 Difference]: Start difference. First operand 103 states and 144 transitions. Second operand 5 states. [2019-10-22 11:22:22,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:22,610 INFO L93 Difference]: Finished difference Result 376 states and 533 transitions. [2019-10-22 11:22:22,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:22:22,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-22 11:22:22,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:22,613 INFO L225 Difference]: With dead ends: 376 [2019-10-22 11:22:22,614 INFO L226 Difference]: Without dead ends: 280 [2019-10-22 11:22:22,614 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:22:22,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-10-22 11:22:22,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 102. [2019-10-22 11:22:22,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-22 11:22:22,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2019-10-22 11:22:22,639 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 32 [2019-10-22 11:22:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:22,644 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2019-10-22 11:22:22,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:22,644 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2019-10-22 11:22:22,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:22:22,645 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:22,645 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:22,646 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:22,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:22,646 INFO L82 PathProgramCache]: Analyzing trace with hash 477559900, now seen corresponding path program 1 times [2019-10-22 11:22:22,646 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:22,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636322480] [2019-10-22 11:22:22,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:22,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636322480] [2019-10-22 11:22:22,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:22,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:22,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840010043] [2019-10-22 11:22:22,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:22,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:22,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:22,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:22,715 INFO L87 Difference]: Start difference. First operand 102 states and 141 transitions. Second operand 5 states. [2019-10-22 11:22:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:22,771 INFO L93 Difference]: Finished difference Result 273 states and 377 transitions. [2019-10-22 11:22:22,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:22,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-10-22 11:22:22,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:22,773 INFO L225 Difference]: With dead ends: 273 [2019-10-22 11:22:22,773 INFO L226 Difference]: Without dead ends: 178 [2019-10-22 11:22:22,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:22:22,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-22 11:22:22,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 108. [2019-10-22 11:22:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-22 11:22:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2019-10-22 11:22:22,786 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 35 [2019-10-22 11:22:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:22,786 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2019-10-22 11:22:22,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2019-10-22 11:22:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:22:22,787 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:22,787 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:22,788 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:22,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:22,788 INFO L82 PathProgramCache]: Analyzing trace with hash -533557350, now seen corresponding path program 1 times [2019-10-22 11:22:22,789 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:22,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240778349] [2019-10-22 11:22:22,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:22,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:22,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240778349] [2019-10-22 11:22:22,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:22,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:22:22,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008073513] [2019-10-22 11:22:22,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:22,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:22,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:22,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:22,839 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand 6 states. [2019-10-22 11:22:22,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:22,916 INFO L93 Difference]: Finished difference Result 291 states and 395 transitions. [2019-10-22 11:22:22,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:22:22,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-10-22 11:22:22,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:22,918 INFO L225 Difference]: With dead ends: 291 [2019-10-22 11:22:22,918 INFO L226 Difference]: Without dead ends: 190 [2019-10-22 11:22:22,919 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:22:22,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-22 11:22:22,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 112. [2019-10-22 11:22:22,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-22 11:22:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2019-10-22 11:22:22,930 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 151 transitions. Word has length 35 [2019-10-22 11:22:22,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:22,930 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 151 transitions. [2019-10-22 11:22:22,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 151 transitions. [2019-10-22 11:22:22,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:22:22,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:22,931 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:22,932 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:22,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:22,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1554625704, now seen corresponding path program 1 times [2019-10-22 11:22:22,932 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:22,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492357416] [2019-10-22 11:22:22,933 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,933 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:22,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492357416] [2019-10-22 11:22:22,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:22,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:22,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391123521] [2019-10-22 11:22:22,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:22,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:22,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:22,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:22,966 INFO L87 Difference]: Start difference. First operand 112 states and 151 transitions. Second operand 3 states. [2019-10-22 11:22:22,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:22,992 INFO L93 Difference]: Finished difference Result 265 states and 357 transitions. [2019-10-22 11:22:22,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:22,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 11:22:22,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:22,993 INFO L225 Difference]: With dead ends: 265 [2019-10-22 11:22:22,994 INFO L226 Difference]: Without dead ends: 160 [2019-10-22 11:22:22,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:22,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-22 11:22:23,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-10-22 11:22:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-22 11:22:23,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2019-10-22 11:22:23,020 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 35 [2019-10-22 11:22:23,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:23,021 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2019-10-22 11:22:23,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:23,021 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2019-10-22 11:22:23,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:22:23,022 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:23,022 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:23,022 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:23,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:23,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1879284200, now seen corresponding path program 1 times [2019-10-22 11:22:23,023 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:23,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004332067] [2019-10-22 11:22:23,023 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:23,023 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:23,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:23,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004332067] [2019-10-22 11:22:23,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:23,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:22:23,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663507112] [2019-10-22 11:22:23,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:23,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:23,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:23,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:23,098 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand 6 states. [2019-10-22 11:22:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:23,282 INFO L93 Difference]: Finished difference Result 485 states and 635 transitions. [2019-10-22 11:22:23,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:22:23,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-10-22 11:22:23,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:23,284 INFO L225 Difference]: With dead ends: 485 [2019-10-22 11:22:23,284 INFO L226 Difference]: Without dead ends: 332 [2019-10-22 11:22:23,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:22:23,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-10-22 11:22:23,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 160. [2019-10-22 11:22:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-22 11:22:23,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 205 transitions. [2019-10-22 11:22:23,306 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 205 transitions. Word has length 36 [2019-10-22 11:22:23,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:23,307 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 205 transitions. [2019-10-22 11:22:23,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:23,307 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2019-10-22 11:22:23,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 11:22:23,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:23,313 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:23,313 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:23,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:23,313 INFO L82 PathProgramCache]: Analyzing trace with hash 749013372, now seen corresponding path program 1 times [2019-10-22 11:22:23,314 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:23,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600621918] [2019-10-22 11:22:23,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:23,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:23,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:23,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600621918] [2019-10-22 11:22:23,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:23,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:23,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724614849] [2019-10-22 11:22:23,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:23,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:23,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:23,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:23,379 INFO L87 Difference]: Start difference. First operand 160 states and 205 transitions. Second operand 3 states. [2019-10-22 11:22:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:23,422 INFO L93 Difference]: Finished difference Result 233 states and 301 transitions. [2019-10-22 11:22:23,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:23,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-22 11:22:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:23,424 INFO L225 Difference]: With dead ends: 233 [2019-10-22 11:22:23,424 INFO L226 Difference]: Without dead ends: 231 [2019-10-22 11:22:23,424 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-22 11:22:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 180. [2019-10-22 11:22:23,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-22 11:22:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 235 transitions. [2019-10-22 11:22:23,441 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 235 transitions. Word has length 51 [2019-10-22 11:22:23,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:23,442 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 235 transitions. [2019-10-22 11:22:23,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:23,442 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 235 transitions. [2019-10-22 11:22:23,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-22 11:22:23,443 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:23,443 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:23,443 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:23,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:23,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1849817445, now seen corresponding path program 1 times [2019-10-22 11:22:23,443 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:23,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334386208] [2019-10-22 11:22:23,444 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:23,444 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:23,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:22:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:22:24,125 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:22:24,126 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:22:24,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:22:24 BoogieIcfgContainer [2019-10-22 11:22:24,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:22:24,288 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:22:24,288 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:22:24,288 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:22:24,289 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:21" (3/4) ... [2019-10-22 11:22:24,294 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:22:24,437 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_baf22513-f84b-44c6-8bfe-78db87d2d966/bin/utaipan/witness.graphml [2019-10-22 11:22:24,437 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:22:24,438 INFO L168 Benchmark]: Toolchain (without parser) took 4603.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.2 MB). Free memory was 944.4 MB in the beginning and 943.7 MB in the end (delta: 778.9 kB). Peak memory consumption was 199.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:24,439 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:24,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 473.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:24,439 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:24,440 INFO L168 Benchmark]: Boogie Preprocessor took 52.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:24,440 INFO L168 Benchmark]: RCFGBuilder took 798.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 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:22:24,440 INFO L168 Benchmark]: TraceAbstraction took 3068.85 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.0 GB in the beginning and 972.5 MB in the end (delta: 52.9 MB). Peak memory consumption was 139.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:24,440 INFO L168 Benchmark]: Witness Printer took 148.90 ms. Allocated memory is still 1.2 GB. Free memory was 972.5 MB in the beginning and 943.7 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:24,442 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 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 473.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 798.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.3 MB). Peak memory consumption was 60.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3068.85 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.0 GB in the beginning and 972.5 MB in the end (delta: 52.9 MB). Peak memory consumption was 139.4 MB. Max. memory is 11.5 GB. * Witness Printer took 148.90 ms. Allocated memory is still 1.2 GB. Free memory was 972.5 MB in the beginning and 943.7 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 830]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L43] int methAndRunningLastTime ; [L251] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L455] int pumpRunning = 0; [L456] int systemActive = 1; [L628] int waterLevel = 1; [L629] int methaneLevelCritical = 0; [L835] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L909] int retValue_acc ; [L910] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L817] int retValue_acc ; [L820] retValue_acc = 1 [L821] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L916] tmp = valid_product() [L918] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L48] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L724] int splverifierCounter ; [L725] int tmp ; [L726] int tmp___0 ; [L727] int tmp___1 ; [L728] int tmp___2 ; [L731] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L733] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L735] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L741] tmp = __VERIFIER_nondet_int() [L743] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L646] COND TRUE waterLevel < 2 [L647] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L751] tmp___0 = __VERIFIER_nondet_int() [L753] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L761] tmp___2 = __VERIFIER_nondet_int() [L763] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L462] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L469] COND TRUE \read(systemActive) [L491] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L494] COND TRUE ! pumpRunning [L606] int retValue_acc ; [L607] int tmp ; [L608] int tmp___0 ; [L708] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L711] COND FALSE !(waterLevel < 2) [L715] retValue_acc = 0 [L716] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L612] tmp = isHighWaterSensorDry() [L614] COND FALSE !(\read(tmp)) [L617] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L619] retValue_acc = tmp___0 [L620] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L496] tmp = isHighWaterLevel() [L498] COND TRUE \read(tmp) [L525] int tmp ; [L550] int retValue_acc ; [L667] int retValue_acc ; [L670] retValue_acc = methaneLevelCritical [L671] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L554] retValue_acc = isMethaneLevelCritical() [L556] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L529] tmp = isMethaneAlarm() [L531] COND FALSE !(\read(tmp)) [L519] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L53] int tmp ; [L54] int tmp___0 ; [L667] int retValue_acc ; [L670] retValue_acc = methaneLevelCritical [L671] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L58] tmp = isMethaneLevelCritical() [L60] COND FALSE !(\read(tmp)) [L76] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L733] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L735] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L741] tmp = __VERIFIER_nondet_int() [L743] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L751] tmp___0 = __VERIFIER_nondet_int() [L753] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L658] COND FALSE !(\read(methaneLevelCritical)) [L661] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L761] tmp___2 = __VERIFIER_nondet_int() [L763] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L462] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L634] COND TRUE waterLevel > 0 [L635] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L469] COND TRUE \read(systemActive) [L491] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L494] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L53] int tmp ; [L54] int tmp___0 ; [L667] int retValue_acc ; [L670] retValue_acc = methaneLevelCritical [L671] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L58] tmp = isMethaneLevelCritical() [L60] COND TRUE \read(tmp) [L561] int retValue_acc ; [L564] retValue_acc = pumpRunning [L565] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L62] tmp___0 = isPumpRunning() [L64] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L65] COND FALSE !(\read(methAndRunningLastTime)) [L70] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L733] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L735] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L741] tmp = __VERIFIER_nondet_int() [L743] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L751] tmp___0 = __VERIFIER_nondet_int() [L753] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L761] tmp___2 = __VERIFIER_nondet_int() [L763] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L462] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L634] COND TRUE waterLevel > 0 [L635] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L469] COND TRUE \read(systemActive) [L491] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L494] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L53] int tmp ; [L54] int tmp___0 ; [L667] int retValue_acc ; [L670] retValue_acc = methaneLevelCritical [L671] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L58] tmp = isMethaneLevelCritical() [L60] COND TRUE \read(tmp) [L561] int retValue_acc ; [L564] retValue_acc = pumpRunning [L565] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L62] tmp___0 = isPumpRunning() [L64] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L65] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L830] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 91 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.9s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 833 SDtfs, 1218 SDslu, 1300 SDs, 0 SdLazy, 182 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 667 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 330 ConstructedInterpolants, 0 QuantifiedInterpolants, 20746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...