./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 509c3c8c1895397e4c0d03f6462ad0ca0ed3ce99b40d08b775ab8473dba5ee1f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:10:25,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:10:25,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:10:25,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:10:25,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:10:25,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:10:25,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:10:25,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:10:25,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:10:25,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:10:25,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:10:25,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:10:25,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:10:25,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:10:25,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:10:25,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:10:25,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:10:25,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:10:25,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:10:25,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:10:25,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:10:25,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:10:25,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:10:25,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:10:25,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:10:25,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:10:25,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:10:25,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:10:25,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:10:25,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:10:25,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:10:25,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:10:25,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:10:25,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:10:25,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:10:25,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:10:25,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:10:25,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:10:25,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:10:25,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:10:25,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:10:25,446 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-21 00:10:25,473 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:10:25,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:10:25,473 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:10:25,473 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:10:25,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:10:25,474 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:10:25,474 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:10:25,475 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:10:25,475 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:10:25,475 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 00:10:25,475 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:10:25,475 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:10:25,476 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 00:10:25,476 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 00:10:25,476 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:10:25,476 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 00:10:25,476 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 00:10:25,476 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 00:10:25,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:10:25,477 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:10:25,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 00:10:25,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:10:25,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:10:25,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 00:10:25,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:10:25,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 00:10:25,479 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:10:25,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 00:10:25,479 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:10:25,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 00:10:25,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:10:25,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:10:25,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:10:25,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:10:25,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:10:25,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 00:10:25,480 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 00:10:25,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 00:10:25,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 00:10:25,481 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:10:25,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:10:25,481 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P 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(reach_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 -> 509c3c8c1895397e4c0d03f6462ad0ca0ed3ce99b40d08b775ab8473dba5ee1f [2021-11-21 00:10:25,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:10:25,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:10:25,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:10:25,743 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:10:25,752 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:10:25,754 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2021-11-21 00:10:25,847 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/data/b67a694c6/4c97e9ef5437477aab1f4f85d4f9770e/FLAGcd9277021 [2021-11-21 00:10:26,345 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:10:26,346 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2021-11-21 00:10:26,371 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/data/b67a694c6/4c97e9ef5437477aab1f4f85d4f9770e/FLAGcd9277021 [2021-11-21 00:10:26,662 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/data/b67a694c6/4c97e9ef5437477aab1f4f85d4f9770e [2021-11-21 00:10:26,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:10:26,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:10:26,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:10:26,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:10:26,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:10:26,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:10:26" (1/1) ... [2021-11-21 00:10:26,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca56a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:26, skipping insertion in model container [2021-11-21 00:10:26,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:10:26" (1/1) ... [2021-11-21 00:10:26,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:10:26,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:10:26,949 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-21 00:10:27,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39095,39108] [2021-11-21 00:10:27,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39180,39193] [2021-11-21 00:10:27,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39232,39245] [2021-11-21 00:10:27,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49388,49401] [2021-11-21 00:10:27,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49437,49450] [2021-11-21 00:10:27,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49565,49578] [2021-11-21 00:10:27,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49623,49636] [2021-11-21 00:10:27,315 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:10:27,326 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:10:27,339 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-21 00:10:27,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39095,39108] [2021-11-21 00:10:27,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39180,39193] [2021-11-21 00:10:27,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39232,39245] [2021-11-21 00:10:27,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49388,49401] [2021-11-21 00:10:27,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49437,49450] [2021-11-21 00:10:27,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49565,49578] [2021-11-21 00:10:27,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49623,49636] [2021-11-21 00:10:27,398 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:10:27,499 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:10:27,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:27 WrapperNode [2021-11-21 00:10:27,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:10:27,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:10:27,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:10:27,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:10:27,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:27" (1/1) ... [2021-11-21 00:10:27,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:27" (1/1) ... [2021-11-21 00:10:27,576 INFO L137 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 203 [2021-11-21 00:10:27,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:10:27,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:10:27,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:10:27,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:10:27,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:27" (1/1) ... [2021-11-21 00:10:27,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:27" (1/1) ... [2021-11-21 00:10:27,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:27" (1/1) ... [2021-11-21 00:10:27,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:27" (1/1) ... [2021-11-21 00:10:27,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:27" (1/1) ... [2021-11-21 00:10:27,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:27" (1/1) ... [2021-11-21 00:10:27,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:27" (1/1) ... [2021-11-21 00:10:27,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:10:27,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:10:27,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:10:27,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:10:27,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:27" (1/1) ... [2021-11-21 00:10:27,626 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:10:27,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:10:27,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:10:27,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:10:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2021-11-21 00:10:27,701 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2021-11-21 00:10:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2021-11-21 00:10:27,701 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2021-11-21 00:10:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 00:10:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 00:10:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-21 00:10:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-21 00:10:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-21 00:10:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:10:27,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 00:10:27,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:10:27,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:10:27,704 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-21 00:10:27,823 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:10:27,825 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:10:28,229 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:10:28,241 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:10:28,241 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-21 00:10:28,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:10:28 BoogieIcfgContainer [2021-11-21 00:10:28,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:10:28,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:10:28,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:10:28,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:10:28,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:10:26" (1/3) ... [2021-11-21 00:10:28,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42630ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:10:28, skipping insertion in model container [2021-11-21 00:10:28,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:27" (2/3) ... [2021-11-21 00:10:28,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42630ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:10:28, skipping insertion in model container [2021-11-21 00:10:28,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:10:28" (3/3) ... [2021-11-21 00:10:28,253 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2021-11-21 00:10:28,258 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-21 00:10:28,259 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:10:28,259 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-21 00:10:28,259 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-21 00:10:28,308 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,308 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,309 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,309 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,309 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,309 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,310 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,310 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,310 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,310 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,311 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,311 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,311 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,311 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,312 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,312 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,312 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,312 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,313 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,313 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,313 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,313 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,314 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,314 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,314 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,315 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,315 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,315 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,315 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,316 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,316 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,316 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,317 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,317 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,317 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,317 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,318 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,318 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,318 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,318 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,319 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,319 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,319 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,319 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,320 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,320 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,320 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,320 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,321 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,321 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,321 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,321 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,322 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,322 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,322 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,322 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,323 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,323 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,323 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,324 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,324 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,324 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,324 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,325 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,325 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,325 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,325 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,326 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,326 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,326 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,326 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,326 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,327 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,327 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,327 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,327 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,328 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,328 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,328 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,328 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,329 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,329 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,329 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,349 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,349 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,349 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,349 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,370 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,370 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,371 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,371 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,371 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,371 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,371 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,372 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,372 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,372 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,372 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,373 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,374 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,375 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,375 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,375 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,375 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,375 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,376 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,376 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,376 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,376 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,376 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,376 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,377 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,377 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,377 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,377 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,377 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,378 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,378 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,378 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,378 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,378 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,379 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,379 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,379 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,379 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,379 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,379 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,380 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,380 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,380 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,380 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,380 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,382 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,382 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,382 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,382 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,382 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,383 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,383 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,383 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,383 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,383 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,384 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,385 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,385 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,385 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,386 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,386 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,386 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,386 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,387 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,387 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,387 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,387 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,390 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,390 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,390 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,391 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,391 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,391 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,391 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,403 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,404 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,404 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,404 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,405 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,405 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,405 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,405 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,406 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,406 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,406 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,406 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,407 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,407 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,407 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,407 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,408 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,408 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,408 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,408 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,409 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,409 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,409 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,410 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,410 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,410 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,410 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,411 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,411 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,411 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,411 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,412 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,412 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,412 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,412 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,414 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,414 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,414 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,414 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,416 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,416 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,416 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,416 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,419 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,419 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,419 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,419 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,419 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,419 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,420 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,420 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,420 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,420 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,420 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,421 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,421 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,421 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,422 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,422 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,422 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,422 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,423 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,423 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,423 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,423 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,423 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,424 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,424 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,424 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,424 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,424 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,425 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,425 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,425 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,425 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,426 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,427 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,427 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,427 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,427 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,428 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,428 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,428 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,428 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,429 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,429 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,429 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,429 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,429 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,429 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,430 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,430 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,430 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,430 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,430 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,430 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,431 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,431 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,431 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,431 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,431 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,431 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,432 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,432 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,432 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,432 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,432 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,432 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,433 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,433 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,433 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,433 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,433 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,433 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,434 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,434 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,434 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,434 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,434 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,434 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,435 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,436 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,437 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,437 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,437 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,437 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,437 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,437 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,438 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,438 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,438 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,439 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,439 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,439 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,439 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,439 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,439 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,440 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,440 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,440 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,440 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,440 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,441 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,441 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,441 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,441 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,441 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,442 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,442 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,442 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,442 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,442 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,445 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,445 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,445 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,445 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,445 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,445 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,446 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,446 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,446 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,446 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,447 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,447 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,447 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,447 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,447 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,447 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,448 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,448 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,451 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,451 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,451 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,451 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,452 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,452 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,452 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,452 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,452 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,453 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,453 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,453 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,453 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,453 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,453 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,454 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,454 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,454 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,454 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,458 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,458 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,458 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,458 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,459 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,459 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,459 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,459 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,459 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,459 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,460 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,460 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,460 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,460 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,460 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,460 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,461 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,461 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,461 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,461 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,461 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,462 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,462 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,462 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,462 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,462 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,462 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,463 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,463 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,463 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,463 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,463 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,463 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,464 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,464 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:10:28,467 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-11-21 00:10:28,512 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:10:28,518 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 00:10:28,519 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-11-21 00:10:28,536 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-21 00:10:28,550 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 233 transitions, 482 flow [2021-11-21 00:10:28,553 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 233 transitions, 482 flow [2021-11-21 00:10:28,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 223 places, 233 transitions, 482 flow [2021-11-21 00:10:28,681 INFO L129 PetriNetUnfolder]: 17/231 cut-off events. [2021-11-21 00:10:28,684 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-11-21 00:10:28,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 231 events. 17/231 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 458 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2021-11-21 00:10:28,711 INFO L116 LiptonReduction]: Number of co-enabled transitions 19012 [2021-11-21 00:10:35,670 INFO L131 LiptonReduction]: Checked pairs total: 41222 [2021-11-21 00:10:35,670 INFO L133 LiptonReduction]: Total number of compositions: 214 [2021-11-21 00:10:35,679 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 64 transitions, 144 flow [2021-11-21 00:10:35,806 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2452 states, 2447 states have (on average 3.5435226808336737) internal successors, (8671), 2451 states have internal predecessors, (8671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:35,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 2452 states, 2447 states have (on average 3.5435226808336737) internal successors, (8671), 2451 states have internal predecessors, (8671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:35,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 00:10:35,832 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:10:35,833 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:10:35,833 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:10:35,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:10:35,839 INFO L85 PathProgramCache]: Analyzing trace with hash 773188809, now seen corresponding path program 1 times [2021-11-21 00:10:35,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:10:35,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046014601] [2021-11-21 00:10:35,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:10:35,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:10:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:10:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:10:36,036 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:10:36,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046014601] [2021-11-21 00:10:36,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046014601] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:10:36,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:10:36,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 00:10:36,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202417832] [2021-11-21 00:10:36,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:10:36,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-21 00:10:36,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:10:36,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-21 00:10:36,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 00:10:36,076 INFO L87 Difference]: Start difference. First operand has 2452 states, 2447 states have (on average 3.5435226808336737) internal successors, (8671), 2451 states have internal predecessors, (8671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:36,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:10:36,196 INFO L93 Difference]: Finished difference Result 2452 states and 7985 transitions. [2021-11-21 00:10:36,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-21 00:10:36,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-21 00:10:36,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:10:36,238 INFO L225 Difference]: With dead ends: 2452 [2021-11-21 00:10:36,238 INFO L226 Difference]: Without dead ends: 2450 [2021-11-21 00:10:36,239 INFO L932 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 [2021-11-21 00:10:36,243 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:10:36,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:10:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2021-11-21 00:10:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450. [2021-11-21 00:10:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2446 states have (on average 3.2632869991823386) internal successors, (7982), 2449 states have internal predecessors, (7982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 7982 transitions. [2021-11-21 00:10:36,439 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 7982 transitions. Word has length 13 [2021-11-21 00:10:36,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:10:36,439 INFO L470 AbstractCegarLoop]: Abstraction has 2450 states and 7982 transitions. [2021-11-21 00:10:36,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:36,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 7982 transitions. [2021-11-21 00:10:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-21 00:10:36,446 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:10:36,446 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:10:36,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 00:10:36,447 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:10:36,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:10:36,448 INFO L85 PathProgramCache]: Analyzing trace with hash -780183603, now seen corresponding path program 1 times [2021-11-21 00:10:36,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:10:36,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984320285] [2021-11-21 00:10:36,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:10:36,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:10:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:10:36,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:10:36,759 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:10:36,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984320285] [2021-11-21 00:10:36,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984320285] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:10:36,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:10:36,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-21 00:10:36,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746337237] [2021-11-21 00:10:36,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:10:36,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-21 00:10:36,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:10:36,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-21 00:10:36,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-21 00:10:36,763 INFO L87 Difference]: Start difference. First operand 2450 states and 7982 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:37,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:10:37,247 INFO L93 Difference]: Finished difference Result 2641 states and 8501 transitions. [2021-11-21 00:10:37,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-21 00:10:37,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-21 00:10:37,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:10:37,282 INFO L225 Difference]: With dead ends: 2641 [2021-11-21 00:10:37,282 INFO L226 Difference]: Without dead ends: 2539 [2021-11-21 00:10:37,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-21 00:10:37,285 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 49 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:10:37,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 20 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-21 00:10:37,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2021-11-21 00:10:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2437. [2021-11-21 00:10:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2437 states, 2433 states have (on average 3.2692149609535552) internal successors, (7954), 2436 states have internal predecessors, (7954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:37,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 7954 transitions. [2021-11-21 00:10:37,453 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 7954 transitions. Word has length 17 [2021-11-21 00:10:37,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:10:37,454 INFO L470 AbstractCegarLoop]: Abstraction has 2437 states and 7954 transitions. [2021-11-21 00:10:37,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:37,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 7954 transitions. [2021-11-21 00:10:37,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-21 00:10:37,458 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:10:37,458 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:10:37,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 00:10:37,461 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:10:37,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:10:37,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1334173546, now seen corresponding path program 1 times [2021-11-21 00:10:37,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:10:37,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880826589] [2021-11-21 00:10:37,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:10:37,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:10:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:10:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:10:37,693 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:10:37,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880826589] [2021-11-21 00:10:37,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880826589] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:10:37,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:10:37,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-21 00:10:37,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264390915] [2021-11-21 00:10:37,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:10:37,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-21 00:10:37,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:10:37,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-21 00:10:37,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-21 00:10:37,697 INFO L87 Difference]: Start difference. First operand 2437 states and 7954 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:38,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:10:38,445 INFO L93 Difference]: Finished difference Result 3522 states and 11540 transitions. [2021-11-21 00:10:38,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-21 00:10:38,446 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-21 00:10:38,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:10:38,478 INFO L225 Difference]: With dead ends: 3522 [2021-11-21 00:10:38,478 INFO L226 Difference]: Without dead ends: 3361 [2021-11-21 00:10:38,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-11-21 00:10:38,482 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 147 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-21 00:10:38,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 13 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-21 00:10:38,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states. [2021-11-21 00:10:38,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 3010. [2021-11-21 00:10:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3010 states, 3006 states have (on average 3.2887558216899535) internal successors, (9886), 3009 states have internal predecessors, (9886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:38,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 9886 transitions. [2021-11-21 00:10:38,682 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 9886 transitions. Word has length 18 [2021-11-21 00:10:38,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:10:38,683 INFO L470 AbstractCegarLoop]: Abstraction has 3010 states and 9886 transitions. [2021-11-21 00:10:38,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:38,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 9886 transitions. [2021-11-21 00:10:38,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-21 00:10:38,687 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:10:38,687 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:10:38,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-21 00:10:38,688 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:10:38,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:10:38,688 INFO L85 PathProgramCache]: Analyzing trace with hash 281159732, now seen corresponding path program 2 times [2021-11-21 00:10:38,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:10:38,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380013687] [2021-11-21 00:10:38,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:10:38,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:10:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:10:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:10:38,919 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:10:38,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380013687] [2021-11-21 00:10:38,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380013687] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:10:38,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:10:38,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-21 00:10:38,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131022786] [2021-11-21 00:10:38,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:10:38,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-21 00:10:38,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:10:38,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-21 00:10:38,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-21 00:10:38,922 INFO L87 Difference]: Start difference. First operand 3010 states and 9886 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:39,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:10:39,562 INFO L93 Difference]: Finished difference Result 3276 states and 10612 transitions. [2021-11-21 00:10:39,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-21 00:10:39,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-21 00:10:39,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:10:39,592 INFO L225 Difference]: With dead ends: 3276 [2021-11-21 00:10:39,592 INFO L226 Difference]: Without dead ends: 3126 [2021-11-21 00:10:39,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-21 00:10:39,595 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 139 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:10:39,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 14 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-21 00:10:39,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2021-11-21 00:10:39,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 2928. [2021-11-21 00:10:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2924 states have (on average 3.2797537619699044) internal successors, (9590), 2927 states have internal predecessors, (9590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:39,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 9590 transitions. [2021-11-21 00:10:39,729 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 9590 transitions. Word has length 18 [2021-11-21 00:10:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:10:39,730 INFO L470 AbstractCegarLoop]: Abstraction has 2928 states and 9590 transitions. [2021-11-21 00:10:39,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:39,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 9590 transitions. [2021-11-21 00:10:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:10:39,736 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:10:39,736 INFO L514 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] [2021-11-21 00:10:39,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-21 00:10:39,737 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:10:39,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:10:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1307091812, now seen corresponding path program 1 times [2021-11-21 00:10:39,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:10:39,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552344872] [2021-11-21 00:10:39,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:10:39,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:10:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:10:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:10:40,346 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:10:40,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552344872] [2021-11-21 00:10:40,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552344872] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:10:40,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:10:40,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-21 00:10:40,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026368715] [2021-11-21 00:10:40,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:10:40,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 00:10:40,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:10:40,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 00:10:40,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-11-21 00:10:40,347 INFO L87 Difference]: Start difference. First operand 2928 states and 9590 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:41,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:10:41,814 INFO L93 Difference]: Finished difference Result 3243 states and 10507 transitions. [2021-11-21 00:10:41,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-21 00:10:41,815 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:10:41,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:10:41,864 INFO L225 Difference]: With dead ends: 3243 [2021-11-21 00:10:41,866 INFO L226 Difference]: Without dead ends: 3139 [2021-11-21 00:10:41,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2021-11-21 00:10:41,868 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 278 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-21 00:10:41,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 16 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-21 00:10:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2021-11-21 00:10:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2984. [2021-11-21 00:10:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2984 states, 2980 states have (on average 3.279194630872483) internal successors, (9772), 2983 states have internal predecessors, (9772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 9772 transitions. [2021-11-21 00:10:42,006 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 9772 transitions. Word has length 25 [2021-11-21 00:10:42,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:10:42,007 INFO L470 AbstractCegarLoop]: Abstraction has 2984 states and 9772 transitions. [2021-11-21 00:10:42,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 9772 transitions. [2021-11-21 00:10:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:10:42,018 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:10:42,018 INFO L514 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] [2021-11-21 00:10:42,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-21 00:10:42,018 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:10:42,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:10:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1416519606, now seen corresponding path program 1 times [2021-11-21 00:10:42,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:10:42,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696356506] [2021-11-21 00:10:42,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:10:42,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:10:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:10:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:10:42,453 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:10:42,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696356506] [2021-11-21 00:10:42,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696356506] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:10:42,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:10:42,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-21 00:10:42,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679584219] [2021-11-21 00:10:42,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:10:42,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-21 00:10:42,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:10:42,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-21 00:10:42,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-21 00:10:42,456 INFO L87 Difference]: Start difference. First operand 2984 states and 9772 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:43,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:10:43,641 INFO L93 Difference]: Finished difference Result 3292 states and 10661 transitions. [2021-11-21 00:10:43,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-21 00:10:43,642 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:10:43,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:10:43,655 INFO L225 Difference]: With dead ends: 3292 [2021-11-21 00:10:43,655 INFO L226 Difference]: Without dead ends: 3188 [2021-11-21 00:10:43,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2021-11-21 00:10:43,656 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 214 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-21 00:10:43,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 16 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-21 00:10:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2021-11-21 00:10:43,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3033. [2021-11-21 00:10:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3033 states, 3029 states have (on average 3.2769891053152858) internal successors, (9926), 3032 states have internal predecessors, (9926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 9926 transitions. [2021-11-21 00:10:43,769 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 9926 transitions. Word has length 25 [2021-11-21 00:10:43,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:10:43,769 INFO L470 AbstractCegarLoop]: Abstraction has 3033 states and 9926 transitions. [2021-11-21 00:10:43,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:43,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 9926 transitions. [2021-11-21 00:10:43,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:10:43,776 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:10:43,776 INFO L514 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] [2021-11-21 00:10:43,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-21 00:10:43,776 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:10:43,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:10:43,777 INFO L85 PathProgramCache]: Analyzing trace with hash -325293552, now seen corresponding path program 2 times [2021-11-21 00:10:43,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:10:43,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724130255] [2021-11-21 00:10:43,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:10:43,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:10:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:10:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:10:44,274 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:10:44,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724130255] [2021-11-21 00:10:44,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724130255] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:10:44,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:10:44,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-21 00:10:44,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018659985] [2021-11-21 00:10:44,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:10:44,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 00:10:44,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:10:44,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 00:10:44,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-21 00:10:44,276 INFO L87 Difference]: Start difference. First operand 3033 states and 9926 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:10:46,353 INFO L93 Difference]: Finished difference Result 4031 states and 13080 transitions. [2021-11-21 00:10:46,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-21 00:10:46,354 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:10:46,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:10:46,374 INFO L225 Difference]: With dead ends: 4031 [2021-11-21 00:10:46,374 INFO L226 Difference]: Without dead ends: 3927 [2021-11-21 00:10:46,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=221, Invalid=649, Unknown=0, NotChecked=0, Total=870 [2021-11-21 00:10:46,376 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 298 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:10:46,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 32 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1709 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-21 00:10:46,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3927 states. [2021-11-21 00:10:46,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3927 to 3208. [2021-11-21 00:10:46,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 3204 states have (on average 3.2936953807740323) internal successors, (10553), 3207 states have internal predecessors, (10553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 10553 transitions. [2021-11-21 00:10:46,530 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 10553 transitions. Word has length 25 [2021-11-21 00:10:46,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:10:46,532 INFO L470 AbstractCegarLoop]: Abstraction has 3208 states and 10553 transitions. [2021-11-21 00:10:46,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:46,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 10553 transitions. [2021-11-21 00:10:46,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:10:46,539 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:10:46,539 INFO L514 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] [2021-11-21 00:10:46,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-21 00:10:46,539 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:10:46,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:10:46,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2025687736, now seen corresponding path program 3 times [2021-11-21 00:10:46,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:10:46,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901197895] [2021-11-21 00:10:46,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:10:46,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:10:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:10:47,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:10:47,057 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:10:47,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901197895] [2021-11-21 00:10:47,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901197895] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:10:47,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:10:47,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-21 00:10:47,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278627930] [2021-11-21 00:10:47,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:10:47,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 00:10:47,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:10:47,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 00:10:47,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-21 00:10:47,058 INFO L87 Difference]: Start difference. First operand 3208 states and 10553 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:48,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:10:48,977 INFO L93 Difference]: Finished difference Result 4009 states and 13022 transitions. [2021-11-21 00:10:48,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-21 00:10:48,978 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:10:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:10:48,993 INFO L225 Difference]: With dead ends: 4009 [2021-11-21 00:10:48,993 INFO L226 Difference]: Without dead ends: 3905 [2021-11-21 00:10:48,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=243, Invalid=687, Unknown=0, NotChecked=0, Total=930 [2021-11-21 00:10:48,996 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 305 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:10:48,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 36 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-21 00:10:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2021-11-21 00:10:49,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 3445. [2021-11-21 00:10:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3445 states, 3441 states have (on average 3.308921825050857) internal successors, (11386), 3444 states have internal predecessors, (11386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:49,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 11386 transitions. [2021-11-21 00:10:49,119 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 11386 transitions. Word has length 25 [2021-11-21 00:10:49,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:10:49,120 INFO L470 AbstractCegarLoop]: Abstraction has 3445 states and 11386 transitions. [2021-11-21 00:10:49,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:49,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 11386 transitions. [2021-11-21 00:10:49,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:10:49,128 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:10:49,128 INFO L514 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] [2021-11-21 00:10:49,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-21 00:10:49,129 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:10:49,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:10:49,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2045096728, now seen corresponding path program 4 times [2021-11-21 00:10:49,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:10:49,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480525922] [2021-11-21 00:10:49,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:10:49,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:10:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:10:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:10:49,562 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:10:49,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480525922] [2021-11-21 00:10:49,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480525922] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:10:49,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:10:49,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-21 00:10:49,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252183117] [2021-11-21 00:10:49,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:10:49,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-21 00:10:49,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:10:49,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-21 00:10:49,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-11-21 00:10:49,563 INFO L87 Difference]: Start difference. First operand 3445 states and 11386 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:52,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:10:52,015 INFO L93 Difference]: Finished difference Result 4040 states and 13032 transitions. [2021-11-21 00:10:52,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-21 00:10:52,016 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:10:52,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:10:52,035 INFO L225 Difference]: With dead ends: 4040 [2021-11-21 00:10:52,035 INFO L226 Difference]: Without dead ends: 3936 [2021-11-21 00:10:52,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=322, Invalid=734, Unknown=0, NotChecked=0, Total=1056 [2021-11-21 00:10:52,037 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 296 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:10:52,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 44 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-21 00:10:52,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3936 states. [2021-11-21 00:10:52,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3936 to 3567. [2021-11-21 00:10:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3567 states, 3563 states have (on average 3.2756104406399102) internal successors, (11671), 3566 states have internal predecessors, (11671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:52,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 11671 transitions. [2021-11-21 00:10:52,223 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 11671 transitions. Word has length 25 [2021-11-21 00:10:52,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:10:52,223 INFO L470 AbstractCegarLoop]: Abstraction has 3567 states and 11671 transitions. [2021-11-21 00:10:52,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:52,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 11671 transitions. [2021-11-21 00:10:52,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:10:52,232 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:10:52,232 INFO L514 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] [2021-11-21 00:10:52,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-21 00:10:52,233 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:10:52,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:10:52,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2028950726, now seen corresponding path program 2 times [2021-11-21 00:10:52,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:10:52,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457063234] [2021-11-21 00:10:52,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:10:52,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:10:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:10:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:10:52,623 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:10:52,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457063234] [2021-11-21 00:10:52,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457063234] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:10:52,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:10:52,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-21 00:10:52,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737032761] [2021-11-21 00:10:52,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:10:52,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-21 00:10:52,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:10:52,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-21 00:10:52,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-21 00:10:52,626 INFO L87 Difference]: Start difference. First operand 3567 states and 11671 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:10:54,358 INFO L93 Difference]: Finished difference Result 4455 states and 14323 transitions. [2021-11-21 00:10:54,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-21 00:10:54,369 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:10:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:10:54,388 INFO L225 Difference]: With dead ends: 4455 [2021-11-21 00:10:54,388 INFO L226 Difference]: Without dead ends: 4351 [2021-11-21 00:10:54,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=641, Unknown=0, NotChecked=0, Total=870 [2021-11-21 00:10:54,390 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 261 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-21 00:10:54,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 26 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-21 00:10:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4351 states. [2021-11-21 00:10:54,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4351 to 3847. [2021-11-21 00:10:54,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3847 states, 3843 states have (on average 3.265938069216758) internal successors, (12551), 3846 states have internal predecessors, (12551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 12551 transitions. [2021-11-21 00:10:54,546 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 12551 transitions. Word has length 25 [2021-11-21 00:10:54,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:10:54,548 INFO L470 AbstractCegarLoop]: Abstraction has 3847 states and 12551 transitions. [2021-11-21 00:10:54,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:54,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 12551 transitions. [2021-11-21 00:10:54,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:10:54,557 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:10:54,557 INFO L514 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] [2021-11-21 00:10:54,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-21 00:10:54,557 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:10:54,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:10:54,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1347164886, now seen corresponding path program 3 times [2021-11-21 00:10:54,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:10:54,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303046085] [2021-11-21 00:10:54,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:10:54,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:10:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:10:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:10:54,925 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:10:54,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303046085] [2021-11-21 00:10:54,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303046085] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:10:54,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:10:54,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-21 00:10:54,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419046492] [2021-11-21 00:10:54,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:10:54,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-21 00:10:54,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:10:54,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-21 00:10:54,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-21 00:10:54,927 INFO L87 Difference]: Start difference. First operand 3847 states and 12551 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:56,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:10:56,740 INFO L93 Difference]: Finished difference Result 4481 states and 14412 transitions. [2021-11-21 00:10:56,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-21 00:10:56,741 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:10:56,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:10:56,752 INFO L225 Difference]: With dead ends: 4481 [2021-11-21 00:10:56,753 INFO L226 Difference]: Without dead ends: 4377 [2021-11-21 00:10:56,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2021-11-21 00:10:56,754 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 214 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:10:56,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 35 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-21 00:10:56,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4377 states. [2021-11-21 00:10:56,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4377 to 3978. [2021-11-21 00:10:56,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3974 states have (on average 3.2586814292903874) internal successors, (12950), 3977 states have internal predecessors, (12950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 12950 transitions. [2021-11-21 00:10:56,874 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 12950 transitions. Word has length 25 [2021-11-21 00:10:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:10:56,874 INFO L470 AbstractCegarLoop]: Abstraction has 3978 states and 12950 transitions. [2021-11-21 00:10:56,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 12950 transitions. [2021-11-21 00:10:56,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:10:56,883 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:10:56,883 INFO L514 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] [2021-11-21 00:10:56,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-21 00:10:56,884 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:10:56,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:10:56,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1272367008, now seen corresponding path program 5 times [2021-11-21 00:10:56,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:10:56,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599435735] [2021-11-21 00:10:56,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:10:56,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:10:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:10:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:10:57,252 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:10:57,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599435735] [2021-11-21 00:10:57,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599435735] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:10:57,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:10:57,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-21 00:10:57,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822688044] [2021-11-21 00:10:57,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:10:57,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 00:10:57,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:10:57,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 00:10:57,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-21 00:10:57,254 INFO L87 Difference]: Start difference. First operand 3978 states and 12950 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:58,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:10:58,866 INFO L93 Difference]: Finished difference Result 5316 states and 17168 transitions. [2021-11-21 00:10:58,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-21 00:10:58,866 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:10:58,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:10:58,884 INFO L225 Difference]: With dead ends: 5316 [2021-11-21 00:10:58,884 INFO L226 Difference]: Without dead ends: 5212 [2021-11-21 00:10:58,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2021-11-21 00:10:58,886 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 209 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-21 00:10:58,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 33 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-21 00:10:58,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5212 states. [2021-11-21 00:10:59,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5212 to 4172. [2021-11-21 00:10:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4172 states, 4168 states have (on average 3.283349328214971) internal successors, (13685), 4171 states have internal predecessors, (13685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4172 states to 4172 states and 13685 transitions. [2021-11-21 00:10:59,028 INFO L78 Accepts]: Start accepts. Automaton has 4172 states and 13685 transitions. Word has length 25 [2021-11-21 00:10:59,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:10:59,029 INFO L470 AbstractCegarLoop]: Abstraction has 4172 states and 13685 transitions. [2021-11-21 00:10:59,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand 4172 states and 13685 transitions. [2021-11-21 00:10:59,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:10:59,039 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:10:59,039 INFO L514 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] [2021-11-21 00:10:59,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-21 00:10:59,039 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:10:59,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:10:59,040 INFO L85 PathProgramCache]: Analyzing trace with hash -671619000, now seen corresponding path program 6 times [2021-11-21 00:10:59,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:10:59,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450996771] [2021-11-21 00:10:59,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:10:59,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:10:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:10:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:10:59,456 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:10:59,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450996771] [2021-11-21 00:10:59,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450996771] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:10:59,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:10:59,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-21 00:10:59,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036410175] [2021-11-21 00:10:59,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:10:59,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 00:10:59,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:10:59,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 00:10:59,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-11-21 00:10:59,458 INFO L87 Difference]: Start difference. First operand 4172 states and 13685 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:01,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:01,105 INFO L93 Difference]: Finished difference Result 5343 states and 17265 transitions. [2021-11-21 00:11:01,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-21 00:11:01,105 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:11:01,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:01,116 INFO L225 Difference]: With dead ends: 5343 [2021-11-21 00:11:01,116 INFO L226 Difference]: Without dead ends: 5239 [2021-11-21 00:11:01,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=238, Invalid=692, Unknown=0, NotChecked=0, Total=930 [2021-11-21 00:11:01,117 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 243 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:01,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 35 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1620 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-21 00:11:01,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5239 states. [2021-11-21 00:11:01,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5239 to 4544. [2021-11-21 00:11:01,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4544 states, 4540 states have (on average 3.302863436123348) internal successors, (14995), 4543 states have internal predecessors, (14995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 14995 transitions. [2021-11-21 00:11:01,253 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 14995 transitions. Word has length 25 [2021-11-21 00:11:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:01,253 INFO L470 AbstractCegarLoop]: Abstraction has 4544 states and 14995 transitions. [2021-11-21 00:11:01,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 14995 transitions. [2021-11-21 00:11:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:11:01,263 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:01,263 INFO L514 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] [2021-11-21 00:11:01,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-21 00:11:01,264 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:01,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:01,264 INFO L85 PathProgramCache]: Analyzing trace with hash -652210008, now seen corresponding path program 7 times [2021-11-21 00:11:01,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:01,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592002021] [2021-11-21 00:11:01,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:01,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:01,612 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:01,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592002021] [2021-11-21 00:11:01,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592002021] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:01,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:01,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-21 00:11:01,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895697473] [2021-11-21 00:11:01,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:01,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-21 00:11:01,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:01,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-21 00:11:01,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-21 00:11:01,613 INFO L87 Difference]: Start difference. First operand 4544 states and 14995 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:04,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:04,335 INFO L93 Difference]: Finished difference Result 5962 states and 18977 transitions. [2021-11-21 00:11:04,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-21 00:11:04,335 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:11:04,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:04,351 INFO L225 Difference]: With dead ends: 5962 [2021-11-21 00:11:04,351 INFO L226 Difference]: Without dead ends: 5858 [2021-11-21 00:11:04,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=429, Invalid=1053, Unknown=0, NotChecked=0, Total=1482 [2021-11-21 00:11:04,352 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 312 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 2378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:04,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 61 Invalid, 2378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-21 00:11:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5858 states. [2021-11-21 00:11:04,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5858 to 4158. [2021-11-21 00:11:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4158 states, 4154 states have (on average 3.283582089552239) internal successors, (13640), 4157 states have internal predecessors, (13640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:04,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4158 states to 4158 states and 13640 transitions. [2021-11-21 00:11:04,488 INFO L78 Accepts]: Start accepts. Automaton has 4158 states and 13640 transitions. Word has length 25 [2021-11-21 00:11:04,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:04,488 INFO L470 AbstractCegarLoop]: Abstraction has 4158 states and 13640 transitions. [2021-11-21 00:11:04,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 4158 states and 13640 transitions. [2021-11-21 00:11:04,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:11:04,496 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:04,496 INFO L514 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] [2021-11-21 00:11:04,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-21 00:11:04,497 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:04,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:04,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1485885564, now seen corresponding path program 8 times [2021-11-21 00:11:04,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:04,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79381129] [2021-11-21 00:11:04,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:04,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:04,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:04,873 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:04,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79381129] [2021-11-21 00:11:04,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79381129] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:04,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:04,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-21 00:11:04,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527310716] [2021-11-21 00:11:04,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:04,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 00:11:04,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:04,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 00:11:04,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-21 00:11:04,875 INFO L87 Difference]: Start difference. First operand 4158 states and 13640 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:06,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:06,280 INFO L93 Difference]: Finished difference Result 4717 states and 15216 transitions. [2021-11-21 00:11:06,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-21 00:11:06,282 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:11:06,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:06,294 INFO L225 Difference]: With dead ends: 4717 [2021-11-21 00:11:06,294 INFO L226 Difference]: Without dead ends: 4613 [2021-11-21 00:11:06,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2021-11-21 00:11:06,295 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 253 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:06,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 40 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-21 00:11:06,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4613 states. [2021-11-21 00:11:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4613 to 4220. [2021-11-21 00:11:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4220 states, 4216 states have (on average 3.281783681214421) internal successors, (13836), 4219 states have internal predecessors, (13836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:06,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4220 states to 4220 states and 13836 transitions. [2021-11-21 00:11:06,419 INFO L78 Accepts]: Start accepts. Automaton has 4220 states and 13836 transitions. Word has length 25 [2021-11-21 00:11:06,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:06,420 INFO L470 AbstractCegarLoop]: Abstraction has 4220 states and 13836 transitions. [2021-11-21 00:11:06,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:06,420 INFO L276 IsEmpty]: Start isEmpty. Operand 4220 states and 13836 transitions. [2021-11-21 00:11:06,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:11:06,428 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:06,428 INFO L514 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] [2021-11-21 00:11:06,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-21 00:11:06,429 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:06,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:06,429 INFO L85 PathProgramCache]: Analyzing trace with hash 865095724, now seen corresponding path program 9 times [2021-11-21 00:11:06,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:06,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373993756] [2021-11-21 00:11:06,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:06,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:06,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:06,878 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:06,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373993756] [2021-11-21 00:11:06,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373993756] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:06,878 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:06,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-21 00:11:06,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847440516] [2021-11-21 00:11:06,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:06,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 00:11:06,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:06,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 00:11:06,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-11-21 00:11:06,880 INFO L87 Difference]: Start difference. First operand 4220 states and 13836 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:08,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:08,630 INFO L93 Difference]: Finished difference Result 5283 states and 17140 transitions. [2021-11-21 00:11:08,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-21 00:11:08,632 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:11:08,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:08,646 INFO L225 Difference]: With dead ends: 5283 [2021-11-21 00:11:08,646 INFO L226 Difference]: Without dead ends: 5179 [2021-11-21 00:11:08,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=223, Invalid=647, Unknown=0, NotChecked=0, Total=870 [2021-11-21 00:11:08,653 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 254 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 2059 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:08,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 50 Invalid, 2074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2059 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-21 00:11:08,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5179 states. [2021-11-21 00:11:08,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5179 to 4556. [2021-11-21 00:11:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4556 states, 4552 states have (on average 3.2996485061511422) internal successors, (15020), 4555 states have internal predecessors, (15020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4556 states to 4556 states and 15020 transitions. [2021-11-21 00:11:08,776 INFO L78 Accepts]: Start accepts. Automaton has 4556 states and 15020 transitions. Word has length 25 [2021-11-21 00:11:08,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:08,776 INFO L470 AbstractCegarLoop]: Abstraction has 4556 states and 15020 transitions. [2021-11-21 00:11:08,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4556 states and 15020 transitions. [2021-11-21 00:11:08,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:11:08,786 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:08,786 INFO L514 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] [2021-11-21 00:11:08,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-21 00:11:08,787 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:08,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:08,787 INFO L85 PathProgramCache]: Analyzing trace with hash 884504716, now seen corresponding path program 10 times [2021-11-21 00:11:08,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:08,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896803803] [2021-11-21 00:11:08,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:08,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:09,155 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:09,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896803803] [2021-11-21 00:11:09,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896803803] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:09,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:09,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-21 00:11:09,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004319427] [2021-11-21 00:11:09,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:09,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-21 00:11:09,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:09,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-21 00:11:09,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-21 00:11:09,156 INFO L87 Difference]: Start difference. First operand 4556 states and 15020 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:12,178 INFO L93 Difference]: Finished difference Result 5914 states and 18902 transitions. [2021-11-21 00:11:12,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-21 00:11:12,179 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:11:12,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:12,189 INFO L225 Difference]: With dead ends: 5914 [2021-11-21 00:11:12,189 INFO L226 Difference]: Without dead ends: 5810 [2021-11-21 00:11:12,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=470, Invalid=1170, Unknown=0, NotChecked=0, Total=1640 [2021-11-21 00:11:12,190 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 275 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 2716 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 2741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:12,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 71 Invalid, 2741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2716 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-21 00:11:12,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5810 states. [2021-11-21 00:11:12,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5810 to 4038. [2021-11-21 00:11:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4038 states, 4034 states have (on average 3.2597917699553793) internal successors, (13150), 4037 states have internal predecessors, (13150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:12,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4038 states to 4038 states and 13150 transitions. [2021-11-21 00:11:12,310 INFO L78 Accepts]: Start accepts. Automaton has 4038 states and 13150 transitions. Word has length 25 [2021-11-21 00:11:12,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:12,311 INFO L470 AbstractCegarLoop]: Abstraction has 4038 states and 13150 transitions. [2021-11-21 00:11:12,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:12,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4038 states and 13150 transitions. [2021-11-21 00:11:12,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:11:12,319 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:12,319 INFO L514 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] [2021-11-21 00:11:12,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-21 00:11:12,319 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:12,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:12,320 INFO L85 PathProgramCache]: Analyzing trace with hash -377685254, now seen corresponding path program 11 times [2021-11-21 00:11:12,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:12,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418175480] [2021-11-21 00:11:12,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:12,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:12,611 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:12,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418175480] [2021-11-21 00:11:12,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418175480] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:12,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:12,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-21 00:11:12,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646701734] [2021-11-21 00:11:12,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:12,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-21 00:11:12,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:12,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-21 00:11:12,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-11-21 00:11:12,613 INFO L87 Difference]: Start difference. First operand 4038 states and 13150 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:13,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:13,921 INFO L93 Difference]: Finished difference Result 4442 states and 14354 transitions. [2021-11-21 00:11:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-21 00:11:13,921 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:11:13,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:13,929 INFO L225 Difference]: With dead ends: 4442 [2021-11-21 00:11:13,930 INFO L226 Difference]: Without dead ends: 4338 [2021-11-21 00:11:13,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2021-11-21 00:11:13,930 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 193 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:13,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 36 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-21 00:11:13,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4338 states. [2021-11-21 00:11:14,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4338 to 4050. [2021-11-21 00:11:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4050 states, 4046 states have (on average 3.2595155709342563) internal successors, (13188), 4049 states have internal predecessors, (13188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 13188 transitions. [2021-11-21 00:11:14,089 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 13188 transitions. Word has length 25 [2021-11-21 00:11:14,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:14,089 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 13188 transitions. [2021-11-21 00:11:14,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 13188 transitions. [2021-11-21 00:11:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:11:14,100 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:14,100 INFO L514 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] [2021-11-21 00:11:14,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-21 00:11:14,100 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:14,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:14,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1906198596, now seen corresponding path program 12 times [2021-11-21 00:11:14,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:14,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529075537] [2021-11-21 00:11:14,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:14,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:14,583 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:14,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529075537] [2021-11-21 00:11:14,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529075537] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:14,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:14,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-21 00:11:14,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493238219] [2021-11-21 00:11:14,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:14,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 00:11:14,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:14,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 00:11:14,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-11-21 00:11:14,585 INFO L87 Difference]: Start difference. First operand 4050 states and 13188 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:17,804 INFO L93 Difference]: Finished difference Result 5399 states and 17280 transitions. [2021-11-21 00:11:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-21 00:11:17,804 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:11:17,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:17,813 INFO L225 Difference]: With dead ends: 5399 [2021-11-21 00:11:17,814 INFO L226 Difference]: Without dead ends: 5295 [2021-11-21 00:11:17,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=527, Invalid=1365, Unknown=0, NotChecked=0, Total=1892 [2021-11-21 00:11:17,815 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 283 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 2399 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 2425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:17,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 69 Invalid, 2425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2399 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-21 00:11:17,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2021-11-21 00:11:17,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 3798. [2021-11-21 00:11:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3798 states, 3794 states have (on average 3.265682656826568) internal successors, (12390), 3797 states have internal predecessors, (12390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3798 states to 3798 states and 12390 transitions. [2021-11-21 00:11:17,911 INFO L78 Accepts]: Start accepts. Automaton has 3798 states and 12390 transitions. Word has length 25 [2021-11-21 00:11:17,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:17,911 INFO L470 AbstractCegarLoop]: Abstraction has 3798 states and 12390 transitions. [2021-11-21 00:11:17,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:17,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3798 states and 12390 transitions. [2021-11-21 00:11:17,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:11:17,919 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:17,919 INFO L514 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] [2021-11-21 00:11:17,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-21 00:11:17,919 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:17,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2087370654, now seen corresponding path program 13 times [2021-11-21 00:11:17,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:17,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979387320] [2021-11-21 00:11:17,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:17,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:18,270 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:18,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979387320] [2021-11-21 00:11:18,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979387320] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:18,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:18,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-21 00:11:18,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499533740] [2021-11-21 00:11:18,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:18,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-21 00:11:18,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:18,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-21 00:11:18,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-21 00:11:18,271 INFO L87 Difference]: Start difference. First operand 3798 states and 12390 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:21,939 INFO L93 Difference]: Finished difference Result 4999 states and 15871 transitions. [2021-11-21 00:11:21,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-21 00:11:21,940 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:11:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:21,949 INFO L225 Difference]: With dead ends: 4999 [2021-11-21 00:11:21,949 INFO L226 Difference]: Without dead ends: 4895 [2021-11-21 00:11:21,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=570, Invalid=1592, Unknown=0, NotChecked=0, Total=2162 [2021-11-21 00:11:21,951 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 297 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 2730 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:21,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 78 Invalid, 2763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2730 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-21 00:11:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4895 states. [2021-11-21 00:11:22,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4895 to 3572. [2021-11-21 00:11:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3572 states, 3568 states have (on average 3.2362668161434978) internal successors, (11547), 3571 states have internal predecessors, (11547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:22,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 11547 transitions. [2021-11-21 00:11:22,050 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 11547 transitions. Word has length 25 [2021-11-21 00:11:22,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:22,050 INFO L470 AbstractCegarLoop]: Abstraction has 3572 states and 11547 transitions. [2021-11-21 00:11:22,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 11547 transitions. [2021-11-21 00:11:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:11:22,058 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:22,058 INFO L514 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] [2021-11-21 00:11:22,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-21 00:11:22,058 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:22,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:22,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1463852106, now seen corresponding path program 4 times [2021-11-21 00:11:22,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:22,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521764211] [2021-11-21 00:11:22,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:22,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:22,440 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:22,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521764211] [2021-11-21 00:11:22,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521764211] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:22,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:22,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-21 00:11:22,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904857694] [2021-11-21 00:11:22,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:22,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-21 00:11:22,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:22,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-21 00:11:22,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-21 00:11:22,441 INFO L87 Difference]: Start difference. First operand 3572 states and 11547 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:24,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:24,891 INFO L93 Difference]: Finished difference Result 4955 states and 15607 transitions. [2021-11-21 00:11:24,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-21 00:11:24,891 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:11:24,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:24,899 INFO L225 Difference]: With dead ends: 4955 [2021-11-21 00:11:24,899 INFO L226 Difference]: Without dead ends: 4851 [2021-11-21 00:11:24,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=362, Invalid=898, Unknown=0, NotChecked=0, Total=1260 [2021-11-21 00:11:24,901 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 247 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 2404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:24,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 55 Invalid, 2404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-21 00:11:24,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4851 states. [2021-11-21 00:11:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4851 to 3502. [2021-11-21 00:11:24,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3502 states, 3498 states have (on average 3.2238421955403087) internal successors, (11277), 3501 states have internal predecessors, (11277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3502 states to 3502 states and 11277 transitions. [2021-11-21 00:11:24,972 INFO L78 Accepts]: Start accepts. Automaton has 3502 states and 11277 transitions. Word has length 25 [2021-11-21 00:11:24,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:24,972 INFO L470 AbstractCegarLoop]: Abstraction has 3502 states and 11277 transitions. [2021-11-21 00:11:24,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states and 11277 transitions. [2021-11-21 00:11:24,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:11:24,978 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:24,978 INFO L514 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] [2021-11-21 00:11:24,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-21 00:11:24,979 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:24,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:24,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1776481424, now seen corresponding path program 5 times [2021-11-21 00:11:24,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:24,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987878321] [2021-11-21 00:11:24,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:24,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:25,367 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:25,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987878321] [2021-11-21 00:11:25,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987878321] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:25,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:25,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-21 00:11:25,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107335760] [2021-11-21 00:11:25,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:25,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-21 00:11:25,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:25,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-21 00:11:25,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-21 00:11:25,369 INFO L87 Difference]: Start difference. First operand 3502 states and 11277 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:27,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:27,830 INFO L93 Difference]: Finished difference Result 4735 states and 14947 transitions. [2021-11-21 00:11:27,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-21 00:11:27,830 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:11:27,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:27,838 INFO L225 Difference]: With dead ends: 4735 [2021-11-21 00:11:27,839 INFO L226 Difference]: Without dead ends: 4631 [2021-11-21 00:11:27,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=399, Invalid=1007, Unknown=0, NotChecked=0, Total=1406 [2021-11-21 00:11:27,840 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 285 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 2207 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:27,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 56 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2207 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-21 00:11:27,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2021-11-21 00:11:27,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 3362. [2021-11-21 00:11:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3362 states, 3358 states have (on average 3.233174508636093) internal successors, (10857), 3361 states have internal predecessors, (10857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3362 states to 3362 states and 10857 transitions. [2021-11-21 00:11:27,907 INFO L78 Accepts]: Start accepts. Automaton has 3362 states and 10857 transitions. Word has length 25 [2021-11-21 00:11:27,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:27,907 INFO L470 AbstractCegarLoop]: Abstraction has 3362 states and 10857 transitions. [2021-11-21 00:11:27,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3362 states and 10857 transitions. [2021-11-21 00:11:27,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:11:27,913 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:27,913 INFO L514 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] [2021-11-21 00:11:27,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-21 00:11:27,913 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:27,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1019653420, now seen corresponding path program 6 times [2021-11-21 00:11:27,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:27,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388802658] [2021-11-21 00:11:27,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:27,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:28,191 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:28,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388802658] [2021-11-21 00:11:28,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388802658] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:28,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:28,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-21 00:11:28,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909967064] [2021-11-21 00:11:28,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:28,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-21 00:11:28,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:28,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-21 00:11:28,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-21 00:11:28,192 INFO L87 Difference]: Start difference. First operand 3362 states and 10857 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:30,693 INFO L93 Difference]: Finished difference Result 4518 states and 14236 transitions. [2021-11-21 00:11:30,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-21 00:11:30,693 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 00:11:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:30,702 INFO L225 Difference]: With dead ends: 4518 [2021-11-21 00:11:30,702 INFO L226 Difference]: Without dead ends: 4414 [2021-11-21 00:11:30,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=395, Invalid=1011, Unknown=0, NotChecked=0, Total=1406 [2021-11-21 00:11:30,703 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 286 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:30,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 54 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-21 00:11:30,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4414 states. [2021-11-21 00:11:30,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4414 to 3236. [2021-11-21 00:11:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3236 states, 3232 states have (on average 3.219059405940594) internal successors, (10404), 3235 states have internal predecessors, (10404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:30,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 10404 transitions. [2021-11-21 00:11:30,782 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 10404 transitions. Word has length 25 [2021-11-21 00:11:30,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:30,782 INFO L470 AbstractCegarLoop]: Abstraction has 3236 states and 10404 transitions. [2021-11-21 00:11:30,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:30,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 10404 transitions. [2021-11-21 00:11:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:11:30,789 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:30,789 INFO L514 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] [2021-11-21 00:11:30,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-21 00:11:30,790 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:30,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:30,790 INFO L85 PathProgramCache]: Analyzing trace with hash -791090139, now seen corresponding path program 1 times [2021-11-21 00:11:30,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:30,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107835674] [2021-11-21 00:11:30,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:30,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:31,501 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:31,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107835674] [2021-11-21 00:11:31,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107835674] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:31,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:31,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-21 00:11:31,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761196121] [2021-11-21 00:11:31,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:31,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-21 00:11:31,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:31,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-21 00:11:31,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-11-21 00:11:31,503 INFO L87 Difference]: Start difference. First operand 3236 states and 10404 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:33,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:33,488 INFO L93 Difference]: Finished difference Result 4862 states and 15844 transitions. [2021-11-21 00:11:33,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-21 00:11:33,488 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:11:33,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:33,500 INFO L225 Difference]: With dead ends: 4862 [2021-11-21 00:11:33,500 INFO L226 Difference]: Without dead ends: 4862 [2021-11-21 00:11:33,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2021-11-21 00:11:33,501 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 299 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 2327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:33,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 40 Invalid, 2327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2289 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-21 00:11:33,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2021-11-21 00:11:33,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 3726. [2021-11-21 00:11:33,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3726 states, 3722 states have (on average 3.2291778613648576) internal successors, (12019), 3725 states have internal predecessors, (12019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3726 states and 12019 transitions. [2021-11-21 00:11:33,590 INFO L78 Accepts]: Start accepts. Automaton has 3726 states and 12019 transitions. Word has length 27 [2021-11-21 00:11:33,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:33,590 INFO L470 AbstractCegarLoop]: Abstraction has 3726 states and 12019 transitions. [2021-11-21 00:11:33,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:33,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3726 states and 12019 transitions. [2021-11-21 00:11:33,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:11:33,597 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:33,597 INFO L514 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] [2021-11-21 00:11:33,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-21 00:11:33,597 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:33,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:33,598 INFO L85 PathProgramCache]: Analyzing trace with hash -144571469, now seen corresponding path program 1 times [2021-11-21 00:11:33,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:33,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112436455] [2021-11-21 00:11:33,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:33,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:34,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:34,178 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:34,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112436455] [2021-11-21 00:11:34,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112436455] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:34,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:34,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-21 00:11:34,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545654795] [2021-11-21 00:11:34,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:34,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-21 00:11:34,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:34,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-21 00:11:34,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-11-21 00:11:34,179 INFO L87 Difference]: Start difference. First operand 3726 states and 12019 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:36,099 INFO L93 Difference]: Finished difference Result 5324 states and 17516 transitions. [2021-11-21 00:11:36,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-21 00:11:36,099 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:11:36,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:36,111 INFO L225 Difference]: With dead ends: 5324 [2021-11-21 00:11:36,111 INFO L226 Difference]: Without dead ends: 5324 [2021-11-21 00:11:36,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2021-11-21 00:11:36,112 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 276 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 2259 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:36,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 40 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2259 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-21 00:11:36,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5324 states. [2021-11-21 00:11:36,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5324 to 4195. [2021-11-21 00:11:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4195 states, 4191 states have (on average 3.2600811262228584) internal successors, (13663), 4194 states have internal predecessors, (13663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 13663 transitions. [2021-11-21 00:11:36,238 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 13663 transitions. Word has length 27 [2021-11-21 00:11:36,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:36,239 INFO L470 AbstractCegarLoop]: Abstraction has 4195 states and 13663 transitions. [2021-11-21 00:11:36,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:36,239 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 13663 transitions. [2021-11-21 00:11:36,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:11:36,245 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:36,246 INFO L514 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] [2021-11-21 00:11:36,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-21 00:11:36,246 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:36,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:36,247 INFO L85 PathProgramCache]: Analyzing trace with hash -144571468, now seen corresponding path program 1 times [2021-11-21 00:11:36,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:36,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933840202] [2021-11-21 00:11:36,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:36,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:36,893 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:36,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933840202] [2021-11-21 00:11:36,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933840202] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:36,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:36,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-21 00:11:36,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250348595] [2021-11-21 00:11:36,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:36,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-21 00:11:36,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:36,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-21 00:11:36,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-11-21 00:11:36,895 INFO L87 Difference]: Start difference. First operand 4195 states and 13663 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:38,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:38,672 INFO L93 Difference]: Finished difference Result 5324 states and 17377 transitions. [2021-11-21 00:11:38,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-21 00:11:38,673 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:11:38,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:38,683 INFO L225 Difference]: With dead ends: 5324 [2021-11-21 00:11:38,684 INFO L226 Difference]: Without dead ends: 5324 [2021-11-21 00:11:38,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2021-11-21 00:11:38,684 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 301 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:38,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 39 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-21 00:11:38,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5324 states. [2021-11-21 00:11:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5324 to 3889. [2021-11-21 00:11:38,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3889 states, 3885 states have (on average 3.2265122265122264) internal successors, (12535), 3888 states have internal predecessors, (12535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:38,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3889 states to 3889 states and 12535 transitions. [2021-11-21 00:11:38,762 INFO L78 Accepts]: Start accepts. Automaton has 3889 states and 12535 transitions. Word has length 27 [2021-11-21 00:11:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:38,763 INFO L470 AbstractCegarLoop]: Abstraction has 3889 states and 12535 transitions. [2021-11-21 00:11:38,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:38,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3889 states and 12535 transitions. [2021-11-21 00:11:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:11:38,767 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:38,767 INFO L514 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] [2021-11-21 00:11:38,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-21 00:11:38,767 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:38,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:38,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2119199897, now seen corresponding path program 2 times [2021-11-21 00:11:38,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:38,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972078834] [2021-11-21 00:11:38,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:38,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:39,369 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:39,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972078834] [2021-11-21 00:11:39,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972078834] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:39,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:39,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-21 00:11:39,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050708908] [2021-11-21 00:11:39,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:39,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-21 00:11:39,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:39,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-21 00:11:39,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-11-21 00:11:39,371 INFO L87 Difference]: Start difference. First operand 3889 states and 12535 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:41,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:41,339 INFO L93 Difference]: Finished difference Result 6783 states and 22024 transitions. [2021-11-21 00:11:41,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-21 00:11:41,340 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:11:41,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:41,353 INFO L225 Difference]: With dead ends: 6783 [2021-11-21 00:11:41,353 INFO L226 Difference]: Without dead ends: 6783 [2021-11-21 00:11:41,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2021-11-21 00:11:41,354 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 354 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 2553 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 2585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:41,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 60 Invalid, 2585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2553 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-21 00:11:41,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6783 states. [2021-11-21 00:11:41,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6783 to 4575. [2021-11-21 00:11:41,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4575 states, 4571 states have (on average 3.2443666593743163) internal successors, (14830), 4574 states have internal predecessors, (14830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:41,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4575 states to 4575 states and 14830 transitions. [2021-11-21 00:11:41,442 INFO L78 Accepts]: Start accepts. Automaton has 4575 states and 14830 transitions. Word has length 27 [2021-11-21 00:11:41,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:41,443 INFO L470 AbstractCegarLoop]: Abstraction has 4575 states and 14830 transitions. [2021-11-21 00:11:41,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:41,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4575 states and 14830 transitions. [2021-11-21 00:11:41,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:11:41,450 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:41,450 INFO L514 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] [2021-11-21 00:11:41,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-21 00:11:41,450 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:41,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:41,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2119199898, now seen corresponding path program 1 times [2021-11-21 00:11:41,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:41,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366807097] [2021-11-21 00:11:41,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:41,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:42,130 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:42,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366807097] [2021-11-21 00:11:42,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366807097] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:42,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:42,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-21 00:11:42,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720051236] [2021-11-21 00:11:42,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:42,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-21 00:11:42,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:42,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-21 00:11:42,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-11-21 00:11:42,131 INFO L87 Difference]: Start difference. First operand 4575 states and 14830 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:44,169 INFO L93 Difference]: Finished difference Result 6693 states and 21686 transitions. [2021-11-21 00:11:44,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-21 00:11:44,169 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:11:44,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:44,183 INFO L225 Difference]: With dead ends: 6693 [2021-11-21 00:11:44,183 INFO L226 Difference]: Without dead ends: 6693 [2021-11-21 00:11:44,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2021-11-21 00:11:44,184 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 327 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 2729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:44,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 62 Invalid, 2729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2702 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-21 00:11:44,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6693 states. [2021-11-21 00:11:44,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6693 to 4111. [2021-11-21 00:11:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4111 states, 4107 states have (on average 3.2142683223764306) internal successors, (13201), 4110 states have internal predecessors, (13201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 4111 states and 13201 transitions. [2021-11-21 00:11:44,318 INFO L78 Accepts]: Start accepts. Automaton has 4111 states and 13201 transitions. Word has length 27 [2021-11-21 00:11:44,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:44,318 INFO L470 AbstractCegarLoop]: Abstraction has 4111 states and 13201 transitions. [2021-11-21 00:11:44,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4111 states and 13201 transitions. [2021-11-21 00:11:44,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:11:44,322 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:44,322 INFO L514 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] [2021-11-21 00:11:44,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-21 00:11:44,322 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:44,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:44,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2035547327, now seen corresponding path program 3 times [2021-11-21 00:11:44,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:44,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125544957] [2021-11-21 00:11:44,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:44,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:45,069 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:45,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125544957] [2021-11-21 00:11:45,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125544957] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:45,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:45,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-21 00:11:45,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658298834] [2021-11-21 00:11:45,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:45,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-21 00:11:45,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:45,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-21 00:11:45,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-11-21 00:11:45,070 INFO L87 Difference]: Start difference. First operand 4111 states and 13201 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:47,186 INFO L93 Difference]: Finished difference Result 6807 states and 22096 transitions. [2021-11-21 00:11:47,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-21 00:11:47,186 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:11:47,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:47,200 INFO L225 Difference]: With dead ends: 6807 [2021-11-21 00:11:47,200 INFO L226 Difference]: Without dead ends: 6807 [2021-11-21 00:11:47,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2021-11-21 00:11:47,201 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 324 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 2563 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 2590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:47,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 66 Invalid, 2590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2563 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-21 00:11:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6807 states. [2021-11-21 00:11:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6807 to 4854. [2021-11-21 00:11:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4854 states, 4850 states have (on average 3.2303092783505156) internal successors, (15667), 4853 states have internal predecessors, (15667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4854 states to 4854 states and 15667 transitions. [2021-11-21 00:11:47,298 INFO L78 Accepts]: Start accepts. Automaton has 4854 states and 15667 transitions. Word has length 27 [2021-11-21 00:11:47,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:47,298 INFO L470 AbstractCegarLoop]: Abstraction has 4854 states and 15667 transitions. [2021-11-21 00:11:47,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:47,298 INFO L276 IsEmpty]: Start isEmpty. Operand 4854 states and 15667 transitions. [2021-11-21 00:11:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:11:47,304 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:47,304 INFO L514 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] [2021-11-21 00:11:47,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-21 00:11:47,305 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:47,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:47,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2035547326, now seen corresponding path program 2 times [2021-11-21 00:11:47,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:47,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718714552] [2021-11-21 00:11:47,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:47,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:47,986 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:47,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718714552] [2021-11-21 00:11:47,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718714552] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:47,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:47,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-21 00:11:47,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714810578] [2021-11-21 00:11:47,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:47,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-21 00:11:47,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:47,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-21 00:11:47,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-11-21 00:11:47,988 INFO L87 Difference]: Start difference. First operand 4854 states and 15667 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:49,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:49,913 INFO L93 Difference]: Finished difference Result 6717 states and 21758 transitions. [2021-11-21 00:11:49,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-21 00:11:49,914 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:11:49,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:49,932 INFO L225 Difference]: With dead ends: 6717 [2021-11-21 00:11:49,932 INFO L226 Difference]: Without dead ends: 6717 [2021-11-21 00:11:49,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2021-11-21 00:11:49,934 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 350 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 2636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:49,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 68 Invalid, 2636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2608 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-21 00:11:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6717 states. [2021-11-21 00:11:50,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6717 to 4354. [2021-11-21 00:11:50,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4354 states, 4350 states have (on average 3.2022988505747128) internal successors, (13930), 4353 states have internal predecessors, (13930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4354 states to 4354 states and 13930 transitions. [2021-11-21 00:11:50,038 INFO L78 Accepts]: Start accepts. Automaton has 4354 states and 13930 transitions. Word has length 27 [2021-11-21 00:11:50,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:50,038 INFO L470 AbstractCegarLoop]: Abstraction has 4354 states and 13930 transitions. [2021-11-21 00:11:50,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4354 states and 13930 transitions. [2021-11-21 00:11:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:11:50,042 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:50,042 INFO L514 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] [2021-11-21 00:11:50,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-21 00:11:50,042 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:50,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:50,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1610363571, now seen corresponding path program 4 times [2021-11-21 00:11:50,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:50,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728971683] [2021-11-21 00:11:50,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:50,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:50,672 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:50,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728971683] [2021-11-21 00:11:50,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728971683] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:50,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:50,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-21 00:11:50,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948994141] [2021-11-21 00:11:50,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:50,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-21 00:11:50,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:50,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-21 00:11:50,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-11-21 00:11:50,674 INFO L87 Difference]: Start difference. First operand 4354 states and 13930 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:53,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:53,345 INFO L93 Difference]: Finished difference Result 7479 states and 24607 transitions. [2021-11-21 00:11:53,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-21 00:11:53,345 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:11:53,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:53,361 INFO L225 Difference]: With dead ends: 7479 [2021-11-21 00:11:53,361 INFO L226 Difference]: Without dead ends: 7479 [2021-11-21 00:11:53,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2021-11-21 00:11:53,362 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 450 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 3414 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 3451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:53,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [450 Valid, 89 Invalid, 3451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3414 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-21 00:11:53,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7479 states. [2021-11-21 00:11:53,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7479 to 5343. [2021-11-21 00:11:53,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5343 states, 5339 states have (on average 3.2331897359056003) internal successors, (17262), 5342 states have internal predecessors, (17262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5343 states to 5343 states and 17262 transitions. [2021-11-21 00:11:53,470 INFO L78 Accepts]: Start accepts. Automaton has 5343 states and 17262 transitions. Word has length 27 [2021-11-21 00:11:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:53,470 INFO L470 AbstractCegarLoop]: Abstraction has 5343 states and 17262 transitions. [2021-11-21 00:11:53,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:53,470 INFO L276 IsEmpty]: Start isEmpty. Operand 5343 states and 17262 transitions. [2021-11-21 00:11:53,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:11:53,475 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:53,475 INFO L514 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] [2021-11-21 00:11:53,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-21 00:11:53,475 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:53,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:53,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1610363570, now seen corresponding path program 3 times [2021-11-21 00:11:53,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:53,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937154827] [2021-11-21 00:11:53,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:53,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:54,053 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:54,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937154827] [2021-11-21 00:11:54,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937154827] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:54,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:54,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-21 00:11:54,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090487718] [2021-11-21 00:11:54,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:54,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-21 00:11:54,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:54,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-21 00:11:54,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-11-21 00:11:54,057 INFO L87 Difference]: Start difference. First operand 5343 states and 17262 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:56,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:56,758 INFO L93 Difference]: Finished difference Result 7479 states and 24419 transitions. [2021-11-21 00:11:56,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-21 00:11:56,759 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:11:56,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:56,774 INFO L225 Difference]: With dead ends: 7479 [2021-11-21 00:11:56,774 INFO L226 Difference]: Without dead ends: 7479 [2021-11-21 00:11:56,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2021-11-21 00:11:56,775 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 425 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3635 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 3667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:56,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 100 Invalid, 3667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3635 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-21 00:11:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7479 states. [2021-11-21 00:11:56,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7479 to 4807. [2021-11-21 00:11:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4807 states, 4803 states have (on average 3.2098688319800126) internal successors, (15417), 4806 states have internal predecessors, (15417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4807 states to 4807 states and 15417 transitions. [2021-11-21 00:11:56,874 INFO L78 Accepts]: Start accepts. Automaton has 4807 states and 15417 transitions. Word has length 27 [2021-11-21 00:11:56,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:56,875 INFO L470 AbstractCegarLoop]: Abstraction has 4807 states and 15417 transitions. [2021-11-21 00:11:56,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand 4807 states and 15417 transitions. [2021-11-21 00:11:56,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:11:56,879 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:56,879 INFO L514 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] [2021-11-21 00:11:56,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-21 00:11:56,880 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:56,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:56,880 INFO L85 PathProgramCache]: Analyzing trace with hash -280358237, now seen corresponding path program 2 times [2021-11-21 00:11:56,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:56,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134921670] [2021-11-21 00:11:56,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:56,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:57,537 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:11:57,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134921670] [2021-11-21 00:11:57,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134921670] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:57,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:57,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-21 00:11:57,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709615091] [2021-11-21 00:11:57,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:57,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-21 00:11:57,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:11:57,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-21 00:11:57,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-11-21 00:11:57,538 INFO L87 Difference]: Start difference. First operand 4807 states and 15417 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:59,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:59,390 INFO L93 Difference]: Finished difference Result 7351 states and 23788 transitions. [2021-11-21 00:11:59,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-21 00:11:59,391 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:11:59,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:59,406 INFO L225 Difference]: With dead ends: 7351 [2021-11-21 00:11:59,406 INFO L226 Difference]: Without dead ends: 7351 [2021-11-21 00:11:59,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2021-11-21 00:11:59,407 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 352 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 2554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:59,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 64 Invalid, 2554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-21 00:11:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7351 states. [2021-11-21 00:11:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7351 to 5027. [2021-11-21 00:11:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5027 states, 5023 states have (on average 3.2006768863229147) internal successors, (16077), 5026 states have internal predecessors, (16077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 16077 transitions. [2021-11-21 00:11:59,505 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 16077 transitions. Word has length 27 [2021-11-21 00:11:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:59,506 INFO L470 AbstractCegarLoop]: Abstraction has 5027 states and 16077 transitions. [2021-11-21 00:11:59,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 16077 transitions. [2021-11-21 00:11:59,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:11:59,510 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:59,510 INFO L514 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] [2021-11-21 00:11:59,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-21 00:11:59,511 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:11:59,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:59,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1336670495, now seen corresponding path program 3 times [2021-11-21 00:11:59,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:11:59,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828695455] [2021-11-21 00:11:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:59,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:11:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:00,040 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:00,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828695455] [2021-11-21 00:12:00,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828695455] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:00,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:00,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-21 00:12:00,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115997613] [2021-11-21 00:12:00,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:00,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-21 00:12:00,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:00,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-21 00:12:00,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-11-21 00:12:00,042 INFO L87 Difference]: Start difference. First operand 5027 states and 16077 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:02,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:02,687 INFO L93 Difference]: Finished difference Result 8141 states and 26533 transitions. [2021-11-21 00:12:02,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-21 00:12:02,687 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:02,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:02,703 INFO L225 Difference]: With dead ends: 8141 [2021-11-21 00:12:02,703 INFO L226 Difference]: Without dead ends: 8141 [2021-11-21 00:12:02,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2021-11-21 00:12:02,704 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 361 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 3872 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:02,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 98 Invalid, 3907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3872 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-21 00:12:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8141 states. [2021-11-21 00:12:02,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8141 to 5168. [2021-11-21 00:12:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5168 states, 5164 states have (on average 3.201781564678544) internal successors, (16534), 5167 states have internal predecessors, (16534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5168 states to 5168 states and 16534 transitions. [2021-11-21 00:12:02,810 INFO L78 Accepts]: Start accepts. Automaton has 5168 states and 16534 transitions. Word has length 27 [2021-11-21 00:12:02,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:02,810 INFO L470 AbstractCegarLoop]: Abstraction has 5168 states and 16534 transitions. [2021-11-21 00:12:02,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:02,811 INFO L276 IsEmpty]: Start isEmpty. Operand 5168 states and 16534 transitions. [2021-11-21 00:12:02,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:02,815 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:02,815 INFO L514 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] [2021-11-21 00:12:02,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-21 00:12:02,816 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:02,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:02,816 INFO L85 PathProgramCache]: Analyzing trace with hash -127293911, now seen corresponding path program 5 times [2021-11-21 00:12:02,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:02,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123390126] [2021-11-21 00:12:02,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:02,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:03,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:03,486 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:03,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123390126] [2021-11-21 00:12:03,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123390126] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:03,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:03,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-21 00:12:03,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695087001] [2021-11-21 00:12:03,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:03,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-21 00:12:03,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:03,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-21 00:12:03,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-11-21 00:12:03,487 INFO L87 Difference]: Start difference. First operand 5168 states and 16534 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:05,545 INFO L93 Difference]: Finished difference Result 7476 states and 24022 transitions. [2021-11-21 00:12:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-21 00:12:05,546 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:05,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:05,560 INFO L225 Difference]: With dead ends: 7476 [2021-11-21 00:12:05,560 INFO L226 Difference]: Without dead ends: 7476 [2021-11-21 00:12:05,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2021-11-21 00:12:05,561 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 312 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 2768 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 2799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:05,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 73 Invalid, 2799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2768 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-21 00:12:05,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7476 states. [2021-11-21 00:12:05,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7476 to 5348. [2021-11-21 00:12:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5348 states, 5344 states have (on average 3.1949850299401197) internal successors, (17074), 5347 states have internal predecessors, (17074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:05,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5348 states to 5348 states and 17074 transitions. [2021-11-21 00:12:05,658 INFO L78 Accepts]: Start accepts. Automaton has 5348 states and 17074 transitions. Word has length 27 [2021-11-21 00:12:05,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:05,659 INFO L470 AbstractCegarLoop]: Abstraction has 5348 states and 17074 transitions. [2021-11-21 00:12:05,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:05,659 INFO L276 IsEmpty]: Start isEmpty. Operand 5348 states and 17074 transitions. [2021-11-21 00:12:05,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:05,663 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:05,664 INFO L514 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] [2021-11-21 00:12:05,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-21 00:12:05,664 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:05,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:05,664 INFO L85 PathProgramCache]: Analyzing trace with hash 12926161, now seen corresponding path program 6 times [2021-11-21 00:12:05,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:05,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850786437] [2021-11-21 00:12:05,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:05,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:06,336 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:06,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850786437] [2021-11-21 00:12:06,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850786437] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:06,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:06,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-21 00:12:06,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573425252] [2021-11-21 00:12:06,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:06,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-21 00:12:06,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:06,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-21 00:12:06,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-11-21 00:12:06,338 INFO L87 Difference]: Start difference. First operand 5348 states and 17074 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:08,500 INFO L93 Difference]: Finished difference Result 8170 states and 26418 transitions. [2021-11-21 00:12:08,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-21 00:12:08,501 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:08,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:08,523 INFO L225 Difference]: With dead ends: 8170 [2021-11-21 00:12:08,523 INFO L226 Difference]: Without dead ends: 8170 [2021-11-21 00:12:08,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2021-11-21 00:12:08,524 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 337 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 2828 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:08,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 81 Invalid, 2857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2828 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-21 00:12:08,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8170 states. [2021-11-21 00:12:08,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8170 to 6208. [2021-11-21 00:12:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6208 states, 6204 states have (on average 3.2061573178594456) internal successors, (19891), 6207 states have internal predecessors, (19891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 19891 transitions. [2021-11-21 00:12:08,650 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 19891 transitions. Word has length 27 [2021-11-21 00:12:08,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:08,650 INFO L470 AbstractCegarLoop]: Abstraction has 6208 states and 19891 transitions. [2021-11-21 00:12:08,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 19891 transitions. [2021-11-21 00:12:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:08,655 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:08,655 INFO L514 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] [2021-11-21 00:12:08,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-21 00:12:08,656 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:08,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:08,656 INFO L85 PathProgramCache]: Analyzing trace with hash 12926162, now seen corresponding path program 4 times [2021-11-21 00:12:08,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:08,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844243671] [2021-11-21 00:12:08,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:08,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:09,265 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:09,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844243671] [2021-11-21 00:12:09,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844243671] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:09,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:09,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-21 00:12:09,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310201703] [2021-11-21 00:12:09,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:09,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-21 00:12:09,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:09,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-21 00:12:09,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-11-21 00:12:09,267 INFO L87 Difference]: Start difference. First operand 6208 states and 19891 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:11,118 INFO L93 Difference]: Finished difference Result 8170 states and 26279 transitions. [2021-11-21 00:12:11,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-21 00:12:11,124 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:11,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:11,140 INFO L225 Difference]: With dead ends: 8170 [2021-11-21 00:12:11,140 INFO L226 Difference]: Without dead ends: 8170 [2021-11-21 00:12:11,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2021-11-21 00:12:11,141 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 364 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 2435 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:11,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 71 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2435 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-21 00:12:11,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8170 states. [2021-11-21 00:12:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8170 to 5708. [2021-11-21 00:12:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5708 states, 5704 states have (on average 3.182678821879383) internal successors, (18154), 5707 states have internal predecessors, (18154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5708 states to 5708 states and 18154 transitions. [2021-11-21 00:12:11,248 INFO L78 Accepts]: Start accepts. Automaton has 5708 states and 18154 transitions. Word has length 27 [2021-11-21 00:12:11,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:11,248 INFO L470 AbstractCegarLoop]: Abstraction has 5708 states and 18154 transitions. [2021-11-21 00:12:11,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 5708 states and 18154 transitions. [2021-11-21 00:12:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:11,254 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:11,254 INFO L514 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] [2021-11-21 00:12:11,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-21 00:12:11,254 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:11,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:11,254 INFO L85 PathProgramCache]: Analyzing trace with hash 438109917, now seen corresponding path program 7 times [2021-11-21 00:12:11,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:11,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695997710] [2021-11-21 00:12:11,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:11,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:11,825 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:11,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695997710] [2021-11-21 00:12:11,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695997710] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:11,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:11,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-21 00:12:11,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626726034] [2021-11-21 00:12:11,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:11,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-21 00:12:11,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:11,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-21 00:12:11,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-11-21 00:12:11,827 INFO L87 Difference]: Start difference. First operand 5708 states and 18154 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:14,541 INFO L93 Difference]: Finished difference Result 9030 states and 29261 transitions. [2021-11-21 00:12:14,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-21 00:12:14,542 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:14,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:14,563 INFO L225 Difference]: With dead ends: 9030 [2021-11-21 00:12:14,563 INFO L226 Difference]: Without dead ends: 9030 [2021-11-21 00:12:14,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2021-11-21 00:12:14,564 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 424 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 3743 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 3779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:14,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 101 Invalid, 3779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3743 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-21 00:12:14,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9030 states. [2021-11-21 00:12:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9030 to 5408. [2021-11-21 00:12:14,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5408 states, 5404 states have (on average 3.192820133234641) internal successors, (17254), 5407 states have internal predecessors, (17254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:14,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5408 states to 5408 states and 17254 transitions. [2021-11-21 00:12:14,701 INFO L78 Accepts]: Start accepts. Automaton has 5408 states and 17254 transitions. Word has length 27 [2021-11-21 00:12:14,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:14,701 INFO L470 AbstractCegarLoop]: Abstraction has 5408 states and 17254 transitions. [2021-11-21 00:12:14,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 5408 states and 17254 transitions. [2021-11-21 00:12:14,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:14,706 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:14,706 INFO L514 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] [2021-11-21 00:12:14,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-21 00:12:14,707 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:14,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:14,707 INFO L85 PathProgramCache]: Analyzing trace with hash -813193971, now seen corresponding path program 8 times [2021-11-21 00:12:14,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:14,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898550893] [2021-11-21 00:12:14,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:14,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:15,329 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:15,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898550893] [2021-11-21 00:12:15,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898550893] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:15,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:15,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-21 00:12:15,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57638126] [2021-11-21 00:12:15,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:15,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-21 00:12:15,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:15,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-21 00:12:15,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-11-21 00:12:15,331 INFO L87 Difference]: Start difference. First operand 5408 states and 17254 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:17,139 INFO L93 Difference]: Finished difference Result 6940 states and 22414 transitions. [2021-11-21 00:12:17,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-21 00:12:17,139 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:17,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:17,153 INFO L225 Difference]: With dead ends: 6940 [2021-11-21 00:12:17,153 INFO L226 Difference]: Without dead ends: 6940 [2021-11-21 00:12:17,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2021-11-21 00:12:17,154 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 323 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:17,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 63 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-21 00:12:17,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6940 states. [2021-11-21 00:12:17,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6940 to 5280. [2021-11-21 00:12:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5280 states, 5276 states have (on average 3.1974981046247155) internal successors, (16870), 5279 states have internal predecessors, (16870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5280 states to 5280 states and 16870 transitions. [2021-11-21 00:12:17,319 INFO L78 Accepts]: Start accepts. Automaton has 5280 states and 16870 transitions. Word has length 27 [2021-11-21 00:12:17,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:17,320 INFO L470 AbstractCegarLoop]: Abstraction has 5280 states and 16870 transitions. [2021-11-21 00:12:17,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 5280 states and 16870 transitions. [2021-11-21 00:12:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:17,324 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:17,324 INFO L514 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] [2021-11-21 00:12:17,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-21 00:12:17,324 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:17,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:17,325 INFO L85 PathProgramCache]: Analyzing trace with hash -672973899, now seen corresponding path program 9 times [2021-11-21 00:12:17,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:17,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339151770] [2021-11-21 00:12:17,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:17,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:18,002 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:18,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339151770] [2021-11-21 00:12:18,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339151770] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:18,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:18,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-21 00:12:18,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52615206] [2021-11-21 00:12:18,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:18,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-21 00:12:18,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:18,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-21 00:12:18,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-11-21 00:12:18,003 INFO L87 Difference]: Start difference. First operand 5280 states and 16870 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:20,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:20,130 INFO L93 Difference]: Finished difference Result 8114 states and 26250 transitions. [2021-11-21 00:12:20,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-21 00:12:20,130 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:20,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:20,146 INFO L225 Difference]: With dead ends: 8114 [2021-11-21 00:12:20,147 INFO L226 Difference]: Without dead ends: 8114 [2021-11-21 00:12:20,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2021-11-21 00:12:20,147 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 289 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 2958 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:20,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 84 Invalid, 2983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2958 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-21 00:12:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8114 states. [2021-11-21 00:12:20,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8114 to 6104. [2021-11-21 00:12:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6104 states, 6100 states have (on average 3.209672131147541) internal successors, (19579), 6103 states have internal predecessors, (19579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6104 states to 6104 states and 19579 transitions. [2021-11-21 00:12:20,261 INFO L78 Accepts]: Start accepts. Automaton has 6104 states and 19579 transitions. Word has length 27 [2021-11-21 00:12:20,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:20,261 INFO L470 AbstractCegarLoop]: Abstraction has 6104 states and 19579 transitions. [2021-11-21 00:12:20,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 6104 states and 19579 transitions. [2021-11-21 00:12:20,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:20,267 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:20,268 INFO L514 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] [2021-11-21 00:12:20,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-21 00:12:20,268 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:20,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash -672973898, now seen corresponding path program 5 times [2021-11-21 00:12:20,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:20,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604980738] [2021-11-21 00:12:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:20,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:21,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:21,005 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:21,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604980738] [2021-11-21 00:12:21,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604980738] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:21,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:21,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-21 00:12:21,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232509611] [2021-11-21 00:12:21,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:21,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-21 00:12:21,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:21,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-21 00:12:21,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-11-21 00:12:21,007 INFO L87 Difference]: Start difference. First operand 6104 states and 19579 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:23,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:23,161 INFO L93 Difference]: Finished difference Result 8114 states and 26111 transitions. [2021-11-21 00:12:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-21 00:12:23,162 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:23,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:23,178 INFO L225 Difference]: With dead ends: 8114 [2021-11-21 00:12:23,178 INFO L226 Difference]: Without dead ends: 8114 [2021-11-21 00:12:23,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2021-11-21 00:12:23,179 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 288 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 2945 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:23,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 84 Invalid, 2968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2945 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-21 00:12:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8114 states. [2021-11-21 00:12:23,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8114 to 5604. [2021-11-21 00:12:23,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5604 states, 5600 states have (on average 3.1860714285714287) internal successors, (17842), 5603 states have internal predecessors, (17842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:23,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5604 states to 5604 states and 17842 transitions. [2021-11-21 00:12:23,288 INFO L78 Accepts]: Start accepts. Automaton has 5604 states and 17842 transitions. Word has length 27 [2021-11-21 00:12:23,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:23,288 INFO L470 AbstractCegarLoop]: Abstraction has 5604 states and 17842 transitions. [2021-11-21 00:12:23,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:23,288 INFO L276 IsEmpty]: Start isEmpty. Operand 5604 states and 17842 transitions. [2021-11-21 00:12:23,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:23,293 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:23,294 INFO L514 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] [2021-11-21 00:12:23,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-21 00:12:23,294 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:23,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:23,294 INFO L85 PathProgramCache]: Analyzing trace with hash -247790143, now seen corresponding path program 10 times [2021-11-21 00:12:23,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:23,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108781114] [2021-11-21 00:12:23,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:23,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:23,950 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:23,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108781114] [2021-11-21 00:12:23,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108781114] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:23,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:23,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-21 00:12:23,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537390840] [2021-11-21 00:12:23,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:23,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-21 00:12:23,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:23,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-21 00:12:23,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-11-21 00:12:23,951 INFO L87 Difference]: Start difference. First operand 5604 states and 17842 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:26,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:26,708 INFO L93 Difference]: Finished difference Result 8986 states and 29129 transitions. [2021-11-21 00:12:26,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-21 00:12:26,709 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:26,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:26,726 INFO L225 Difference]: With dead ends: 8986 [2021-11-21 00:12:26,726 INFO L226 Difference]: Without dead ends: 8986 [2021-11-21 00:12:26,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2021-11-21 00:12:26,727 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 356 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 3833 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 3864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:26,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [356 Valid, 107 Invalid, 3864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3833 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-21 00:12:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8986 states. [2021-11-21 00:12:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8986 to 5172. [2021-11-21 00:12:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5172 states, 5168 states have (on average 3.2016253869969042) internal successors, (16546), 5171 states have internal predecessors, (16546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:26,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5172 states to 5172 states and 16546 transitions. [2021-11-21 00:12:26,834 INFO L78 Accepts]: Start accepts. Automaton has 5172 states and 16546 transitions. Word has length 27 [2021-11-21 00:12:26,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:26,834 INFO L470 AbstractCegarLoop]: Abstraction has 5172 states and 16546 transitions. [2021-11-21 00:12:26,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:26,834 INFO L276 IsEmpty]: Start isEmpty. Operand 5172 states and 16546 transitions. [2021-11-21 00:12:26,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:26,839 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:26,839 INFO L514 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] [2021-11-21 00:12:26,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-21 00:12:26,840 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:26,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:26,840 INFO L85 PathProgramCache]: Analyzing trace with hash -984585469, now seen corresponding path program 11 times [2021-11-21 00:12:26,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:26,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072175662] [2021-11-21 00:12:26,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:26,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:27,363 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:27,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072175662] [2021-11-21 00:12:27,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072175662] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:27,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:27,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-21 00:12:27,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079183779] [2021-11-21 00:12:27,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:27,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-21 00:12:27,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:27,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-21 00:12:27,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-11-21 00:12:27,366 INFO L87 Difference]: Start difference. First operand 5172 states and 16546 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:29,410 INFO L93 Difference]: Finished difference Result 7408 states and 24085 transitions. [2021-11-21 00:12:29,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-21 00:12:29,411 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:29,424 INFO L225 Difference]: With dead ends: 7408 [2021-11-21 00:12:29,424 INFO L226 Difference]: Without dead ends: 7408 [2021-11-21 00:12:29,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2021-11-21 00:12:29,425 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 367 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 2860 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 2883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:29,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 108 Invalid, 2883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2860 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-21 00:12:29,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2021-11-21 00:12:29,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 6200. [2021-11-21 00:12:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6200 states, 6196 states have (on average 3.2270819883795996) internal successors, (19995), 6199 states have internal predecessors, (19995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6200 states to 6200 states and 19995 transitions. [2021-11-21 00:12:29,559 INFO L78 Accepts]: Start accepts. Automaton has 6200 states and 19995 transitions. Word has length 27 [2021-11-21 00:12:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:29,559 INFO L470 AbstractCegarLoop]: Abstraction has 6200 states and 19995 transitions. [2021-11-21 00:12:29,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 6200 states and 19995 transitions. [2021-11-21 00:12:29,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:29,566 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:29,567 INFO L514 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] [2021-11-21 00:12:29,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-21 00:12:29,567 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:29,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:29,568 INFO L85 PathProgramCache]: Analyzing trace with hash -984585468, now seen corresponding path program 6 times [2021-11-21 00:12:29,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:29,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834089884] [2021-11-21 00:12:29,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:29,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:30,304 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:30,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834089884] [2021-11-21 00:12:30,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834089884] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:30,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:30,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-21 00:12:30,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197473710] [2021-11-21 00:12:30,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:30,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-21 00:12:30,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:30,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-21 00:12:30,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-11-21 00:12:30,305 INFO L87 Difference]: Start difference. First operand 6200 states and 19995 transitions. Second operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:32,834 INFO L93 Difference]: Finished difference Result 7908 states and 25683 transitions. [2021-11-21 00:12:32,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-21 00:12:32,834 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:32,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:32,852 INFO L225 Difference]: With dead ends: 7908 [2021-11-21 00:12:32,852 INFO L226 Difference]: Without dead ends: 7908 [2021-11-21 00:12:32,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=202, Invalid=920, Unknown=0, NotChecked=0, Total=1122 [2021-11-21 00:12:32,853 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 349 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 3374 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 3403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 3374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:32,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 103 Invalid, 3403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 3374 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-21 00:12:32,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7908 states. [2021-11-21 00:12:32,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7908 to 6164. [2021-11-21 00:12:32,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6164 states, 6160 states have (on average 3.228409090909091) internal successors, (19887), 6163 states have internal predecessors, (19887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6164 states to 6164 states and 19887 transitions. [2021-11-21 00:12:33,013 INFO L78 Accepts]: Start accepts. Automaton has 6164 states and 19887 transitions. Word has length 27 [2021-11-21 00:12:33,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:33,013 INFO L470 AbstractCegarLoop]: Abstraction has 6164 states and 19887 transitions. [2021-11-21 00:12:33,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 6164 states and 19887 transitions. [2021-11-21 00:12:33,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:33,019 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:33,019 INFO L514 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] [2021-11-21 00:12:33,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-21 00:12:33,019 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:33,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:33,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2054080270, now seen corresponding path program 7 times [2021-11-21 00:12:33,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:33,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153970642] [2021-11-21 00:12:33,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:33,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:33,581 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:33,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153970642] [2021-11-21 00:12:33,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153970642] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:33,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:33,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-21 00:12:33,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920302765] [2021-11-21 00:12:33,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:33,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-21 00:12:33,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:33,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-21 00:12:33,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-11-21 00:12:33,583 INFO L87 Difference]: Start difference. First operand 6164 states and 19887 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:36,117 INFO L93 Difference]: Finished difference Result 8626 states and 28049 transitions. [2021-11-21 00:12:36,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-21 00:12:36,118 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:36,139 INFO L225 Difference]: With dead ends: 8626 [2021-11-21 00:12:36,139 INFO L226 Difference]: Without dead ends: 8626 [2021-11-21 00:12:36,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2021-11-21 00:12:36,140 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 415 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 3581 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 3581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:36,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [415 Valid, 98 Invalid, 3610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 3581 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-21 00:12:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8626 states. [2021-11-21 00:12:36,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8626 to 4812. [2021-11-21 00:12:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4808 states have (on average 3.216722129783694) internal successors, (15466), 4811 states have internal predecessors, (15466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 15466 transitions. [2021-11-21 00:12:36,252 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 15466 transitions. Word has length 27 [2021-11-21 00:12:36,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:36,252 INFO L470 AbstractCegarLoop]: Abstraction has 4812 states and 15466 transitions. [2021-11-21 00:12:36,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:36,252 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 15466 transitions. [2021-11-21 00:12:36,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:36,283 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:36,283 INFO L514 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] [2021-11-21 00:12:36,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-21 00:12:36,283 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:36,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:36,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1805307027, now seen corresponding path program 12 times [2021-11-21 00:12:36,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:36,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483412256] [2021-11-21 00:12:36,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:36,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:36,883 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:36,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483412256] [2021-11-21 00:12:36,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483412256] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:36,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:36,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-21 00:12:36,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660543433] [2021-11-21 00:12:36,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:36,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-21 00:12:36,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:36,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-21 00:12:36,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-11-21 00:12:36,885 INFO L87 Difference]: Start difference. First operand 4812 states and 15466 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:38,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:38,971 INFO L93 Difference]: Finished difference Result 6808 states and 22146 transitions. [2021-11-21 00:12:38,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-21 00:12:38,972 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:38,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:38,985 INFO L225 Difference]: With dead ends: 6808 [2021-11-21 00:12:38,985 INFO L226 Difference]: Without dead ends: 6808 [2021-11-21 00:12:38,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2021-11-21 00:12:38,986 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 358 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 2669 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:38,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 97 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2669 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-21 00:12:38,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6808 states. [2021-11-21 00:12:39,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6808 to 4692. [2021-11-21 00:12:39,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4692 states, 4688 states have (on average 3.2222696245733786) internal successors, (15106), 4691 states have internal predecessors, (15106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4692 states to 4692 states and 15106 transitions. [2021-11-21 00:12:39,116 INFO L78 Accepts]: Start accepts. Automaton has 4692 states and 15106 transitions. Word has length 27 [2021-11-21 00:12:39,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:39,116 INFO L470 AbstractCegarLoop]: Abstraction has 4692 states and 15106 transitions. [2021-11-21 00:12:39,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 4692 states and 15106 transitions. [2021-11-21 00:12:39,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:39,121 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:39,121 INFO L514 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] [2021-11-21 00:12:39,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-21 00:12:39,121 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:39,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:39,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1545076689, now seen corresponding path program 13 times [2021-11-21 00:12:39,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:39,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123853758] [2021-11-21 00:12:39,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:39,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:39,630 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:39,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123853758] [2021-11-21 00:12:39,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123853758] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:39,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:39,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-21 00:12:39,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148765474] [2021-11-21 00:12:39,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:39,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-21 00:12:39,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:39,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-21 00:12:39,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-11-21 00:12:39,631 INFO L87 Difference]: Start difference. First operand 4692 states and 15106 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:41,645 INFO L93 Difference]: Finished difference Result 6755 states and 22012 transitions. [2021-11-21 00:12:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-21 00:12:41,646 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:41,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:41,659 INFO L225 Difference]: With dead ends: 6755 [2021-11-21 00:12:41,659 INFO L226 Difference]: Without dead ends: 6755 [2021-11-21 00:12:41,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2021-11-21 00:12:41,661 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 389 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 2798 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:41,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 106 Invalid, 2828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2798 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-21 00:12:41,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6755 states. [2021-11-21 00:12:41,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6755 to 4573. [2021-11-21 00:12:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4573 states, 4569 states have (on average 3.2243379295250603) internal successors, (14732), 4572 states have internal predecessors, (14732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 14732 transitions. [2021-11-21 00:12:41,780 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 14732 transitions. Word has length 27 [2021-11-21 00:12:41,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:41,780 INFO L470 AbstractCegarLoop]: Abstraction has 4573 states and 14732 transitions. [2021-11-21 00:12:41,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 14732 transitions. [2021-11-21 00:12:41,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:41,783 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:41,784 INFO L514 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] [2021-11-21 00:12:41,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-21 00:12:41,784 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:41,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:41,785 INFO L85 PathProgramCache]: Analyzing trace with hash -7282017, now seen corresponding path program 4 times [2021-11-21 00:12:41,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:41,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735146657] [2021-11-21 00:12:41,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:41,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:42,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:42,234 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:42,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735146657] [2021-11-21 00:12:42,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735146657] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:42,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:42,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-21 00:12:42,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199312277] [2021-11-21 00:12:42,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:42,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 00:12:42,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:42,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 00:12:42,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-21 00:12:42,235 INFO L87 Difference]: Start difference. First operand 4573 states and 14732 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:43,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:43,764 INFO L93 Difference]: Finished difference Result 6833 states and 22272 transitions. [2021-11-21 00:12:43,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-21 00:12:43,765 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:43,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:43,779 INFO L225 Difference]: With dead ends: 6833 [2021-11-21 00:12:43,779 INFO L226 Difference]: Without dead ends: 6833 [2021-11-21 00:12:43,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2021-11-21 00:12:43,780 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 375 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 2199 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:43,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 82 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2199 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-21 00:12:43,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6833 states. [2021-11-21 00:12:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6833 to 5655. [2021-11-21 00:12:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5655 states, 5651 states have (on average 3.2459741638648025) internal successors, (18343), 5654 states have internal predecessors, (18343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5655 states to 5655 states and 18343 transitions. [2021-11-21 00:12:43,881 INFO L78 Accepts]: Start accepts. Automaton has 5655 states and 18343 transitions. Word has length 27 [2021-11-21 00:12:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:43,882 INFO L470 AbstractCegarLoop]: Abstraction has 5655 states and 18343 transitions. [2021-11-21 00:12:43,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 5655 states and 18343 transitions. [2021-11-21 00:12:43,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:43,887 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:43,887 INFO L514 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] [2021-11-21 00:12:43,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-21 00:12:43,887 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:43,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:43,888 INFO L85 PathProgramCache]: Analyzing trace with hash -7282016, now seen corresponding path program 2 times [2021-11-21 00:12:43,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:43,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849332697] [2021-11-21 00:12:43,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:43,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:44,293 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:44,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849332697] [2021-11-21 00:12:44,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849332697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:44,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:44,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-21 00:12:44,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893319865] [2021-11-21 00:12:44,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:44,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 00:12:44,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:44,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 00:12:44,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-21 00:12:44,294 INFO L87 Difference]: Start difference. First operand 5655 states and 18343 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:46,026 INFO L93 Difference]: Finished difference Result 6743 states and 21934 transitions. [2021-11-21 00:12:46,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-21 00:12:46,027 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:46,082 INFO L225 Difference]: With dead ends: 6743 [2021-11-21 00:12:46,082 INFO L226 Difference]: Without dead ends: 6743 [2021-11-21 00:12:46,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2021-11-21 00:12:46,083 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 341 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:46,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 94 Invalid, 2578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-21 00:12:46,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6743 states. [2021-11-21 00:12:46,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6743 to 4447. [2021-11-21 00:12:46,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4447 states, 4443 states have (on average 3.230699977492685) internal successors, (14354), 4446 states have internal predecessors, (14354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4447 states to 4447 states and 14354 transitions. [2021-11-21 00:12:46,162 INFO L78 Accepts]: Start accepts. Automaton has 4447 states and 14354 transitions. Word has length 27 [2021-11-21 00:12:46,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:46,162 INFO L470 AbstractCegarLoop]: Abstraction has 4447 states and 14354 transitions. [2021-11-21 00:12:46,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:46,162 INFO L276 IsEmpty]: Start isEmpty. Operand 4447 states and 14354 transitions. [2021-11-21 00:12:46,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:46,165 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:46,165 INFO L514 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] [2021-11-21 00:12:46,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-21 00:12:46,166 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:46,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:46,167 INFO L85 PathProgramCache]: Analyzing trace with hash 203654105, now seen corresponding path program 5 times [2021-11-21 00:12:46,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:46,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733147851] [2021-11-21 00:12:46,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:46,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:46,680 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:46,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733147851] [2021-11-21 00:12:46,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733147851] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:46,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:46,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-21 00:12:46,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083541283] [2021-11-21 00:12:46,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:46,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 00:12:46,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:46,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 00:12:46,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-21 00:12:46,682 INFO L87 Difference]: Start difference. First operand 4447 states and 14354 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:48,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:48,512 INFO L93 Difference]: Finished difference Result 6713 states and 21912 transitions. [2021-11-21 00:12:48,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-21 00:12:48,513 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:48,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:48,526 INFO L225 Difference]: With dead ends: 6713 [2021-11-21 00:12:48,526 INFO L226 Difference]: Without dead ends: 6713 [2021-11-21 00:12:48,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2021-11-21 00:12:48,527 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 326 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 2522 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 2543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:48,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 89 Invalid, 2543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2522 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-21 00:12:48,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6713 states. [2021-11-21 00:12:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6713 to 5415. [2021-11-21 00:12:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5415 states, 5411 states have (on average 3.256884124930697) internal successors, (17623), 5414 states have internal predecessors, (17623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5415 states to 5415 states and 17623 transitions. [2021-11-21 00:12:48,624 INFO L78 Accepts]: Start accepts. Automaton has 5415 states and 17623 transitions. Word has length 27 [2021-11-21 00:12:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:48,624 INFO L470 AbstractCegarLoop]: Abstraction has 5415 states and 17623 transitions. [2021-11-21 00:12:48,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 5415 states and 17623 transitions. [2021-11-21 00:12:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:48,629 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:48,629 INFO L514 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] [2021-11-21 00:12:48,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-21 00:12:48,629 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:48,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:48,629 INFO L85 PathProgramCache]: Analyzing trace with hash 203654106, now seen corresponding path program 3 times [2021-11-21 00:12:48,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:48,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843809954] [2021-11-21 00:12:48,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:48,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:49,081 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:49,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843809954] [2021-11-21 00:12:49,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843809954] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:49,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:49,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-21 00:12:49,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327346441] [2021-11-21 00:12:49,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:49,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 00:12:49,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:49,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 00:12:49,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-21 00:12:49,082 INFO L87 Difference]: Start difference. First operand 5415 states and 17623 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:50,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:50,826 INFO L93 Difference]: Finished difference Result 6623 states and 21574 transitions. [2021-11-21 00:12:50,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-21 00:12:50,826 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:50,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:50,839 INFO L225 Difference]: With dead ends: 6623 [2021-11-21 00:12:50,839 INFO L226 Difference]: Without dead ends: 6623 [2021-11-21 00:12:50,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2021-11-21 00:12:50,840 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 326 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 2532 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:50,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 90 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2532 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-21 00:12:50,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6623 states. [2021-11-21 00:12:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6623 to 4267. [2021-11-21 00:12:50,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4267 states, 4263 states have (on average 3.240441003987802) internal successors, (13814), 4266 states have internal predecessors, (13814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:50,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 13814 transitions. [2021-11-21 00:12:50,922 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 13814 transitions. Word has length 27 [2021-11-21 00:12:50,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:50,922 INFO L470 AbstractCegarLoop]: Abstraction has 4267 states and 13814 transitions. [2021-11-21 00:12:50,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 13814 transitions. [2021-11-21 00:12:50,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:50,926 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:50,926 INFO L514 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] [2021-11-21 00:12:50,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-21 00:12:50,926 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:50,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:50,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1755634015, now seen corresponding path program 6 times [2021-11-21 00:12:50,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:50,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906409736] [2021-11-21 00:12:50,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:50,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:51,394 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:51,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906409736] [2021-11-21 00:12:51,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906409736] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:51,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:51,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-21 00:12:51,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346909230] [2021-11-21 00:12:51,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:51,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 00:12:51,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:51,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 00:12:51,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-21 00:12:51,395 INFO L87 Difference]: Start difference. First operand 4267 states and 13814 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:53,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:53,521 INFO L93 Difference]: Finished difference Result 6764 states and 22286 transitions. [2021-11-21 00:12:53,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-21 00:12:53,522 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:53,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:53,535 INFO L225 Difference]: With dead ends: 6764 [2021-11-21 00:12:53,535 INFO L226 Difference]: Without dead ends: 6764 [2021-11-21 00:12:53,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2021-11-21 00:12:53,536 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 341 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 2709 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 2736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:53,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 97 Invalid, 2736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2709 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-21 00:12:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6764 states. [2021-11-21 00:12:53,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6764 to 5196. [2021-11-21 00:12:53,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5196 states, 5192 states have (on average 3.268297380585516) internal successors, (16969), 5195 states have internal predecessors, (16969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5196 states to 5196 states and 16969 transitions. [2021-11-21 00:12:53,624 INFO L78 Accepts]: Start accepts. Automaton has 5196 states and 16969 transitions. Word has length 27 [2021-11-21 00:12:53,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:53,624 INFO L470 AbstractCegarLoop]: Abstraction has 5196 states and 16969 transitions. [2021-11-21 00:12:53,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand 5196 states and 16969 transitions. [2021-11-21 00:12:53,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:53,628 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:53,628 INFO L514 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] [2021-11-21 00:12:53,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-21 00:12:53,628 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:53,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:53,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1755634016, now seen corresponding path program 4 times [2021-11-21 00:12:53,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:53,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125029636] [2021-11-21 00:12:53,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:53,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:54,012 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:54,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125029636] [2021-11-21 00:12:54,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125029636] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:54,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:54,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-21 00:12:54,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56183464] [2021-11-21 00:12:54,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:54,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 00:12:54,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:54,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 00:12:54,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-21 00:12:54,013 INFO L87 Difference]: Start difference. First operand 5196 states and 16969 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:55,680 INFO L93 Difference]: Finished difference Result 6764 states and 22147 transitions. [2021-11-21 00:12:55,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-21 00:12:55,680 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:55,693 INFO L225 Difference]: With dead ends: 6764 [2021-11-21 00:12:55,693 INFO L226 Difference]: Without dead ends: 6764 [2021-11-21 00:12:55,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2021-11-21 00:12:55,693 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 360 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 2396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:55,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 87 Invalid, 2396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-21 00:12:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6764 states. [2021-11-21 00:12:55,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6764 to 4287. [2021-11-21 00:12:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4287 states, 4283 states have (on average 3.240485640905907) internal successors, (13879), 4286 states have internal predecessors, (13879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 13879 transitions. [2021-11-21 00:12:55,781 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 13879 transitions. Word has length 27 [2021-11-21 00:12:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:55,782 INFO L470 AbstractCegarLoop]: Abstraction has 4287 states and 13879 transitions. [2021-11-21 00:12:55,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 13879 transitions. [2021-11-21 00:12:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:12:55,785 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:55,785 INFO L514 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] [2021-11-21 00:12:55,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-21 00:12:55,785 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:55,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:55,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1554442335, now seen corresponding path program 7 times [2021-11-21 00:12:55,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:55,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455183101] [2021-11-21 00:12:55,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:55,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:56,253 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:56,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455183101] [2021-11-21 00:12:56,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455183101] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:56,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:12:56,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-21 00:12:56,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901990164] [2021-11-21 00:12:56,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:56,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 00:12:56,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:12:56,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 00:12:56,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-21 00:12:56,255 INFO L87 Difference]: Start difference. First operand 4287 states and 13879 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:57,963 INFO L93 Difference]: Finished difference Result 6143 states and 20119 transitions. [2021-11-21 00:12:57,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-21 00:12:57,964 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 00:12:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:57,976 INFO L225 Difference]: With dead ends: 6143 [2021-11-21 00:12:57,976 INFO L226 Difference]: Without dead ends: 6143 [2021-11-21 00:12:57,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2021-11-21 00:12:57,976 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 335 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 2574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:57,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 91 Invalid, 2574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2547 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-21 00:12:57,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2021-11-21 00:12:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 4087. [2021-11-21 00:12:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4087 states, 4083 states have (on average 3.247367132010776) internal successors, (13259), 4086 states have internal predecessors, (13259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4087 states to 4087 states and 13259 transitions. [2021-11-21 00:12:58,052 INFO L78 Accepts]: Start accepts. Automaton has 4087 states and 13259 transitions. Word has length 27 [2021-11-21 00:12:58,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:58,052 INFO L470 AbstractCegarLoop]: Abstraction has 4087 states and 13259 transitions. [2021-11-21 00:12:58,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:12:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4087 states and 13259 transitions. [2021-11-21 00:12:58,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-21 00:12:58,055 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:58,055 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-21 00:12:58,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-21 00:12:58,055 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:12:58,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:58,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1460019004, now seen corresponding path program 1 times [2021-11-21 00:12:58,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:12:58,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987904961] [2021-11-21 00:12:58,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:58,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:12:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:58,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:58,746 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:12:58,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987904961] [2021-11-21 00:12:58,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987904961] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:12:58,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272989148] [2021-11-21 00:12:58,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:58,747 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:12:58,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:12:58,752 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:12:58,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-21 00:12:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:58,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 71 conjunts are in the unsatisfiable core [2021-11-21 00:12:58,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:12:58,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:12:59,026 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-21 00:12:59,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 35 [2021-11-21 00:12:59,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2021-11-21 00:12:59,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:12:59,192 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-21 00:12:59,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2021-11-21 00:12:59,574 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:12:59,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:12:59,593 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-21 00:12:59,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 41 [2021-11-21 00:12:59,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:12:59,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:12:59,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:12:59,699 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:12:59,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 105 [2021-11-21 00:12:59,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:12:59,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:12:59,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:12:59,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2021-11-21 00:12:59,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:12:59,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:12:59,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:12:59,791 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:12:59,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 42 [2021-11-21 00:13:00,662 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-11-21 00:13:00,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 49 [2021-11-21 00:13:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:13:00,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:13:47,126 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_~x#1_110| Int)) (or (and (forall ((|v_ULTIMATE.start_main_#t~pre32#1_91| Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| Int) (|ULTIMATE.start_main_~#writer~0#1.offset| Int)) (let ((.cse4 (+ |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| 1))) (let ((.cse3 (mod .cse4 4))) (or (<= (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (store (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base|) |ULTIMATE.start_main_~#writer~0#1.offset| |v_ULTIMATE.start_main_#t~pre32#1_91|)) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) |v_writer_fnThread1of1ForFork0_ring_enqueue_~x#1_110|)) .cse2 .cse3)))) (select .cse0 (+ (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4))) 8) (and (< .cse4 0) (not (= .cse3 0))))))) (forall ((|v_ULTIMATE.start_main_#t~pre32#1_91| Int) (|aux_mod_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_66| Int) (|ULTIMATE.start_main_~#writer~0#1.offset| Int)) (or (= |aux_mod_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_66| 0) (<= 4 |aux_mod_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_66|) (<= (let ((.cse5 (let ((.cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (store (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base|) |ULTIMATE.start_main_~#writer~0#1.offset| |v_ULTIMATE.start_main_#t~pre32#1_91|)) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse6 (+ (* (select .cse6 .cse7) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) |v_writer_fnThread1of1ForFork0_ring_enqueue_~x#1_110|)) .cse7 (+ (- 4) (mod |aux_mod_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_66| 4)))))) (select .cse5 (+ (* (select .cse5 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4))) 8) (< |aux_mod_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_66| 0)))) (< 1 |v_writer_fnThread1of1ForFork0_ring_enqueue_~x#1_110|))) is different from false [2021-11-21 00:13:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:13:47,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272989148] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:13:47,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [615653501] [2021-11-21 00:13:47,138 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-21 00:13:47,141 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:13:47,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 42 [2021-11-21 00:13:47,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214154488] [2021-11-21 00:13:47,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:13:47,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-21 00:13:47,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:13:47,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-21 00:13:47,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1656, Unknown=13, NotChecked=82, Total=1892 [2021-11-21 00:13:47,144 INFO L87 Difference]: Start difference. First operand 4087 states and 13259 transitions. Second operand has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:13:54,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:13:54,244 INFO L93 Difference]: Finished difference Result 7929 states and 25978 transitions. [2021-11-21 00:13:54,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-21 00:13:54,244 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-21 00:13:54,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:13:54,259 INFO L225 Difference]: With dead ends: 7929 [2021-11-21 00:13:54,259 INFO L226 Difference]: Without dead ends: 7929 [2021-11-21 00:13:54,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 48.6s TimeCoverageRelationStatistics Valid=477, Invalid=3296, Unknown=13, NotChecked=120, Total=3906 [2021-11-21 00:13:54,264 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 743 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 5153 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 6557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 5153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1356 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-11-21 00:13:54,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [743 Valid, 237 Invalid, 6557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 5153 Invalid, 0 Unknown, 1356 Unchecked, 3.7s Time] [2021-11-21 00:13:54,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7929 states. [2021-11-21 00:13:54,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7929 to 4154. [2021-11-21 00:13:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4154 states, 4150 states have (on average 3.249156626506024) internal successors, (13484), 4153 states have internal predecessors, (13484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:13:54,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4154 states to 4154 states and 13484 transitions. [2021-11-21 00:13:54,353 INFO L78 Accepts]: Start accepts. Automaton has 4154 states and 13484 transitions. Word has length 29 [2021-11-21 00:13:54,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:13:54,353 INFO L470 AbstractCegarLoop]: Abstraction has 4154 states and 13484 transitions. [2021-11-21 00:13:54,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:13:54,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4154 states and 13484 transitions. [2021-11-21 00:13:54,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-21 00:13:54,357 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:13:54,357 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-21 00:13:54,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-21 00:13:54,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:13:54,557 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:13:54,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:13:54,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1353625980, now seen corresponding path program 1 times [2021-11-21 00:13:54,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:13:54,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799142875] [2021-11-21 00:13:54,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:13:54,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:13:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:13:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:13:55,129 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:13:55,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799142875] [2021-11-21 00:13:55,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799142875] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:13:55,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470480255] [2021-11-21 00:13:55,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:13:55,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:13:55,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:13:55,130 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:13:55,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-21 00:13:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:13:55,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 86 conjunts are in the unsatisfiable core [2021-11-21 00:13:55,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:13:55,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:13:55,255 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-21 00:13:55,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 35 [2021-11-21 00:13:55,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2021-11-21 00:13:55,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:13:55,384 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-21 00:13:55,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2021-11-21 00:13:55,711 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:13:55,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:13:55,724 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-21 00:13:55,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 41 [2021-11-21 00:13:55,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:13:55,855 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-21 00:13:55,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 45 [2021-11-21 00:13:56,196 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-11-21 00:13:56,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 23 [2021-11-21 00:13:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:13:56,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:14:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:14:33,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470480255] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:14:33,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1567613835] [2021-11-21 00:14:33,968 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-21 00:14:33,970 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:14:33,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2021-11-21 00:14:33,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711554446] [2021-11-21 00:14:33,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:14:33,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-21 00:14:33,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:14:33,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-21 00:14:33,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1987, Unknown=5, NotChecked=0, Total=2162 [2021-11-21 00:14:33,972 INFO L87 Difference]: Start difference. First operand 4154 states and 13484 transitions. Second operand has 47 states, 46 states have (on average 1.891304347826087) internal successors, (87), 46 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:14:59,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:14:59,143 INFO L93 Difference]: Finished difference Result 8049 states and 26565 transitions. [2021-11-21 00:14:59,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-21 00:14:59,144 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.891304347826087) internal successors, (87), 46 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-21 00:14:59,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:14:59,160 INFO L225 Difference]: With dead ends: 8049 [2021-11-21 00:14:59,160 INFO L226 Difference]: Without dead ends: 8049 [2021-11-21 00:14:59,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1467 ImplicationChecksByTransitivity, 47.7s TimeCoverageRelationStatistics Valid=1010, Invalid=6125, Unknown=5, NotChecked=0, Total=7140 [2021-11-21 00:14:59,161 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 1037 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 8598 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 9819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 8598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1149 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:14:59,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1037 Valid, 321 Invalid, 9819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 8598 Invalid, 0 Unknown, 1149 Unchecked, 10.2s Time] [2021-11-21 00:14:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8049 states. [2021-11-21 00:14:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8049 to 4152. [2021-11-21 00:14:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4152 states, 4148 states have (on average 3.247830279652845) internal successors, (13472), 4151 states have internal predecessors, (13472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:14:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 13472 transitions. [2021-11-21 00:14:59,259 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 13472 transitions. Word has length 29 [2021-11-21 00:14:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:14:59,260 INFO L470 AbstractCegarLoop]: Abstraction has 4152 states and 13472 transitions. [2021-11-21 00:14:59,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.891304347826087) internal successors, (87), 46 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:14:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 13472 transitions. [2021-11-21 00:14:59,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-21 00:14:59,263 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:14:59,263 INFO L514 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] [2021-11-21 00:14:59,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-21 00:14:59,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:14:59,464 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:14:59,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:14:59,465 INFO L85 PathProgramCache]: Analyzing trace with hash -880818359, now seen corresponding path program 1 times [2021-11-21 00:14:59,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:14:59,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568559575] [2021-11-21 00:14:59,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:14:59,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:14:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:14:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:14:59,891 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:14:59,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568559575] [2021-11-21 00:14:59,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568559575] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:14:59,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:14:59,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-21 00:14:59,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411008473] [2021-11-21 00:14:59,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:14:59,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-21 00:14:59,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:14:59,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-21 00:14:59,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-21 00:14:59,892 INFO L87 Difference]: Start difference. First operand 4152 states and 13472 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:15:01,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:15:01,376 INFO L93 Difference]: Finished difference Result 10519 states and 34594 transitions. [2021-11-21 00:15:01,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-21 00:15:01,377 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-21 00:15:01,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:15:01,402 INFO L225 Difference]: With dead ends: 10519 [2021-11-21 00:15:01,402 INFO L226 Difference]: Without dead ends: 10519 [2021-11-21 00:15:01,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2021-11-21 00:15:01,403 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 628 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-21 00:15:01,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 28 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-21 00:15:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10519 states. [2021-11-21 00:15:01,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10519 to 8715. [2021-11-21 00:15:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8715 states, 8711 states have (on average 3.334749167718976) internal successors, (29049), 8714 states have internal predecessors, (29049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:15:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8715 states to 8715 states and 29049 transitions. [2021-11-21 00:15:01,588 INFO L78 Accepts]: Start accepts. Automaton has 8715 states and 29049 transitions. Word has length 30 [2021-11-21 00:15:01,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:15:01,588 INFO L470 AbstractCegarLoop]: Abstraction has 8715 states and 29049 transitions. [2021-11-21 00:15:01,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:15:01,588 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 29049 transitions. [2021-11-21 00:15:01,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-21 00:15:01,596 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:15:01,596 INFO L514 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] [2021-11-21 00:15:01,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-11-21 00:15:01,596 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:15:01,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:15:01,597 INFO L85 PathProgramCache]: Analyzing trace with hash 923524347, now seen corresponding path program 1 times [2021-11-21 00:15:01,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:15:01,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015363201] [2021-11-21 00:15:01,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:15:01,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:15:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:15:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:15:01,999 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:15:01,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015363201] [2021-11-21 00:15:01,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015363201] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:15:01,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:15:01,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-21 00:15:02,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168783810] [2021-11-21 00:15:02,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:15:02,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-21 00:15:02,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:15:02,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-21 00:15:02,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-21 00:15:02,001 INFO L87 Difference]: Start difference. First operand 8715 states and 29049 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:15:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:15:03,580 INFO L93 Difference]: Finished difference Result 14946 states and 49474 transitions. [2021-11-21 00:15:03,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-21 00:15:03,581 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-21 00:15:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:15:03,615 INFO L225 Difference]: With dead ends: 14946 [2021-11-21 00:15:03,616 INFO L226 Difference]: Without dead ends: 14946 [2021-11-21 00:15:03,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2021-11-21 00:15:03,616 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 542 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-21 00:15:03,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [542 Valid, 25 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-21 00:15:03,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14946 states. [2021-11-21 00:15:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14946 to 11277. [2021-11-21 00:15:03,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11277 states, 11273 states have (on average 3.354564002483811) internal successors, (37816), 11276 states have internal predecessors, (37816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:15:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11277 states to 11277 states and 37816 transitions. [2021-11-21 00:15:03,874 INFO L78 Accepts]: Start accepts. Automaton has 11277 states and 37816 transitions. Word has length 30 [2021-11-21 00:15:03,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:15:03,874 INFO L470 AbstractCegarLoop]: Abstraction has 11277 states and 37816 transitions. [2021-11-21 00:15:03,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:15:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand 11277 states and 37816 transitions. [2021-11-21 00:15:03,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-21 00:15:03,885 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:15:03,885 INFO L514 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] [2021-11-21 00:15:03,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-11-21 00:15:03,885 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:15:03,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:15:03,886 INFO L85 PathProgramCache]: Analyzing trace with hash 243179205, now seen corresponding path program 2 times [2021-11-21 00:15:03,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:15:03,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277032153] [2021-11-21 00:15:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:15:03,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:15:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:15:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:15:04,202 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:15:04,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277032153] [2021-11-21 00:15:04,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277032153] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:15:04,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:15:04,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-21 00:15:04,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698992701] [2021-11-21 00:15:04,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:15:04,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-21 00:15:04,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:15:04,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-21 00:15:04,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-21 00:15:04,203 INFO L87 Difference]: Start difference. First operand 11277 states and 37816 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:15:05,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:15:05,602 INFO L93 Difference]: Finished difference Result 19494 states and 64893 transitions. [2021-11-21 00:15:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-21 00:15:05,603 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-21 00:15:05,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:15:05,654 INFO L225 Difference]: With dead ends: 19494 [2021-11-21 00:15:05,654 INFO L226 Difference]: Without dead ends: 19494 [2021-11-21 00:15:05,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2021-11-21 00:15:05,655 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 594 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-21 00:15:05,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [594 Valid, 48 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-21 00:15:05,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19494 states. [2021-11-21 00:15:05,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19494 to 12077. [2021-11-21 00:15:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12077 states, 12073 states have (on average 3.3488776608962145) internal successors, (40431), 12076 states have internal predecessors, (40431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:15:06,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12077 states to 12077 states and 40431 transitions. [2021-11-21 00:15:06,115 INFO L78 Accepts]: Start accepts. Automaton has 12077 states and 40431 transitions. Word has length 30 [2021-11-21 00:15:06,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:15:06,115 INFO L470 AbstractCegarLoop]: Abstraction has 12077 states and 40431 transitions. [2021-11-21 00:15:06,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:15:06,115 INFO L276 IsEmpty]: Start isEmpty. Operand 12077 states and 40431 transitions. [2021-11-21 00:15:06,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-21 00:15:06,129 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:15:06,130 INFO L514 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] [2021-11-21 00:15:06,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-11-21 00:15:06,130 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:15:06,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:15:06,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2048886113, now seen corresponding path program 3 times [2021-11-21 00:15:06,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:15:06,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700447383] [2021-11-21 00:15:06,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:15:06,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:15:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:15:06,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:15:06,482 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:15:06,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700447383] [2021-11-21 00:15:06,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700447383] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:15:06,482 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:15:06,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-21 00:15:06,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460941831] [2021-11-21 00:15:06,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:15:06,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-21 00:15:06,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:15:06,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-21 00:15:06,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-21 00:15:06,484 INFO L87 Difference]: Start difference. First operand 12077 states and 40431 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:15:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:15:08,283 INFO L93 Difference]: Finished difference Result 21864 states and 73122 transitions. [2021-11-21 00:15:08,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-21 00:15:08,284 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-21 00:15:08,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:15:08,338 INFO L225 Difference]: With dead ends: 21864 [2021-11-21 00:15:08,338 INFO L226 Difference]: Without dead ends: 21864 [2021-11-21 00:15:08,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=275, Invalid=717, Unknown=0, NotChecked=0, Total=992 [2021-11-21 00:15:08,338 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 795 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:15:08,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [795 Valid, 74 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-21 00:15:08,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21864 states. [2021-11-21 00:15:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21864 to 12505. [2021-11-21 00:15:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12505 states, 12501 states have (on average 3.370290376769858) internal successors, (42132), 12504 states have internal predecessors, (42132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:15:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12505 states to 12505 states and 42132 transitions. [2021-11-21 00:15:08,786 INFO L78 Accepts]: Start accepts. Automaton has 12505 states and 42132 transitions. Word has length 30 [2021-11-21 00:15:08,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:15:08,787 INFO L470 AbstractCegarLoop]: Abstraction has 12505 states and 42132 transitions. [2021-11-21 00:15:08,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:15:08,787 INFO L276 IsEmpty]: Start isEmpty. Operand 12505 states and 42132 transitions. [2021-11-21 00:15:08,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-21 00:15:08,800 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:15:08,800 INFO L514 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] [2021-11-21 00:15:08,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-11-21 00:15:08,800 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:15:08,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:15:08,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1454083157, now seen corresponding path program 4 times [2021-11-21 00:15:08,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:15:08,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663564503] [2021-11-21 00:15:08,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:15:08,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:15:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:15:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:15:09,101 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:15:09,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663564503] [2021-11-21 00:15:09,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663564503] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:15:09,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:15:09,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-21 00:15:09,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525799012] [2021-11-21 00:15:09,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:15:09,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-21 00:15:09,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:15:09,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-21 00:15:09,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-21 00:15:09,102 INFO L87 Difference]: Start difference. First operand 12505 states and 42132 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:15:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:15:11,252 INFO L93 Difference]: Finished difference Result 21939 states and 73769 transitions. [2021-11-21 00:15:11,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-21 00:15:11,252 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-21 00:15:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:15:11,312 INFO L225 Difference]: With dead ends: 21939 [2021-11-21 00:15:11,312 INFO L226 Difference]: Without dead ends: 21939 [2021-11-21 00:15:11,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=319, Invalid=871, Unknown=0, NotChecked=0, Total=1190 [2021-11-21 00:15:11,313 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 653 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:15:11,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [653 Valid, 110 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1660 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-21 00:15:11,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21939 states. [2021-11-21 00:15:11,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21939 to 10624. [2021-11-21 00:15:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10624 states, 10620 states have (on average 3.369774011299435) internal successors, (35787), 10623 states have internal predecessors, (35787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:15:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10624 states to 10624 states and 35787 transitions. [2021-11-21 00:15:11,596 INFO L78 Accepts]: Start accepts. Automaton has 10624 states and 35787 transitions. Word has length 30 [2021-11-21 00:15:11,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:15:11,596 INFO L470 AbstractCegarLoop]: Abstraction has 10624 states and 35787 transitions. [2021-11-21 00:15:11,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:15:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 10624 states and 35787 transitions. [2021-11-21 00:15:11,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-21 00:15:11,606 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:15:11,606 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-21 00:15:11,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-11-21 00:15:11,607 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:15:11,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:15:11,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1709526133, now seen corresponding path program 1 times [2021-11-21 00:15:11,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:15:11,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944754646] [2021-11-21 00:15:11,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:15:11,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:15:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:15:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:15:12,241 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:15:12,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944754646] [2021-11-21 00:15:12,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944754646] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:15:12,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11267222] [2021-11-21 00:15:12,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:15:12,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:15:12,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:15:12,242 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:15:12,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-21 00:15:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:15:12,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 71 conjunts are in the unsatisfiable core [2021-11-21 00:15:12,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:15:12,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:15:12,356 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-21 00:15:12,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 35 [2021-11-21 00:15:12,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2021-11-21 00:15:12,411 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-11-21 00:15:12,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2021-11-21 00:15:12,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:15:12,639 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-21 00:15:12,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 41 [2021-11-21 00:15:12,734 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:15:12,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 97 [2021-11-21 00:15:12,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2021-11-21 00:15:12,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2021-11-21 00:15:13,446 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-11-21 00:15:13,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 49 [2021-11-21 00:15:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:15:13,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:16:25,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:16:25,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11267222] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:16:25,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2020699149] [2021-11-21 00:16:25,329 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-21 00:16:25,330 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:16:25,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 37 [2021-11-21 00:16:25,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941976353] [2021-11-21 00:16:25,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:16:25,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-21 00:16:25,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:16:25,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-21 00:16:25,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1348, Unknown=16, NotChecked=0, Total=1482 [2021-11-21 00:16:25,331 INFO L87 Difference]: Start difference. First operand 10624 states and 35787 transitions. Second operand has 39 states, 38 states have (on average 2.263157894736842) internal successors, (86), 38 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:16:30,477 INFO L93 Difference]: Finished difference Result 15237 states and 51085 transitions. [2021-11-21 00:16:30,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-21 00:16:30,477 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.263157894736842) internal successors, (86), 38 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-21 00:16:30,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:16:30,512 INFO L225 Difference]: With dead ends: 15237 [2021-11-21 00:16:30,512 INFO L226 Difference]: Without dead ends: 15237 [2021-11-21 00:16:30,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 73.5s TimeCoverageRelationStatistics Valid=360, Invalid=2704, Unknown=16, NotChecked=0, Total=3080 [2021-11-21 00:16:30,513 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 776 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 3205 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 4846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1590 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:16:30,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [776 Valid, 182 Invalid, 4846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3205 Invalid, 0 Unknown, 1590 Unchecked, 2.3s Time] [2021-11-21 00:16:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15237 states. [2021-11-21 00:16:30,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15237 to 10612. [2021-11-21 00:16:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10612 states, 10608 states have (on average 3.3700037707390647) internal successors, (35749), 10611 states have internal predecessors, (35749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:30,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10612 states to 10612 states and 35749 transitions. [2021-11-21 00:16:30,772 INFO L78 Accepts]: Start accepts. Automaton has 10612 states and 35749 transitions. Word has length 30 [2021-11-21 00:16:30,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:16:30,773 INFO L470 AbstractCegarLoop]: Abstraction has 10612 states and 35749 transitions. [2021-11-21 00:16:30,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.263157894736842) internal successors, (86), 38 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 10612 states and 35749 transitions. [2021-11-21 00:16:30,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-21 00:16:30,784 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:16:30,784 INFO L514 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] [2021-11-21 00:16:30,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-21 00:16:30,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:16:30,985 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:16:30,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:16:30,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2104723087, now seen corresponding path program 2 times [2021-11-21 00:16:30,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:16:30,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872464749] [2021-11-21 00:16:30,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:16:30,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:16:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:16:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:16:31,316 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:16:31,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872464749] [2021-11-21 00:16:31,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872464749] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:16:31,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:16:31,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-21 00:16:31,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266726608] [2021-11-21 00:16:31,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:16:31,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-21 00:16:31,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:16:31,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-21 00:16:31,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-21 00:16:31,317 INFO L87 Difference]: Start difference. First operand 10612 states and 35749 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:16:32,978 INFO L93 Difference]: Finished difference Result 18815 states and 62593 transitions. [2021-11-21 00:16:32,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-21 00:16:32,979 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-21 00:16:32,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:16:33,026 INFO L225 Difference]: With dead ends: 18815 [2021-11-21 00:16:33,026 INFO L226 Difference]: Without dead ends: 18815 [2021-11-21 00:16:33,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2021-11-21 00:16:33,027 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 557 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:16:33,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [557 Valid, 53 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-21 00:16:33,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18815 states. [2021-11-21 00:16:33,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18815 to 10798. [2021-11-21 00:16:33,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10798 states, 10794 states have (on average 3.374467296646285) internal successors, (36424), 10797 states have internal predecessors, (36424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10798 states to 10798 states and 36424 transitions. [2021-11-21 00:16:33,258 INFO L78 Accepts]: Start accepts. Automaton has 10798 states and 36424 transitions. Word has length 30 [2021-11-21 00:16:33,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:16:33,259 INFO L470 AbstractCegarLoop]: Abstraction has 10798 states and 36424 transitions. [2021-11-21 00:16:33,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:33,259 INFO L276 IsEmpty]: Start isEmpty. Operand 10798 states and 36424 transitions. [2021-11-21 00:16:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-21 00:16:33,268 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:16:33,268 INFO L514 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] [2021-11-21 00:16:33,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-11-21 00:16:33,269 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:16:33,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:16:33,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1729387755, now seen corresponding path program 3 times [2021-11-21 00:16:33,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:16:33,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014343656] [2021-11-21 00:16:33,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:16:33,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:16:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:16:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:16:33,529 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:16:33,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014343656] [2021-11-21 00:16:33,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014343656] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:16:33,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:16:33,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-21 00:16:33,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489916564] [2021-11-21 00:16:33,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:16:33,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-21 00:16:33,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:16:33,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-21 00:16:33,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-21 00:16:33,531 INFO L87 Difference]: Start difference. First operand 10798 states and 36424 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:35,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:16:35,587 INFO L93 Difference]: Finished difference Result 19612 states and 65806 transitions. [2021-11-21 00:16:35,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-21 00:16:35,587 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-21 00:16:35,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:16:35,641 INFO L225 Difference]: With dead ends: 19612 [2021-11-21 00:16:35,641 INFO L226 Difference]: Without dead ends: 19612 [2021-11-21 00:16:35,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2021-11-21 00:16:35,642 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 451 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:16:35,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 85 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-21 00:16:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19612 states. [2021-11-21 00:16:35,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19612 to 9885. [2021-11-21 00:16:36,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9885 states, 9881 states have (on average 3.390851128428297) internal successors, (33505), 9884 states have internal predecessors, (33505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9885 states to 9885 states and 33505 transitions. [2021-11-21 00:16:36,034 INFO L78 Accepts]: Start accepts. Automaton has 9885 states and 33505 transitions. Word has length 30 [2021-11-21 00:16:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:16:36,035 INFO L470 AbstractCegarLoop]: Abstraction has 9885 states and 33505 transitions. [2021-11-21 00:16:36,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 9885 states and 33505 transitions. [2021-11-21 00:16:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-21 00:16:36,045 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:16:36,045 INFO L514 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] [2021-11-21 00:16:36,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-11-21 00:16:36,046 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:16:36,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:16:36,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1119364937, now seen corresponding path program 1 times [2021-11-21 00:16:36,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:16:36,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065616979] [2021-11-21 00:16:36,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:16:36,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:16:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:16:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:16:36,072 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:16:36,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065616979] [2021-11-21 00:16:36,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065616979] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:16:36,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:16:36,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-21 00:16:36,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284514277] [2021-11-21 00:16:36,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:16:36,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:16:36,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:16:36,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:16:36,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:16:36,074 INFO L87 Difference]: Start difference. First operand 9885 states and 33505 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:36,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:16:36,209 INFO L93 Difference]: Finished difference Result 4486 states and 13528 transitions. [2021-11-21 00:16:36,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:16:36,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-21 00:16:36,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:16:36,221 INFO L225 Difference]: With dead ends: 4486 [2021-11-21 00:16:36,221 INFO L226 Difference]: Without dead ends: 4486 [2021-11-21 00:16:36,221 INFO L932 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 [2021-11-21 00:16:36,223 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:16:36,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 30 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:16:36,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2021-11-21 00:16:36,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 3798. [2021-11-21 00:16:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3798 states, 3794 states have (on average 2.9667896678966788) internal successors, (11256), 3797 states have internal predecessors, (11256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:36,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3798 states to 3798 states and 11256 transitions. [2021-11-21 00:16:36,317 INFO L78 Accepts]: Start accepts. Automaton has 3798 states and 11256 transitions. Word has length 31 [2021-11-21 00:16:36,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:16:36,318 INFO L470 AbstractCegarLoop]: Abstraction has 3798 states and 11256 transitions. [2021-11-21 00:16:36,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:36,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3798 states and 11256 transitions. [2021-11-21 00:16:36,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:16:36,323 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:16:36,323 INFO L514 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] [2021-11-21 00:16:36,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-11-21 00:16:36,323 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:16:36,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:16:36,324 INFO L85 PathProgramCache]: Analyzing trace with hash -357961174, now seen corresponding path program 1 times [2021-11-21 00:16:36,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:16:36,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613942116] [2021-11-21 00:16:36,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:16:36,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:16:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:16:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:16:37,540 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:16:37,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613942116] [2021-11-21 00:16:37,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613942116] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:16:37,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:16:37,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-21 00:16:37,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201381282] [2021-11-21 00:16:37,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:16:37,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-21 00:16:37,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:16:37,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-21 00:16:37,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2021-11-21 00:16:37,541 INFO L87 Difference]: Start difference. First operand 3798 states and 11256 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:42,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:16:42,209 INFO L93 Difference]: Finished difference Result 4393 states and 12939 transitions. [2021-11-21 00:16:42,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-21 00:16:42,210 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:16:42,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:16:42,217 INFO L225 Difference]: With dead ends: 4393 [2021-11-21 00:16:42,217 INFO L226 Difference]: Without dead ends: 4393 [2021-11-21 00:16:42,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=198, Invalid=1362, Unknown=0, NotChecked=0, Total=1560 [2021-11-21 00:16:42,218 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 333 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 4930 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 4968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 4930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:16:42,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 32 Invalid, 4968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 4930 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2021-11-21 00:16:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2021-11-21 00:16:42,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 4255. [2021-11-21 00:16:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4255 states, 4251 states have (on average 2.963067513526229) internal successors, (12596), 4254 states have internal predecessors, (12596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:42,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 12596 transitions. [2021-11-21 00:16:42,292 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 12596 transitions. Word has length 32 [2021-11-21 00:16:42,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:16:42,292 INFO L470 AbstractCegarLoop]: Abstraction has 4255 states and 12596 transitions. [2021-11-21 00:16:42,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:42,292 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 12596 transitions. [2021-11-21 00:16:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:16:42,296 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:16:42,296 INFO L514 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] [2021-11-21 00:16:42,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-11-21 00:16:42,296 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:16:42,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:16:42,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1551408292, now seen corresponding path program 1 times [2021-11-21 00:16:42,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:16:42,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504386012] [2021-11-21 00:16:42,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:16:42,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:16:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:16:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:16:43,631 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:16:43,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504386012] [2021-11-21 00:16:43,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504386012] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:16:43,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:16:43,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-21 00:16:43,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352239578] [2021-11-21 00:16:43,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:16:43,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-21 00:16:43,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:16:43,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-21 00:16:43,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2021-11-21 00:16:43,632 INFO L87 Difference]: Start difference. First operand 4255 states and 12596 transitions. Second operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:47,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:16:47,673 INFO L93 Difference]: Finished difference Result 4836 states and 14239 transitions. [2021-11-21 00:16:47,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-21 00:16:47,673 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:16:47,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:16:47,681 INFO L225 Difference]: With dead ends: 4836 [2021-11-21 00:16:47,681 INFO L226 Difference]: Without dead ends: 4836 [2021-11-21 00:16:47,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=176, Invalid=1230, Unknown=0, NotChecked=0, Total=1406 [2021-11-21 00:16:47,682 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 311 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 4535 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 4568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-21 00:16:47,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 33 Invalid, 4568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4535 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-11-21 00:16:47,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4836 states. [2021-11-21 00:16:47,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4836 to 4552. [2021-11-21 00:16:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4552 states, 4548 states have (on average 2.9650395778364116) internal successors, (13485), 4551 states have internal predecessors, (13485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 13485 transitions. [2021-11-21 00:16:47,755 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 13485 transitions. Word has length 32 [2021-11-21 00:16:47,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:16:47,755 INFO L470 AbstractCegarLoop]: Abstraction has 4552 states and 13485 transitions. [2021-11-21 00:16:47,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 13485 transitions. [2021-11-21 00:16:47,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:16:47,761 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:16:47,761 INFO L514 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] [2021-11-21 00:16:47,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-11-21 00:16:47,761 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:16:47,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:16:47,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1104452150, now seen corresponding path program 2 times [2021-11-21 00:16:47,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:16:47,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133249720] [2021-11-21 00:16:47,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:16:47,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:16:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:16:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:16:48,913 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:16:48,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133249720] [2021-11-21 00:16:48,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133249720] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:16:48,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:16:48,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-21 00:16:48,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272048720] [2021-11-21 00:16:48,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:16:48,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-21 00:16:48,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:16:48,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-21 00:16:48,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2021-11-21 00:16:48,914 INFO L87 Difference]: Start difference. First operand 4552 states and 13485 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:53,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:16:53,653 INFO L93 Difference]: Finished difference Result 5898 states and 17277 transitions. [2021-11-21 00:16:53,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-21 00:16:53,653 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:16:53,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:16:53,663 INFO L225 Difference]: With dead ends: 5898 [2021-11-21 00:16:53,663 INFO L226 Difference]: Without dead ends: 5898 [2021-11-21 00:16:53,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=198, Invalid=1362, Unknown=0, NotChecked=0, Total=1560 [2021-11-21 00:16:53,664 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 385 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 5026 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 5026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-21 00:16:53,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 65 Invalid, 5059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 5026 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-11-21 00:16:53,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5898 states. [2021-11-21 00:16:53,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5898 to 4600. [2021-11-21 00:16:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4600 states, 4596 states have (on average 2.965404699738903) internal successors, (13629), 4599 states have internal predecessors, (13629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 13629 transitions. [2021-11-21 00:16:53,750 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 13629 transitions. Word has length 32 [2021-11-21 00:16:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:16:53,750 INFO L470 AbstractCegarLoop]: Abstraction has 4600 states and 13629 transitions. [2021-11-21 00:16:53,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 13629 transitions. [2021-11-21 00:16:53,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:16:53,755 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:16:53,755 INFO L514 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] [2021-11-21 00:16:53,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-11-21 00:16:53,755 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:16:53,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:16:53,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1341451406, now seen corresponding path program 3 times [2021-11-21 00:16:53,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:16:53,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675179534] [2021-11-21 00:16:53,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:16:53,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:16:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:16:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:16:55,003 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:16:55,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675179534] [2021-11-21 00:16:55,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675179534] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:16:55,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:16:55,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-21 00:16:55,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056943021] [2021-11-21 00:16:55,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:16:55,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-21 00:16:55,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:16:55,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-21 00:16:55,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2021-11-21 00:16:55,004 INFO L87 Difference]: Start difference. First operand 4600 states and 13629 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:59,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:16:59,751 INFO L93 Difference]: Finished difference Result 5858 states and 17181 transitions. [2021-11-21 00:16:59,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-21 00:16:59,751 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:16:59,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:16:59,761 INFO L225 Difference]: With dead ends: 5858 [2021-11-21 00:16:59,762 INFO L226 Difference]: Without dead ends: 5858 [2021-11-21 00:16:59,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=199, Invalid=1361, Unknown=0, NotChecked=0, Total=1560 [2021-11-21 00:16:59,762 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 342 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 4957 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 4985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-21 00:16:59,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 74 Invalid, 4985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4957 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-11-21 00:16:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5858 states. [2021-11-21 00:16:59,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5858 to 4660. [2021-11-21 00:16:59,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4660 states, 4656 states have (on average 2.9594072164948453) internal successors, (13779), 4659 states have internal predecessors, (13779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13779 transitions. [2021-11-21 00:16:59,875 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13779 transitions. Word has length 32 [2021-11-21 00:16:59,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:16:59,875 INFO L470 AbstractCegarLoop]: Abstraction has 4660 states and 13779 transitions. [2021-11-21 00:16:59,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:16:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13779 transitions. [2021-11-21 00:16:59,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:16:59,880 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:16:59,880 INFO L514 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] [2021-11-21 00:16:59,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-11-21 00:16:59,880 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:16:59,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:16:59,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1013287426, now seen corresponding path program 4 times [2021-11-21 00:16:59,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:16:59,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324532365] [2021-11-21 00:16:59,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:16:59,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:16:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:17:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:17:01,293 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:17:01,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324532365] [2021-11-21 00:17:01,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324532365] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:17:01,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:17:01,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-21 00:17:01,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674084459] [2021-11-21 00:17:01,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:17:01,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-21 00:17:01,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:17:01,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-21 00:17:01,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2021-11-21 00:17:01,294 INFO L87 Difference]: Start difference. First operand 4660 states and 13779 transitions. Second operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:17:07,035 INFO L93 Difference]: Finished difference Result 6187 states and 18140 transitions. [2021-11-21 00:17:07,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-21 00:17:07,036 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:17:07,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:17:07,047 INFO L225 Difference]: With dead ends: 6187 [2021-11-21 00:17:07,047 INFO L226 Difference]: Without dead ends: 6187 [2021-11-21 00:17:07,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=257, Invalid=1905, Unknown=0, NotChecked=0, Total=2162 [2021-11-21 00:17:07,048 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 460 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 5863 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 5901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 5863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:17:07,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [460 Valid, 108 Invalid, 5901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 5863 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2021-11-21 00:17:07,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6187 states. [2021-11-21 00:17:07,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6187 to 4934. [2021-11-21 00:17:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4934 states, 4930 states have (on average 2.951521298174442) internal successors, (14551), 4933 states have internal predecessors, (14551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:07,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4934 states to 4934 states and 14551 transitions. [2021-11-21 00:17:07,144 INFO L78 Accepts]: Start accepts. Automaton has 4934 states and 14551 transitions. Word has length 32 [2021-11-21 00:17:07,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:17:07,144 INFO L470 AbstractCegarLoop]: Abstraction has 4934 states and 14551 transitions. [2021-11-21 00:17:07,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 4934 states and 14551 transitions. [2021-11-21 00:17:07,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:17:07,149 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:17:07,149 INFO L514 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] [2021-11-21 00:17:07,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-11-21 00:17:07,149 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:17:07,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:17:07,150 INFO L85 PathProgramCache]: Analyzing trace with hash -637326740, now seen corresponding path program 2 times [2021-11-21 00:17:07,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:17:07,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162319246] [2021-11-21 00:17:07,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:17:07,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:17:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:17:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:17:08,411 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:17:08,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162319246] [2021-11-21 00:17:08,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162319246] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:17:08,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:17:08,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-21 00:17:08,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865435398] [2021-11-21 00:17:08,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:17:08,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-21 00:17:08,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:17:08,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-21 00:17:08,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-11-21 00:17:08,413 INFO L87 Difference]: Start difference. First operand 4934 states and 14551 transitions. Second operand has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:12,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:17:12,419 INFO L93 Difference]: Finished difference Result 6113 states and 17844 transitions. [2021-11-21 00:17:12,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-21 00:17:12,420 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:17:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:17:12,430 INFO L225 Difference]: With dead ends: 6113 [2021-11-21 00:17:12,431 INFO L226 Difference]: Without dead ends: 6113 [2021-11-21 00:17:12,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2021-11-21 00:17:12,431 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 397 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 4565 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 4593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-21 00:17:12,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 96 Invalid, 4593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4565 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-11-21 00:17:12,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6113 states. [2021-11-21 00:17:12,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6113 to 5276. [2021-11-21 00:17:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5276 states, 5272 states have (on average 2.9429059180576633) internal successors, (15515), 5275 states have internal predecessors, (15515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5276 states to 5276 states and 15515 transitions. [2021-11-21 00:17:12,556 INFO L78 Accepts]: Start accepts. Automaton has 5276 states and 15515 transitions. Word has length 32 [2021-11-21 00:17:12,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:17:12,556 INFO L470 AbstractCegarLoop]: Abstraction has 5276 states and 15515 transitions. [2021-11-21 00:17:12,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:12,556 INFO L276 IsEmpty]: Start isEmpty. Operand 5276 states and 15515 transitions. [2021-11-21 00:17:12,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:17:12,561 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:17:12,561 INFO L514 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] [2021-11-21 00:17:12,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-11-21 00:17:12,562 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:17:12,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:17:12,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1766906534, now seen corresponding path program 5 times [2021-11-21 00:17:12,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:17:12,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99350928] [2021-11-21 00:17:12,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:17:12,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:17:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:17:13,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:17:13,875 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:17:13,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99350928] [2021-11-21 00:17:13,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99350928] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:17:13,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:17:13,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-21 00:17:13,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651592922] [2021-11-21 00:17:13,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:17:13,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-21 00:17:13,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:17:13,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-21 00:17:13,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2021-11-21 00:17:13,876 INFO L87 Difference]: Start difference. First operand 5276 states and 15515 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:18,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:17:18,511 INFO L93 Difference]: Finished difference Result 6133 states and 17818 transitions. [2021-11-21 00:17:18,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-21 00:17:18,512 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:17:18,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:17:18,523 INFO L225 Difference]: With dead ends: 6133 [2021-11-21 00:17:18,524 INFO L226 Difference]: Without dead ends: 6133 [2021-11-21 00:17:18,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=198, Invalid=1362, Unknown=0, NotChecked=0, Total=1560 [2021-11-21 00:17:18,524 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 325 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 5342 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 5372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-21 00:17:18,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 81 Invalid, 5372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5342 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-11-21 00:17:18,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2021-11-21 00:17:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 5308. [2021-11-21 00:17:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5308 states, 5304 states have (on average 2.9432503770739067) internal successors, (15611), 5307 states have internal predecessors, (15611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5308 states to 5308 states and 15611 transitions. [2021-11-21 00:17:18,695 INFO L78 Accepts]: Start accepts. Automaton has 5308 states and 15611 transitions. Word has length 32 [2021-11-21 00:17:18,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:17:18,695 INFO L470 AbstractCegarLoop]: Abstraction has 5308 states and 15611 transitions. [2021-11-21 00:17:18,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:18,695 INFO L276 IsEmpty]: Start isEmpty. Operand 5308 states and 15611 transitions. [2021-11-21 00:17:18,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:17:18,700 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:17:18,700 INFO L514 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] [2021-11-21 00:17:18,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-11-21 00:17:18,701 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:17:18,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:17:18,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2003905790, now seen corresponding path program 6 times [2021-11-21 00:17:18,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:17:18,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682074621] [2021-11-21 00:17:18,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:17:18,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:17:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:17:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:17:19,945 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:17:19,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682074621] [2021-11-21 00:17:19,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682074621] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:17:19,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:17:19,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-21 00:17:19,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481135154] [2021-11-21 00:17:19,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:17:19,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-21 00:17:19,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:17:19,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-21 00:17:19,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2021-11-21 00:17:19,946 INFO L87 Difference]: Start difference. First operand 5308 states and 15611 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:17:24,047 INFO L93 Difference]: Finished difference Result 6650 states and 19335 transitions. [2021-11-21 00:17:24,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-21 00:17:24,048 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:17:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:17:24,060 INFO L225 Difference]: With dead ends: 6650 [2021-11-21 00:17:24,061 INFO L226 Difference]: Without dead ends: 6650 [2021-11-21 00:17:24,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=199, Invalid=1361, Unknown=0, NotChecked=0, Total=1560 [2021-11-21 00:17:24,061 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 388 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 4604 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 4640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-21 00:17:24,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 84 Invalid, 4640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4604 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-11-21 00:17:24,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6650 states. [2021-11-21 00:17:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6650 to 5368. [2021-11-21 00:17:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5368 states, 5364 states have (on average 2.9382923191648023) internal successors, (15761), 5367 states have internal predecessors, (15761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 15761 transitions. [2021-11-21 00:17:24,164 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 15761 transitions. Word has length 32 [2021-11-21 00:17:24,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:17:24,164 INFO L470 AbstractCegarLoop]: Abstraction has 5368 states and 15761 transitions. [2021-11-21 00:17:24,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 15761 transitions. [2021-11-21 00:17:24,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:17:24,170 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:17:24,170 INFO L514 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] [2021-11-21 00:17:24,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-11-21 00:17:24,170 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:17:24,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:17:24,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1675741810, now seen corresponding path program 7 times [2021-11-21 00:17:24,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:17:24,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347162554] [2021-11-21 00:17:24,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:17:24,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:17:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:17:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:17:25,558 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:17:25,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347162554] [2021-11-21 00:17:25,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347162554] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:17:25,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:17:25,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-21 00:17:25,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300708023] [2021-11-21 00:17:25,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:17:25,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-21 00:17:25,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:17:25,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-21 00:17:25,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2021-11-21 00:17:25,559 INFO L87 Difference]: Start difference. First operand 5368 states and 15761 transitions. Second operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:31,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:17:31,268 INFO L93 Difference]: Finished difference Result 7254 states and 21125 transitions. [2021-11-21 00:17:31,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-21 00:17:31,269 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:17:31,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:17:31,282 INFO L225 Difference]: With dead ends: 7254 [2021-11-21 00:17:31,282 INFO L226 Difference]: Without dead ends: 7254 [2021-11-21 00:17:31,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=257, Invalid=1905, Unknown=0, NotChecked=0, Total=2162 [2021-11-21 00:17:31,283 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 459 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 6255 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 6293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 6255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:17:31,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 131 Invalid, 6293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 6255 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2021-11-21 00:17:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7254 states. [2021-11-21 00:17:31,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7254 to 5266. [2021-11-21 00:17:31,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5266 states, 5262 states have (on average 2.9427974154313947) internal successors, (15485), 5265 states have internal predecessors, (15485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5266 states to 5266 states and 15485 transitions. [2021-11-21 00:17:31,422 INFO L78 Accepts]: Start accepts. Automaton has 5266 states and 15485 transitions. Word has length 32 [2021-11-21 00:17:31,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:17:31,422 INFO L470 AbstractCegarLoop]: Abstraction has 5266 states and 15485 transitions. [2021-11-21 00:17:31,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:31,423 INFO L276 IsEmpty]: Start isEmpty. Operand 5266 states and 15485 transitions. [2021-11-21 00:17:31,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:17:31,428 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:17:31,428 INFO L514 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] [2021-11-21 00:17:31,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-11-21 00:17:31,428 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:17:31,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:17:31,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1884457538, now seen corresponding path program 8 times [2021-11-21 00:17:31,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:17:31,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011865934] [2021-11-21 00:17:31,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:17:31,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:17:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:17:32,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:17:32,470 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:17:32,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011865934] [2021-11-21 00:17:32,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011865934] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:17:32,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:17:32,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-21 00:17:32,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009962155] [2021-11-21 00:17:32,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:17:32,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-21 00:17:32,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:17:32,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-21 00:17:32,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2021-11-21 00:17:32,472 INFO L87 Difference]: Start difference. First operand 5266 states and 15485 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:17:37,299 INFO L93 Difference]: Finished difference Result 5914 states and 17253 transitions. [2021-11-21 00:17:37,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-21 00:17:37,299 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:17:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:17:37,310 INFO L225 Difference]: With dead ends: 5914 [2021-11-21 00:17:37,310 INFO L226 Difference]: Without dead ends: 5914 [2021-11-21 00:17:37,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=198, Invalid=1362, Unknown=0, NotChecked=0, Total=1560 [2021-11-21 00:17:37,311 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 316 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 5599 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 5629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-21 00:17:37,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 84 Invalid, 5629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5599 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2021-11-21 00:17:37,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5914 states. [2021-11-21 00:17:37,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5914 to 5263. [2021-11-21 00:17:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5263 states, 5259 states have (on average 2.9427647841795017) internal successors, (15476), 5262 states have internal predecessors, (15476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:37,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5263 states to 5263 states and 15476 transitions. [2021-11-21 00:17:37,447 INFO L78 Accepts]: Start accepts. Automaton has 5263 states and 15476 transitions. Word has length 32 [2021-11-21 00:17:37,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:17:37,447 INFO L470 AbstractCegarLoop]: Abstraction has 5263 states and 15476 transitions. [2021-11-21 00:17:37,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:37,447 INFO L276 IsEmpty]: Start isEmpty. Operand 5263 states and 15476 transitions. [2021-11-21 00:17:37,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:17:37,453 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:17:37,453 INFO L514 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] [2021-11-21 00:17:37,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-11-21 00:17:37,453 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:17:37,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:17:37,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2121456794, now seen corresponding path program 9 times [2021-11-21 00:17:37,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:17:37,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235940931] [2021-11-21 00:17:37,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:17:37,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:17:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:17:38,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:17:38,935 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:17:38,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235940931] [2021-11-21 00:17:38,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235940931] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:17:38,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:17:38,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-21 00:17:38,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541030789] [2021-11-21 00:17:38,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:17:38,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-21 00:17:38,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:17:38,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-21 00:17:38,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2021-11-21 00:17:38,937 INFO L87 Difference]: Start difference. First operand 5263 states and 15476 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:43,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:17:43,312 INFO L93 Difference]: Finished difference Result 6519 states and 18986 transitions. [2021-11-21 00:17:43,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-21 00:17:43,313 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:17:43,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:17:43,326 INFO L225 Difference]: With dead ends: 6519 [2021-11-21 00:17:43,326 INFO L226 Difference]: Without dead ends: 6519 [2021-11-21 00:17:43,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=199, Invalid=1361, Unknown=0, NotChecked=0, Total=1560 [2021-11-21 00:17:43,326 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 340 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 4820 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 4852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:17:43,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 84 Invalid, 4852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 4820 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-11-21 00:17:43,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6519 states. [2021-11-21 00:17:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6519 to 5317. [2021-11-21 00:17:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5317 states, 5313 states have (on average 2.9382646339168077) internal successors, (15611), 5316 states have internal predecessors, (15611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 15611 transitions. [2021-11-21 00:17:43,494 INFO L78 Accepts]: Start accepts. Automaton has 5317 states and 15611 transitions. Word has length 32 [2021-11-21 00:17:43,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:17:43,494 INFO L470 AbstractCegarLoop]: Abstraction has 5317 states and 15611 transitions. [2021-11-21 00:17:43,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:43,495 INFO L276 IsEmpty]: Start isEmpty. Operand 5317 states and 15611 transitions. [2021-11-21 00:17:43,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:17:43,499 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:17:43,499 INFO L514 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] [2021-11-21 00:17:43,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-11-21 00:17:43,499 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:17:43,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:17:43,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1793292814, now seen corresponding path program 10 times [2021-11-21 00:17:43,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:17:43,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874818578] [2021-11-21 00:17:43,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:17:43,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:17:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:17:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:17:44,897 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:17:44,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874818578] [2021-11-21 00:17:44,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874818578] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:17:44,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:17:44,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-21 00:17:44,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983816105] [2021-11-21 00:17:44,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:17:44,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-21 00:17:44,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:17:44,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-21 00:17:44,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2021-11-21 00:17:44,898 INFO L87 Difference]: Start difference. First operand 5317 states and 15611 transitions. Second operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:17:50,541 INFO L93 Difference]: Finished difference Result 7125 states and 20781 transitions. [2021-11-21 00:17:50,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-21 00:17:50,541 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:17:50,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:17:50,554 INFO L225 Difference]: With dead ends: 7125 [2021-11-21 00:17:50,554 INFO L226 Difference]: Without dead ends: 7125 [2021-11-21 00:17:50,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=257, Invalid=1905, Unknown=0, NotChecked=0, Total=2162 [2021-11-21 00:17:50,554 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 427 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 6252 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 6288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 6252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:17:50,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 131 Invalid, 6288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 6252 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2021-11-21 00:17:50,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7125 states. [2021-11-21 00:17:50,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7125 to 5236. [2021-11-21 00:17:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5236 states, 5232 states have (on average 2.9424694189602447) internal successors, (15395), 5235 states have internal predecessors, (15395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:50,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5236 states to 5236 states and 15395 transitions. [2021-11-21 00:17:50,655 INFO L78 Accepts]: Start accepts. Automaton has 5236 states and 15395 transitions. Word has length 32 [2021-11-21 00:17:50,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:17:50,655 INFO L470 AbstractCegarLoop]: Abstraction has 5236 states and 15395 transitions. [2021-11-21 00:17:50,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:50,655 INFO L276 IsEmpty]: Start isEmpty. Operand 5236 states and 15395 transitions. [2021-11-21 00:17:50,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:17:50,660 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:17:50,661 INFO L514 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] [2021-11-21 00:17:50,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-11-21 00:17:50,661 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:17:50,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:17:50,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1509618164, now seen corresponding path program 11 times [2021-11-21 00:17:50,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:17:50,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213654047] [2021-11-21 00:17:50,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:17:50,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:17:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:17:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:17:51,915 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:17:51,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213654047] [2021-11-21 00:17:51,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213654047] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:17:51,916 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:17:51,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-11-21 00:17:51,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927838200] [2021-11-21 00:17:51,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:17:51,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-21 00:17:51,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:17:51,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-21 00:17:51,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2021-11-21 00:17:51,917 INFO L87 Difference]: Start difference. First operand 5236 states and 15395 transitions. Second operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:57,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:17:57,173 INFO L93 Difference]: Finished difference Result 5803 states and 17003 transitions. [2021-11-21 00:17:57,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-21 00:17:57,174 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:17:57,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:17:57,184 INFO L225 Difference]: With dead ends: 5803 [2021-11-21 00:17:57,184 INFO L226 Difference]: Without dead ends: 5803 [2021-11-21 00:17:57,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=230, Invalid=1576, Unknown=0, NotChecked=0, Total=1806 [2021-11-21 00:17:57,185 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 338 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 5934 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 5970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 5934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2021-11-21 00:17:57,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 117 Invalid, 5970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 5934 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2021-11-21 00:17:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5803 states. [2021-11-21 00:17:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5803 to 5230. [2021-11-21 00:17:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5230 states, 5226 states have (on average 2.942977420589361) internal successors, (15380), 5229 states have internal predecessors, (15380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5230 states to 5230 states and 15380 transitions. [2021-11-21 00:17:57,282 INFO L78 Accepts]: Start accepts. Automaton has 5230 states and 15380 transitions. Word has length 32 [2021-11-21 00:17:57,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:17:57,282 INFO L470 AbstractCegarLoop]: Abstraction has 5230 states and 15380 transitions. [2021-11-21 00:17:57,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:17:57,282 INFO L276 IsEmpty]: Start isEmpty. Operand 5230 states and 15380 transitions. [2021-11-21 00:17:57,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:17:57,287 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:17:57,287 INFO L514 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] [2021-11-21 00:17:57,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-11-21 00:17:57,288 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:17:57,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:17:57,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1969079518, now seen corresponding path program 12 times [2021-11-21 00:17:57,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:17:57,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288955054] [2021-11-21 00:17:57,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:17:57,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:17:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:17:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:17:58,449 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:17:58,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288955054] [2021-11-21 00:17:58,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288955054] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:17:58,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:17:58,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-21 00:17:58,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390508258] [2021-11-21 00:17:58,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:17:58,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-21 00:17:58,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:17:58,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-21 00:17:58,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2021-11-21 00:17:58,450 INFO L87 Difference]: Start difference. First operand 5230 states and 15380 transitions. Second operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:18:04,299 INFO L93 Difference]: Finished difference Result 6974 states and 20427 transitions. [2021-11-21 00:18:04,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-21 00:18:04,299 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:18:04,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:18:04,312 INFO L225 Difference]: With dead ends: 6974 [2021-11-21 00:18:04,312 INFO L226 Difference]: Without dead ends: 6974 [2021-11-21 00:18:04,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=257, Invalid=1905, Unknown=0, NotChecked=0, Total=2162 [2021-11-21 00:18:04,313 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 416 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 6678 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 6712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 6678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:18:04,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 131 Invalid, 6712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 6678 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2021-11-21 00:18:04,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6974 states. [2021-11-21 00:18:04,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6974 to 5176. [2021-11-21 00:18:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5176 states, 5172 states have (on average 2.947602474864656) internal successors, (15245), 5175 states have internal predecessors, (15245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5176 states to 5176 states and 15245 transitions. [2021-11-21 00:18:04,413 INFO L78 Accepts]: Start accepts. Automaton has 5176 states and 15245 transitions. Word has length 32 [2021-11-21 00:18:04,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:18:04,413 INFO L470 AbstractCegarLoop]: Abstraction has 5176 states and 15245 transitions. [2021-11-21 00:18:04,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 5176 states and 15245 transitions. [2021-11-21 00:18:04,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:18:04,419 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:18:04,419 INFO L514 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] [2021-11-21 00:18:04,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-11-21 00:18:04,419 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:18:04,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:18:04,420 INFO L85 PathProgramCache]: Analyzing trace with hash -641128836, now seen corresponding path program 13 times [2021-11-21 00:18:04,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:18:04,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085114098] [2021-11-21 00:18:04,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:18:04,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:18:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:18:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:18:05,532 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:18:05,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085114098] [2021-11-21 00:18:05,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085114098] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:18:05,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:18:05,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-21 00:18:05,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846198396] [2021-11-21 00:18:05,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:18:05,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-21 00:18:05,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:18:05,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-21 00:18:05,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2021-11-21 00:18:05,533 INFO L87 Difference]: Start difference. First operand 5176 states and 15245 transitions. Second operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:18:09,719 INFO L93 Difference]: Finished difference Result 5989 states and 17560 transitions. [2021-11-21 00:18:09,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-21 00:18:09,719 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:18:09,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:18:09,729 INFO L225 Difference]: With dead ends: 5989 [2021-11-21 00:18:09,729 INFO L226 Difference]: Without dead ends: 5989 [2021-11-21 00:18:09,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=171, Invalid=1235, Unknown=0, NotChecked=0, Total=1406 [2021-11-21 00:18:09,730 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 364 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 5210 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 5240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:18:09,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 127 Invalid, 5240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5210 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2021-11-21 00:18:09,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2021-11-21 00:18:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 5156. [2021-11-21 00:18:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5156 states, 5152 states have (on average 2.9493400621118013) internal successors, (15195), 5155 states have internal predecessors, (15195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5156 states to 5156 states and 15195 transitions. [2021-11-21 00:18:09,824 INFO L78 Accepts]: Start accepts. Automaton has 5156 states and 15195 transitions. Word has length 32 [2021-11-21 00:18:09,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:18:09,824 INFO L470 AbstractCegarLoop]: Abstraction has 5156 states and 15195 transitions. [2021-11-21 00:18:09,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:09,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5156 states and 15195 transitions. [2021-11-21 00:18:09,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:18:09,829 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:18:09,829 INFO L514 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] [2021-11-21 00:18:09,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-11-21 00:18:09,830 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:18:09,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:18:09,830 INFO L85 PathProgramCache]: Analyzing trace with hash -621292448, now seen corresponding path program 14 times [2021-11-21 00:18:09,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:18:09,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986769605] [2021-11-21 00:18:09,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:18:09,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:18:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:18:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:18:10,810 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:18:10,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986769605] [2021-11-21 00:18:10,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986769605] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:18:10,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:18:10,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-21 00:18:10,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678358284] [2021-11-21 00:18:10,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:18:10,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-21 00:18:10,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:18:10,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-21 00:18:10,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2021-11-21 00:18:10,811 INFO L87 Difference]: Start difference. First operand 5156 states and 15195 transitions. Second operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:15,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:18:15,051 INFO L93 Difference]: Finished difference Result 5954 states and 17455 transitions. [2021-11-21 00:18:15,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-21 00:18:15,051 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:18:15,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:18:15,061 INFO L225 Difference]: With dead ends: 5954 [2021-11-21 00:18:15,061 INFO L226 Difference]: Without dead ends: 5954 [2021-11-21 00:18:15,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=183, Invalid=1299, Unknown=0, NotChecked=0, Total=1482 [2021-11-21 00:18:15,062 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 418 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 5387 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 5427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 5387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:18:15,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 135 Invalid, 5427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 5387 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2021-11-21 00:18:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2021-11-21 00:18:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 4952. [2021-11-21 00:18:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4952 states, 4948 states have (on average 2.9569523039611965) internal successors, (14631), 4951 states have internal predecessors, (14631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4952 states to 4952 states and 14631 transitions. [2021-11-21 00:18:15,181 INFO L78 Accepts]: Start accepts. Automaton has 4952 states and 14631 transitions. Word has length 32 [2021-11-21 00:18:15,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:18:15,182 INFO L470 AbstractCegarLoop]: Abstraction has 4952 states and 14631 transitions. [2021-11-21 00:18:15,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:15,182 INFO L276 IsEmpty]: Start isEmpty. Operand 4952 states and 14631 transitions. [2021-11-21 00:18:15,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:18:15,186 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:18:15,186 INFO L514 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] [2021-11-21 00:18:15,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-11-21 00:18:15,187 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:18:15,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:18:15,188 INFO L85 PathProgramCache]: Analyzing trace with hash -290785296, now seen corresponding path program 3 times [2021-11-21 00:18:15,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:18:15,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972519812] [2021-11-21 00:18:15,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:18:15,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:18:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:18:16,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:18:16,027 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:18:16,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972519812] [2021-11-21 00:18:16,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972519812] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:18:16,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:18:16,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-21 00:18:16,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220771238] [2021-11-21 00:18:16,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:18:16,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-21 00:18:16,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:18:16,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-21 00:18:16,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-11-21 00:18:16,028 INFO L87 Difference]: Start difference. First operand 4952 states and 14631 transitions. Second operand has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:18:20,127 INFO L93 Difference]: Finished difference Result 5885 states and 17226 transitions. [2021-11-21 00:18:20,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-21 00:18:20,127 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:18:20,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:18:20,139 INFO L225 Difference]: With dead ends: 5885 [2021-11-21 00:18:20,139 INFO L226 Difference]: Without dead ends: 5885 [2021-11-21 00:18:20,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2021-11-21 00:18:20,139 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 382 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 4632 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 4661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:18:20,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 113 Invalid, 4661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4632 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-11-21 00:18:20,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5885 states. [2021-11-21 00:18:20,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5885 to 4932. [2021-11-21 00:18:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4932 states, 4928 states have (on average 2.9567775974025974) internal successors, (14571), 4931 states have internal predecessors, (14571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4932 states to 4932 states and 14571 transitions. [2021-11-21 00:18:20,240 INFO L78 Accepts]: Start accepts. Automaton has 4932 states and 14571 transitions. Word has length 32 [2021-11-21 00:18:20,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:18:20,240 INFO L470 AbstractCegarLoop]: Abstraction has 4932 states and 14571 transitions. [2021-11-21 00:18:20,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:20,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4932 states and 14571 transitions. [2021-11-21 00:18:20,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:18:20,245 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:18:20,245 INFO L514 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] [2021-11-21 00:18:20,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-11-21 00:18:20,245 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:18:20,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:18:20,246 INFO L85 PathProgramCache]: Analyzing trace with hash 210635510, now seen corresponding path program 4 times [2021-11-21 00:18:20,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:18:20,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145635648] [2021-11-21 00:18:20,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:18:20,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:18:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:18:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:18:21,269 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:18:21,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145635648] [2021-11-21 00:18:21,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145635648] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:18:21,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:18:21,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-21 00:18:21,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937684066] [2021-11-21 00:18:21,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:18:21,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-21 00:18:21,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:18:21,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-21 00:18:21,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-11-21 00:18:21,270 INFO L87 Difference]: Start difference. First operand 4932 states and 14571 transitions. Second operand has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:18:25,502 INFO L93 Difference]: Finished difference Result 5805 states and 17036 transitions. [2021-11-21 00:18:25,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-21 00:18:25,502 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:18:25,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:18:25,513 INFO L225 Difference]: With dead ends: 5805 [2021-11-21 00:18:25,513 INFO L226 Difference]: Without dead ends: 5805 [2021-11-21 00:18:25,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2021-11-21 00:18:25,514 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 332 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 4799 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 4823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:18:25,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 115 Invalid, 4823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4799 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2021-11-21 00:18:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5805 states. [2021-11-21 00:18:25,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5805 to 4872. [2021-11-21 00:18:25,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4868 states have (on average 2.96240755957272) internal successors, (14421), 4871 states have internal predecessors, (14421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 14421 transitions. [2021-11-21 00:18:25,608 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 14421 transitions. Word has length 32 [2021-11-21 00:18:25,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:18:25,608 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 14421 transitions. [2021-11-21 00:18:25,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 14421 transitions. [2021-11-21 00:18:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:18:25,613 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:18:25,613 INFO L514 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] [2021-11-21 00:18:25,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-11-21 00:18:25,614 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:18:25,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:18:25,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1229142320, now seen corresponding path program 5 times [2021-11-21 00:18:25,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:18:25,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347056493] [2021-11-21 00:18:25,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:18:25,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:18:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:18:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:18:26,462 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:18:26,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347056493] [2021-11-21 00:18:26,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347056493] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:18:26,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:18:26,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-21 00:18:26,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356104647] [2021-11-21 00:18:26,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:18:26,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-21 00:18:26,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:18:26,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-21 00:18:26,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-11-21 00:18:26,464 INFO L87 Difference]: Start difference. First operand 4872 states and 14421 transitions. Second operand has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:18:30,346 INFO L93 Difference]: Finished difference Result 5928 states and 17403 transitions. [2021-11-21 00:18:30,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-21 00:18:30,346 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:18:30,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:18:30,357 INFO L225 Difference]: With dead ends: 5928 [2021-11-21 00:18:30,357 INFO L226 Difference]: Without dead ends: 5928 [2021-11-21 00:18:30,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=163, Invalid=1169, Unknown=0, NotChecked=0, Total=1332 [2021-11-21 00:18:30,358 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 368 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 4820 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 4852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:18:30,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 114 Invalid, 4852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 4820 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2021-11-21 00:18:30,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5928 states. [2021-11-21 00:18:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5928 to 4861. [2021-11-21 00:18:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4861 states, 4857 states have (on average 2.956145768993206) internal successors, (14358), 4860 states have internal predecessors, (14358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4861 states to 4861 states and 14358 transitions. [2021-11-21 00:18:30,451 INFO L78 Accepts]: Start accepts. Automaton has 4861 states and 14358 transitions. Word has length 32 [2021-11-21 00:18:30,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:18:30,452 INFO L470 AbstractCegarLoop]: Abstraction has 4861 states and 14358 transitions. [2021-11-21 00:18:30,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:30,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4861 states and 14358 transitions. [2021-11-21 00:18:30,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-21 00:18:30,456 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:18:30,457 INFO L514 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] [2021-11-21 00:18:30,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-11-21 00:18:30,457 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:18:30,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:18:30,457 INFO L85 PathProgramCache]: Analyzing trace with hash 523405872, now seen corresponding path program 6 times [2021-11-21 00:18:30,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:18:30,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432946238] [2021-11-21 00:18:30,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:18:30,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:18:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:18:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:18:31,234 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:18:31,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432946238] [2021-11-21 00:18:31,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432946238] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:18:31,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:18:31,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-21 00:18:31,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534892344] [2021-11-21 00:18:31,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:18:31,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-21 00:18:31,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:18:31,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-21 00:18:31,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-11-21 00:18:31,235 INFO L87 Difference]: Start difference. First operand 4861 states and 14358 transitions. Second operand has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:34,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:18:34,891 INFO L93 Difference]: Finished difference Result 5410 states and 15920 transitions. [2021-11-21 00:18:34,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-21 00:18:34,892 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-21 00:18:34,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:18:34,901 INFO L225 Difference]: With dead ends: 5410 [2021-11-21 00:18:34,901 INFO L226 Difference]: Without dead ends: 5410 [2021-11-21 00:18:34,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2021-11-21 00:18:34,901 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 343 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 4821 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 4849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-21 00:18:34,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 110 Invalid, 4849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4821 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-11-21 00:18:34,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2021-11-21 00:18:34,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 4577. [2021-11-21 00:18:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 4573 states have (on average 2.964137327793571) internal successors, (13555), 4576 states have internal predecessors, (13555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:34,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 13555 transitions. [2021-11-21 00:18:34,986 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 13555 transitions. Word has length 32 [2021-11-21 00:18:34,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:18:34,986 INFO L470 AbstractCegarLoop]: Abstraction has 4577 states and 13555 transitions. [2021-11-21 00:18:34,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:34,986 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 13555 transitions. [2021-11-21 00:18:34,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-21 00:18:34,991 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:18:34,991 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-21 00:18:34,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-11-21 00:18:34,992 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-21 00:18:34,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:18:34,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2031947780, now seen corresponding path program 2 times [2021-11-21 00:18:34,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:18:34,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844864083] [2021-11-21 00:18:34,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:18:34,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:18:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:18:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:18:35,972 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:18:35,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844864083] [2021-11-21 00:18:35,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844864083] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:18:35,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493081549] [2021-11-21 00:18:35,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 00:18:35,972 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:18:35,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:18:35,974 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:18:35,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6b31eb-311c-4d67-bde6-c65965460a3b/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-21 00:18:36,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-21 00:18:36,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 00:18:36,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 94 conjunts are in the unsatisfiable core [2021-11-21 00:18:36,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:18:36,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:18:36,121 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-21 00:18:36,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 35 [2021-11-21 00:18:36,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2021-11-21 00:18:36,271 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-11-21 00:18:36,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2021-11-21 00:18:36,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:18:36,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:18:36,754 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-21 00:18:36,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 41 [2021-11-21 00:18:36,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:18:36,899 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-21 00:18:36,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 45 [2021-11-21 00:18:37,244 INFO L354 Elim1Store]: treesize reduction 97, result has 24.2 percent of original size [2021-11-21 00:18:37,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 57 [2021-11-21 00:18:37,308 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-11-21 00:18:37,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2021-11-21 00:18:37,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:18:37,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:18:39,536 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_415| Int)) (or (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_~x#1| Int)) (<= (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) (+ |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_415| 4) 4) |writer_fnThread1of1ForFork0_ring_enqueue_~x#1|)) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) (+ (* |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| 4) 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|)) 8)) (< |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_415| (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) (+ |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| 20))))) is different from false [2021-11-21 00:19:10,450 WARN L227 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 00:19:25,284 WARN L227 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 00:19:33,842 WARN L227 SmtUtils]: Spent 6.16s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 00:22:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-21 00:22:04,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493081549] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:22:04,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1059381562] [2021-11-21 00:22:04,800 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-21 00:22:04,801 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:22:04,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 19] total 52 [2021-11-21 00:22:04,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342580843] [2021-11-21 00:22:04,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:22:04,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-11-21 00:22:04,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:22:04,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-11-21 00:22:04,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2532, Unknown=40, NotChecked=102, Total=2862 [2021-11-21 00:22:04,803 INFO L87 Difference]: Start difference. First operand 4577 states and 13555 transitions. Second operand has 54 states, 53 states have (on average 1.6415094339622642) internal successors, (87), 53 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)