./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 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF --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-63182f1 [2021-11-12 23:17:59,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-12 23:17:59,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-12 23:17:59,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-12 23:17:59,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-12 23:17:59,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-12 23:17:59,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-12 23:17:59,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-12 23:17:59,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-12 23:17:59,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-12 23:17:59,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-12 23:17:59,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-12 23:17:59,420 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-12 23:17:59,428 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-12 23:17:59,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-12 23:17:59,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-12 23:17:59,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-12 23:17:59,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-12 23:17:59,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-12 23:17:59,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-12 23:17:59,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-12 23:17:59,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-12 23:17:59,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-12 23:17:59,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-12 23:17:59,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-12 23:17:59,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-12 23:17:59,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-12 23:17:59,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-12 23:17:59,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-12 23:17:59,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-12 23:17:59,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-12 23:17:59,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-12 23:17:59,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-12 23:17:59,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-12 23:17:59,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-12 23:17:59,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-12 23:17:59,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-12 23:17:59,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-12 23:17:59,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-12 23:17:59,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-12 23:17:59,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-12 23:17:59,475 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-12 23:17:59,520 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-12 23:17:59,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-12 23:17:59,522 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-12 23:17:59,522 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-12 23:17:59,522 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-12 23:17:59,523 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-12 23:17:59,523 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-12 23:17:59,523 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-12 23:17:59,529 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-12 23:17:59,530 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-12 23:17:59,531 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-12 23:17:59,531 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-12 23:17:59,531 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-12 23:17:59,531 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-12 23:17:59,532 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-12 23:17:59,532 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-12 23:17:59,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-12 23:17:59,533 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-12 23:17:59,533 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-12 23:17:59,533 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-12 23:17:59,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-12 23:17:59,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-12 23:17:59,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-12 23:17:59,534 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-12 23:17:59,534 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-12 23:17:59,534 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-12 23:17:59,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-12 23:17:59,535 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-12 23:17:59,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-12 23:17:59,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-12 23:17:59,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-12 23:17:59,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 23:17:59,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-12 23:17:59,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-12 23:17:59,536 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-12 23:17:59,536 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-12 23:17:59,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-12 23:17:59,537 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-12 23:17:59,537 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-12 23:17:59,537 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-12 23:17:59,537 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_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/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_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF 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-12 23:17:59,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-12 23:17:59,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-12 23:17:59,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-12 23:17:59,846 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-12 23:17:59,847 INFO L275 PluginConnector]: CDTParser initialized [2021-11-12 23:17:59,848 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2021-11-12 23:17:59,905 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/data/6cbf342d8/1f495ee68ef447e3aea80cb0558b0b39/FLAG5f3e4a067 [2021-11-12 23:18:00,478 INFO L306 CDTParser]: Found 1 translation units. [2021-11-12 23:18:00,479 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2021-11-12 23:18:00,501 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/data/6cbf342d8/1f495ee68ef447e3aea80cb0558b0b39/FLAG5f3e4a067 [2021-11-12 23:18:00,724 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/data/6cbf342d8/1f495ee68ef447e3aea80cb0558b0b39 [2021-11-12 23:18:00,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-12 23:18:00,727 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-12 23:18:00,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-12 23:18:00,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-12 23:18:00,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-12 23:18:00,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:18:00" (1/1) ... [2021-11-12 23:18:00,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5390f4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:18:00, skipping insertion in model container [2021-11-12 23:18:00,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:18:00" (1/1) ... [2021-11-12 23:18:00,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-12 23:18:00,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-12 23:18:01,019 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-12 23:18:01,303 WARN L228 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_6b28b322-8a12-4e93-9fa0-708ad43390a7/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39095,39108] [2021-11-12 23:18:01,310 WARN L228 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_6b28b322-8a12-4e93-9fa0-708ad43390a7/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39180,39193] [2021-11-12 23:18:01,311 WARN L228 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_6b28b322-8a12-4e93-9fa0-708ad43390a7/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39232,39245] [2021-11-12 23:18:01,423 WARN L228 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_6b28b322-8a12-4e93-9fa0-708ad43390a7/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49388,49401] [2021-11-12 23:18:01,424 WARN L228 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_6b28b322-8a12-4e93-9fa0-708ad43390a7/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49437,49450] [2021-11-12 23:18:01,427 WARN L228 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_6b28b322-8a12-4e93-9fa0-708ad43390a7/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49565,49578] [2021-11-12 23:18:01,430 WARN L228 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_6b28b322-8a12-4e93-9fa0-708ad43390a7/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49623,49636] [2021-11-12 23:18:01,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 23:18:01,453 INFO L203 MainTranslator]: Completed pre-run [2021-11-12 23:18:01,470 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-12 23:18:01,503 WARN L228 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_6b28b322-8a12-4e93-9fa0-708ad43390a7/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39095,39108] [2021-11-12 23:18:01,505 WARN L228 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_6b28b322-8a12-4e93-9fa0-708ad43390a7/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39180,39193] [2021-11-12 23:18:01,506 WARN L228 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_6b28b322-8a12-4e93-9fa0-708ad43390a7/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39232,39245] [2021-11-12 23:18:01,529 WARN L228 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_6b28b322-8a12-4e93-9fa0-708ad43390a7/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49388,49401] [2021-11-12 23:18:01,530 WARN L228 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_6b28b322-8a12-4e93-9fa0-708ad43390a7/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49437,49450] [2021-11-12 23:18:01,532 WARN L228 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_6b28b322-8a12-4e93-9fa0-708ad43390a7/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49565,49578] [2021-11-12 23:18:01,533 WARN L228 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_6b28b322-8a12-4e93-9fa0-708ad43390a7/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49623,49636] [2021-11-12 23:18:01,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 23:18:01,619 INFO L208 MainTranslator]: Completed translation [2021-11-12 23:18:01,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:18:01 WrapperNode [2021-11-12 23:18:01,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-12 23:18:01,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-12 23:18:01,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-12 23:18:01,621 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-12 23:18:01,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:18:01" (1/1) ... [2021-11-12 23:18:01,649 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:18:01" (1/1) ... [2021-11-12 23:18:01,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-12 23:18:01,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-12 23:18:01,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-12 23:18:01,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-12 23:18:01,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:18:01" (1/1) ... [2021-11-12 23:18:01,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:18:01" (1/1) ... [2021-11-12 23:18:01,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:18:01" (1/1) ... [2021-11-12 23:18:01,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:18:01" (1/1) ... [2021-11-12 23:18:01,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:18:01" (1/1) ... [2021-11-12 23:18:01,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:18:01" (1/1) ... [2021-11-12 23:18:01,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:18:01" (1/1) ... [2021-11-12 23:18:01,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-12 23:18:01,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-12 23:18:01,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-12 23:18:01,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-12 23:18:01,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:18:01" (1/1) ... [2021-11-12 23:18:01,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 23:18:01,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:18:01,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-12 23:18:01,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-12 23:18:01,842 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2021-11-12 23:18:01,843 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2021-11-12 23:18:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2021-11-12 23:18:01,843 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2021-11-12 23:18:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-12 23:18:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-12 23:18:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-12 23:18:01,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-12 23:18:01,844 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-12 23:18:01,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-12 23:18:01,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-12 23:18:01,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-12 23:18:01,846 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-12 23:18:02,426 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-12 23:18:02,427 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-12 23:18:02,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:18:02 BoogieIcfgContainer [2021-11-12 23:18:02,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-12 23:18:02,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-12 23:18:02,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-12 23:18:02,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-12 23:18:02,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 11:18:00" (1/3) ... [2021-11-12 23:18:02,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd8bcd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:18:02, skipping insertion in model container [2021-11-12 23:18:02,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:18:01" (2/3) ... [2021-11-12 23:18:02,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd8bcd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:18:02, skipping insertion in model container [2021-11-12 23:18:02,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:18:02" (3/3) ... [2021-11-12 23:18:02,437 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2021-11-12 23:18:02,457 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-12 23:18:02,457 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-12 23:18:02,457 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-12 23:18:02,457 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-12 23:18:02,560 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,560 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,561 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,561 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,561 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,562 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,562 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,562 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,562 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,563 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,563 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,563 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,563 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,564 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,564 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,564 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,565 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,565 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,565 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,565 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,567 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,567 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,568 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,568 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,568 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,569 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,581 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,581 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,582 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,582 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,582 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,583 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,583 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,583 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,583 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,584 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,584 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,584 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,585 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,585 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,585 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,585 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,586 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,586 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,586 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,586 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,587 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,587 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,587 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,587 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,588 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,588 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,588 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,588 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,589 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,589 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,589 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,590 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,590 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,590 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,591 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,591 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,591 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,591 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,592 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,592 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,592 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,592 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,593 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,593 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,593 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,593 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,594 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,594 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,594 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,594 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,595 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,595 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,595 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,595 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,596 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,596 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,596 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,596 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,597 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,597 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,597 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,597 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,598 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,598 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,598 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,598 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,598 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,599 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,599 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,599 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,599 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,600 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,600 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,600 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,600 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,601 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,601 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,601 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,601 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,602 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,602 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,602 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,606 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,606 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,607 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,607 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,607 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,607 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,608 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,608 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,608 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,608 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,609 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,609 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,609 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,609 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,610 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,610 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,612 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,612 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,612 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,612 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,613 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,613 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,614 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,615 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,615 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,615 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,615 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,616 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,616 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,616 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,616 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,616 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,617 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,617 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,618 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,618 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,618 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,618 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,619 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,619 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,619 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,619 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,619 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,620 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,620 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,620 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,620 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,621 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,621 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,621 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,621 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,621 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,622 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,623 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,623 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,623 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,623 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,623 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,626 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,633 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,634 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,634 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,634 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,634 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,635 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,635 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,635 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,635 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,635 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,636 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,636 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,636 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,636 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,636 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,637 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,637 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,637 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,637 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,637 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,637 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,638 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,638 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,638 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,638 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,638 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,639 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,639 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,639 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,639 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,640 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,640 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,640 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,640 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,640 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,640 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,641 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,641 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,641 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,641 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,641 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,643 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,643 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,643 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,643 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,644 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,644 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,644 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,644 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,644 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,645 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,645 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,645 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,645 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,645 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,645 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,646 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,646 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,646 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,646 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,646 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,647 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,647 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,647 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,647 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,647 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,648 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,648 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,648 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,648 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,648 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,657 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,657 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,657 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,657 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,659 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,659 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,659 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,659 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,659 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,660 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,660 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,661 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,661 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,661 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,661 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,661 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,661 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,662 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,662 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,662 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,662 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,662 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,663 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,663 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,663 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,663 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,663 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,663 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,664 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,664 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,664 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,664 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,665 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,665 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,665 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,665 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,665 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,666 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,666 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,666 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,666 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,667 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,667 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,667 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,667 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,674 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,675 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,675 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,675 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,675 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,675 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,676 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,676 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,676 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,676 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,676 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,677 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,677 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,677 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,677 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,677 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,678 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,678 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,691 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,691 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,691 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,691 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,692 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,692 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,693 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,693 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,693 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,693 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,693 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,694 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,694 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,694 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,694 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,695 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,695 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,695 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,695 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,695 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,696 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,696 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,696 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,696 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,696 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,697 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,697 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,697 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,697 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,697 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,698 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,698 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,698 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,698 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,698 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,699 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,699 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,699 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,699 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,699 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,700 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,700 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,700 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,700 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,701 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,701 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,701 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,701 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,701 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,702 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,702 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,705 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,705 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,706 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,706 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,706 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,706 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,706 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,707 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,707 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,707 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,707 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,708 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,708 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,708 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,708 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,708 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,709 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,709 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,709 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,709 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,709 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,710 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,710 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,710 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,710 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,711 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,711 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,711 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,711 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,711 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,712 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,712 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,715 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,720 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,720 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,720 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,721 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,721 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,721 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,721 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,721 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,722 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,722 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,722 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,722 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,727 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,727 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,727 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,728 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,728 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,729 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,729 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,734 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,734 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,735 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,735 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,735 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,735 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,735 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,736 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,736 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,736 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,736 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,736 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,736 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,740 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,740 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,740 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,741 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,741 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,741 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,741 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,741 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,741 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,742 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,742 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,742 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,742 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,742 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,743 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,743 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,743 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,743 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,743 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:18:02,746 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-11-12 23:18:02,793 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-12 23:18:02,808 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-12 23:18:02,808 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-11-12 23:18:02,828 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-12 23:18:02,841 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 232 transitions, 480 flow [2021-11-12 23:18:02,845 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 232 transitions, 480 flow [2021-11-12 23:18:02,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 222 places, 232 transitions, 480 flow [2021-11-12 23:18:02,945 INFO L129 PetriNetUnfolder]: 17/230 cut-off events. [2021-11-12 23:18:02,945 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-11-12 23:18:02,957 INFO L84 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 230 events. 17/230 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 466 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2021-11-12 23:18:02,973 INFO L116 LiptonReduction]: Number of co-enabled transitions 19012 [2021-11-12 23:18:10,534 INFO L131 LiptonReduction]: Checked pairs total: 30449 [2021-11-12 23:18:10,534 INFO L133 LiptonReduction]: Total number of compositions: 207 [2021-11-12 23:18:10,542 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 62 transitions, 140 flow [2021-11-12 23:18:10,669 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2350 states, 2345 states have (on average 3.5074626865671643) internal successors, (8225), 2349 states have internal predecessors, (8225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 2350 states, 2345 states have (on average 3.5074626865671643) internal successors, (8225), 2349 states have internal predecessors, (8225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:10,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-12 23:18:10,697 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:10,698 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:18:10,698 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:10,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:10,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1462194309, now seen corresponding path program 1 times [2021-11-12 23:18:10,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:10,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551388773] [2021-11-12 23:18:10,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:10,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:11,199 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-12 23:18:11,200 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:11,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551388773] [2021-11-12 23:18:11,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551388773] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:11,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:11,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-12 23:18:11,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184035248] [2021-11-12 23:18:11,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:11,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-12 23:18:11,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:11,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-12 23:18:11,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-12 23:18:11,247 INFO L87 Difference]: Start difference. First operand has 2350 states, 2345 states have (on average 3.5074626865671643) internal successors, (8225), 2349 states have internal predecessors, (8225), 0 states have call successors, (0), 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 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-12 23:18:11,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:11,804 INFO L93 Difference]: Finished difference Result 2440 states and 7858 transitions. [2021-11-12 23:18:11,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-12 23:18:11,806 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-12 23:18:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:11,847 INFO L225 Difference]: With dead ends: 2440 [2021-11-12 23:18:11,847 INFO L226 Difference]: Without dead ends: 2336 [2021-11-12 23:18:11,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-12 23:18:11,852 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 48 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 280.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.48ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 347.13ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:11,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 21 Invalid, 427 Unknown, 0 Unchecked, 13.48ms Time], IncrementalHoareTripleChecker [7 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 347.13ms Time] [2021-11-12 23:18:11,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2021-11-12 23:18:12,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2336. [2021-11-12 23:18:12,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 2332 states have (on average 3.272727272727273) internal successors, (7632), 2335 states have internal predecessors, (7632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 7632 transitions. [2021-11-12 23:18:12,056 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 7632 transitions. Word has length 17 [2021-11-12 23:18:12,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:12,057 INFO L470 AbstractCegarLoop]: Abstraction has 2336 states and 7632 transitions. [2021-11-12 23:18:12,057 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-12 23:18:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 7632 transitions. [2021-11-12 23:18:12,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-12 23:18:12,063 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:12,064 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-12 23:18:12,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-12 23:18:12,064 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:12,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:12,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2132347391, now seen corresponding path program 1 times [2021-11-12 23:18:12,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:12,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459245083] [2021-11-12 23:18:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:12,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:12,343 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-12 23:18:12,343 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:12,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459245083] [2021-11-12 23:18:12,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459245083] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:12,343 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:12,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-12 23:18:12,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458928364] [2021-11-12 23:18:12,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:12,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-12 23:18:12,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:12,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-12 23:18:12,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-12 23:18:12,346 INFO L87 Difference]: Start difference. First operand 2336 states and 7632 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-12 23:18:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:12,922 INFO L93 Difference]: Finished difference Result 2989 states and 9687 transitions. [2021-11-12 23:18:12,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-12 23:18:12,923 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-12 23:18:12,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:12,950 INFO L225 Difference]: With dead ends: 2989 [2021-11-12 23:18:12,951 INFO L226 Difference]: Without dead ends: 2829 [2021-11-12 23:18:12,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-12 23:18:12,953 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 119 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 373.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.99ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 446.22ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:12,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 13 Invalid, 609 Unknown, 0 Unchecked, 3.99ms Time], IncrementalHoareTripleChecker [13 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 446.22ms Time] [2021-11-12 23:18:12,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2021-11-12 23:18:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2829. [2021-11-12 23:18:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2829 states, 2825 states have (on average 3.282477876106195) internal successors, (9273), 2828 states have internal predecessors, (9273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 9273 transitions. [2021-11-12 23:18:13,081 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 9273 transitions. Word has length 18 [2021-11-12 23:18:13,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:13,082 INFO L470 AbstractCegarLoop]: Abstraction has 2829 states and 9273 transitions. [2021-11-12 23:18:13,082 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-12 23:18:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 9273 transitions. [2021-11-12 23:18:13,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:13,088 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:13,088 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-12 23:18:13,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-12 23:18:13,088 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:13,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:13,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1909828396, now seen corresponding path program 1 times [2021-11-12 23:18:13,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:13,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085334868] [2021-11-12 23:18:13,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:13,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:13,702 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-12 23:18:13,702 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:13,702 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085334868] [2021-11-12 23:18:13,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085334868] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:13,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:13,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:18:13,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925046169] [2021-11-12 23:18:13,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:13,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:18:13,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:13,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:18:13,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:18:13,705 INFO L87 Difference]: Start difference. First operand 2829 states and 9273 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-12 23:18:14,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:14,775 INFO L93 Difference]: Finished difference Result 2974 states and 9659 transitions. [2021-11-12 23:18:14,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-12 23:18:14,779 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-12 23:18:14,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:14,808 INFO L225 Difference]: With dead ends: 2974 [2021-11-12 23:18:14,808 INFO L226 Difference]: Without dead ends: 2884 [2021-11-12 23:18:14,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2021-11-12 23:18:14,810 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 209 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 529.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.66ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 643.02ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:14,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 15 Invalid, 802 Unknown, 0 Unchecked, 4.66ms Time], IncrementalHoareTripleChecker [20 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 643.02ms Time] [2021-11-12 23:18:14,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2021-11-12 23:18:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 2878. [2021-11-12 23:18:14,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2878 states, 2874 states have (on average 3.282185107863605) internal successors, (9433), 2877 states have internal predecessors, (9433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 9433 transitions. [2021-11-12 23:18:14,941 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 9433 transitions. Word has length 25 [2021-11-12 23:18:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:14,942 INFO L470 AbstractCegarLoop]: Abstraction has 2878 states and 9433 transitions. [2021-11-12 23:18:14,943 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-12 23:18:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 9433 transitions. [2021-11-12 23:18:14,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:14,951 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:14,951 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-12 23:18:14,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-12 23:18:14,952 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:14,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:14,952 INFO L85 PathProgramCache]: Analyzing trace with hash 925875038, now seen corresponding path program 1 times [2021-11-12 23:18:14,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:14,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587083217] [2021-11-12 23:18:14,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:14,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:15,518 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-12 23:18:15,519 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:15,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587083217] [2021-11-12 23:18:15,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587083217] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:15,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:15,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:18:15,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823232879] [2021-11-12 23:18:15,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:15,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:18:15,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:15,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:18:15,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:18:15,521 INFO L87 Difference]: Start difference. First operand 2878 states and 9433 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-12 23:18:16,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:16,699 INFO L93 Difference]: Finished difference Result 3030 states and 9834 transitions. [2021-11-12 23:18:16,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-12 23:18:16,699 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-12 23:18:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:16,727 INFO L225 Difference]: With dead ends: 3030 [2021-11-12 23:18:16,727 INFO L226 Difference]: Without dead ends: 2940 [2021-11-12 23:18:16,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2021-11-12 23:18:16,729 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 280 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 489.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.29ms SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 628.00ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:16,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 15 Invalid, 821 Unknown, 0 Unchecked, 4.29ms Time], IncrementalHoareTripleChecker [29 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 628.00ms Time] [2021-11-12 23:18:16,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2021-11-12 23:18:16,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2934. [2021-11-12 23:18:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2934 states, 2930 states have (on average 3.2795221843003413) internal successors, (9609), 2933 states have internal predecessors, (9609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 9609 transitions. [2021-11-12 23:18:16,886 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 9609 transitions. Word has length 25 [2021-11-12 23:18:16,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:16,887 INFO L470 AbstractCegarLoop]: Abstraction has 2934 states and 9609 transitions. [2021-11-12 23:18:16,887 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-12 23:18:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 9609 transitions. [2021-11-12 23:18:16,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:16,893 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:16,893 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-12 23:18:16,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-12 23:18:16,894 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:16,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:16,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1985020, now seen corresponding path program 2 times [2021-11-12 23:18:16,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:16,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084237282] [2021-11-12 23:18:16,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:16,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:17,325 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-12 23:18:17,325 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:17,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084237282] [2021-11-12 23:18:17,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084237282] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:17,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:17,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:18:17,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822309025] [2021-11-12 23:18:17,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:17,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:18:17,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:17,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:18:17,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:18:17,327 INFO L87 Difference]: Start difference. First operand 2934 states and 9609 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-12 23:18:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:18,846 INFO L93 Difference]: Finished difference Result 3679 states and 11944 transitions. [2021-11-12 23:18:18,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-12 23:18:18,846 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-12 23:18:18,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:18,879 INFO L225 Difference]: With dead ends: 3679 [2021-11-12 23:18:18,879 INFO L226 Difference]: Without dead ends: 3589 [2021-11-12 23:18:18,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2021-11-12 23:18:18,880 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 270 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 757.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.67ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 883.74ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:18,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 25 Invalid, 1351 Unknown, 0 Unchecked, 5.67ms Time], IncrementalHoareTripleChecker [19 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 883.74ms Time] [2021-11-12 23:18:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3589 states. [2021-11-12 23:18:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3589 to 3027. [2021-11-12 23:18:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3027 states, 3023 states have (on average 3.2795236520013233) internal successors, (9914), 3026 states have internal predecessors, (9914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3027 states to 3027 states and 9914 transitions. [2021-11-12 23:18:18,995 INFO L78 Accepts]: Start accepts. Automaton has 3027 states and 9914 transitions. Word has length 25 [2021-11-12 23:18:18,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:18,995 INFO L470 AbstractCegarLoop]: Abstraction has 3027 states and 9914 transitions. [2021-11-12 23:18:18,995 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-12 23:18:18,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3027 states and 9914 transitions. [2021-11-12 23:18:19,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:19,046 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:19,046 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-12 23:18:19,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-12 23:18:19,047 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:19,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash 500046580, now seen corresponding path program 2 times [2021-11-12 23:18:19,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:19,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619123326] [2021-11-12 23:18:19,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:19,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:19,436 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-12 23:18:19,436 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:19,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619123326] [2021-11-12 23:18:19,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619123326] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:19,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:19,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:18:19,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897760038] [2021-11-12 23:18:19,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:19,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:18:19,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:19,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:18:19,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:18:19,439 INFO L87 Difference]: Start difference. First operand 3027 states and 9914 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-12 23:18:21,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:21,217 INFO L93 Difference]: Finished difference Result 3655 states and 11797 transitions. [2021-11-12 23:18:21,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-12 23:18:21,217 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-12 23:18:21,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:21,250 INFO L225 Difference]: With dead ends: 3655 [2021-11-12 23:18:21,250 INFO L226 Difference]: Without dead ends: 3565 [2021-11-12 23:18:21,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2021-11-12 23:18:21,252 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 209 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 1826 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 977.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.62ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1161.10ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:21,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 41 Invalid, 1843 Unknown, 0 Unchecked, 5.62ms Time], IncrementalHoareTripleChecker [17 Valid, 1826 Invalid, 0 Unknown, 0 Unchecked, 1161.10ms Time] [2021-11-12 23:18:21,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3565 states. [2021-11-12 23:18:21,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3565 to 3307. [2021-11-12 23:18:21,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3307 states, 3303 states have (on average 3.2815622161671207) internal successors, (10839), 3306 states have internal predecessors, (10839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 10839 transitions. [2021-11-12 23:18:21,373 INFO L78 Accepts]: Start accepts. Automaton has 3307 states and 10839 transitions. Word has length 25 [2021-11-12 23:18:21,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:21,373 INFO L470 AbstractCegarLoop]: Abstraction has 3307 states and 10839 transitions. [2021-11-12 23:18:21,373 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-12 23:18:21,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 10839 transitions. [2021-11-12 23:18:21,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:21,381 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:21,381 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-12 23:18:21,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-12 23:18:21,381 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:21,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:21,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1399226814, now seen corresponding path program 3 times [2021-11-12 23:18:21,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:21,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493786882] [2021-11-12 23:18:21,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:21,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:21,875 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-12 23:18:21,875 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:21,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493786882] [2021-11-12 23:18:21,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493786882] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:21,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:21,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:18:21,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719400208] [2021-11-12 23:18:21,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:21,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:18:21,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:21,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:18:21,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:18:21,877 INFO L87 Difference]: Start difference. First operand 3307 states and 10839 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-12 23:18:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:23,292 INFO L93 Difference]: Finished difference Result 3681 states and 11872 transitions. [2021-11-12 23:18:23,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-12 23:18:23,292 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-12 23:18:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:23,307 INFO L225 Difference]: With dead ends: 3681 [2021-11-12 23:18:23,307 INFO L226 Difference]: Without dead ends: 3577 [2021-11-12 23:18:23,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2021-11-12 23:18:23,309 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 224 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 631.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.36ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 748.58ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:23,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 34 Invalid, 1192 Unknown, 0 Unchecked, 3.36ms Time], IncrementalHoareTripleChecker [35 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 748.58ms Time] [2021-11-12 23:18:23,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3577 states. [2021-11-12 23:18:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3577 to 3438. [2021-11-12 23:18:23,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 3434 states have (on average 3.2725684333139196) internal successors, (11238), 3437 states have internal predecessors, (11238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 11238 transitions. [2021-11-12 23:18:23,423 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 11238 transitions. Word has length 25 [2021-11-12 23:18:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:23,424 INFO L470 AbstractCegarLoop]: Abstraction has 3438 states and 11238 transitions. [2021-11-12 23:18:23,424 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-12 23:18:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 11238 transitions. [2021-11-12 23:18:23,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:23,432 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:23,432 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-12 23:18:23,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-12 23:18:23,432 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:23,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:23,433 INFO L85 PathProgramCache]: Analyzing trace with hash 526981544, now seen corresponding path program 3 times [2021-11-12 23:18:23,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:23,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327104255] [2021-11-12 23:18:23,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:23,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:23,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-12 23:18:23,874 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:23,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327104255] [2021-11-12 23:18:23,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327104255] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:23,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:23,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:18:23,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657083084] [2021-11-12 23:18:23,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:23,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:18:23,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:23,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:18:23,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:18:23,876 INFO L87 Difference]: Start difference. First operand 3438 states and 11238 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-12 23:18:25,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:25,354 INFO L93 Difference]: Finished difference Result 4043 states and 13074 transitions. [2021-11-12 23:18:25,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-12 23:18:25,362 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-12 23:18:25,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:25,378 INFO L225 Difference]: With dead ends: 4043 [2021-11-12 23:18:25,378 INFO L226 Difference]: Without dead ends: 3953 [2021-11-12 23:18:25,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2021-11-12 23:18:25,379 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 284 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 706.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.33ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 847.17ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:25,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 34 Invalid, 1446 Unknown, 0 Unchecked, 3.33ms Time], IncrementalHoareTripleChecker [16 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 847.17ms Time] [2021-11-12 23:18:25,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3953 states. [2021-11-12 23:18:25,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3953 to 3725. [2021-11-12 23:18:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3725 states, 3721 states have (on average 3.2883633431873154) internal successors, (12236), 3724 states have internal predecessors, (12236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3725 states to 3725 states and 12236 transitions. [2021-11-12 23:18:25,531 INFO L78 Accepts]: Start accepts. Automaton has 3725 states and 12236 transitions. Word has length 25 [2021-11-12 23:18:25,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:25,531 INFO L470 AbstractCegarLoop]: Abstraction has 3725 states and 12236 transitions. [2021-11-12 23:18:25,531 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-12 23:18:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3725 states and 12236 transitions. [2021-11-12 23:18:25,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:25,539 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:25,540 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-12 23:18:25,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-12 23:18:25,540 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:25,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:25,541 INFO L85 PathProgramCache]: Analyzing trace with hash -273237358, now seen corresponding path program 4 times [2021-11-12 23:18:25,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:25,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324123640] [2021-11-12 23:18:25,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:25,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:25,952 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-12 23:18:25,952 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:25,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324123640] [2021-11-12 23:18:25,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324123640] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:25,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:25,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:18:25,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864976752] [2021-11-12 23:18:25,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:25,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:18:25,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:25,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:18:25,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:18:25,954 INFO L87 Difference]: Start difference. First operand 3725 states and 12236 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-12 23:18:27,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:27,869 INFO L93 Difference]: Finished difference Result 4036 states and 12986 transitions. [2021-11-12 23:18:27,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-12 23:18:27,869 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-12 23:18:27,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:27,884 INFO L225 Difference]: With dead ends: 4036 [2021-11-12 23:18:27,884 INFO L226 Difference]: Without dead ends: 3946 [2021-11-12 23:18:27,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=217, Invalid=539, Unknown=0, NotChecked=0, Total=756 [2021-11-12 23:18:27,886 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 276 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 2008 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 937.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.22ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1106.22ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:27,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 54 Invalid, 2027 Unknown, 0 Unchecked, 4.22ms Time], IncrementalHoareTripleChecker [19 Valid, 2008 Invalid, 0 Unknown, 0 Unchecked, 1106.22ms Time] [2021-11-12 23:18:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2021-11-12 23:18:28,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3753. [2021-11-12 23:18:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3753 states, 3749 states have (on average 3.2640704187783407) internal successors, (12237), 3752 states have internal predecessors, (12237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 12237 transitions. [2021-11-12 23:18:28,064 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 12237 transitions. Word has length 25 [2021-11-12 23:18:28,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:28,064 INFO L470 AbstractCegarLoop]: Abstraction has 3753 states and 12237 transitions. [2021-11-12 23:18:28,064 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-12 23:18:28,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 12237 transitions. [2021-11-12 23:18:28,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:28,073 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:28,073 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-12 23:18:28,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-12 23:18:28,073 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:28,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:28,074 INFO L85 PathProgramCache]: Analyzing trace with hash 608233720, now seen corresponding path program 5 times [2021-11-12 23:18:28,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:28,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526340696] [2021-11-12 23:18:28,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:28,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:28,548 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-12 23:18:28,548 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:28,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526340696] [2021-11-12 23:18:28,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526340696] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:28,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:28,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:18:28,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294344098] [2021-11-12 23:18:28,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:28,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:18:28,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:28,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:18:28,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:18:28,550 INFO L87 Difference]: Start difference. First operand 3753 states and 12237 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-12 23:18:30,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:30,520 INFO L93 Difference]: Finished difference Result 4120 states and 13230 transitions. [2021-11-12 23:18:30,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-12 23:18:30,521 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-12 23:18:30,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:30,533 INFO L225 Difference]: With dead ends: 4120 [2021-11-12 23:18:30,533 INFO L226 Difference]: Without dead ends: 4016 [2021-11-12 23:18:30,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=247, Invalid=565, Unknown=0, NotChecked=0, Total=812 [2021-11-12 23:18:30,534 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 246 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 1854 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 945.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.14ms SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1123.06ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:30,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 49 Invalid, 1894 Unknown, 0 Unchecked, 4.14ms Time], IncrementalHoareTripleChecker [40 Valid, 1854 Invalid, 0 Unknown, 0 Unchecked, 1123.06ms Time] [2021-11-12 23:18:30,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2021-11-12 23:18:30,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 3879. [2021-11-12 23:18:30,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3879 states, 3875 states have (on average 3.2601290322580647) internal successors, (12633), 3878 states have internal predecessors, (12633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3879 states to 3879 states and 12633 transitions. [2021-11-12 23:18:30,647 INFO L78 Accepts]: Start accepts. Automaton has 3879 states and 12633 transitions. Word has length 25 [2021-11-12 23:18:30,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:30,647 INFO L470 AbstractCegarLoop]: Abstraction has 3879 states and 12633 transitions. [2021-11-12 23:18:30,648 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-12 23:18:30,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3879 states and 12633 transitions. [2021-11-12 23:18:30,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:30,656 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:30,656 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-12 23:18:30,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-12 23:18:30,657 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:30,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:30,657 INFO L85 PathProgramCache]: Analyzing trace with hash -646436194, now seen corresponding path program 6 times [2021-11-12 23:18:30,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:30,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475564340] [2021-11-12 23:18:30,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:30,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:31,099 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-12 23:18:31,099 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:31,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475564340] [2021-11-12 23:18:31,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475564340] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:31,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:31,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:18:31,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962195566] [2021-11-12 23:18:31,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:31,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:18:31,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:31,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:18:31,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:18:31,101 INFO L87 Difference]: Start difference. First operand 3879 states and 12633 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-12 23:18:32,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:32,122 INFO L93 Difference]: Finished difference Result 4114 states and 13234 transitions. [2021-11-12 23:18:32,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-12 23:18:32,123 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-12 23:18:32,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:32,134 INFO L225 Difference]: With dead ends: 4114 [2021-11-12 23:18:32,134 INFO L226 Difference]: Without dead ends: 4024 [2021-11-12 23:18:32,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2021-11-12 23:18:32,136 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 247 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 500.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.58ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 592.43ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:32,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 26 Invalid, 1031 Unknown, 0 Unchecked, 2.58ms Time], IncrementalHoareTripleChecker [19 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 592.43ms Time] [2021-11-12 23:18:32,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2021-11-12 23:18:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3953. [2021-11-12 23:18:32,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3953 states, 3949 states have (on average 3.261078754114966) internal successors, (12878), 3952 states have internal predecessors, (12878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 12878 transitions. [2021-11-12 23:18:32,246 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 12878 transitions. Word has length 25 [2021-11-12 23:18:32,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:32,246 INFO L470 AbstractCegarLoop]: Abstraction has 3953 states and 12878 transitions. [2021-11-12 23:18:32,246 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-12 23:18:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 12878 transitions. [2021-11-12 23:18:32,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:32,255 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:32,255 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-12 23:18:32,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-12 23:18:32,256 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:32,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:32,256 INFO L85 PathProgramCache]: Analyzing trace with hash -117469630, now seen corresponding path program 7 times [2021-11-12 23:18:32,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:32,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937450360] [2021-11-12 23:18:32,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:32,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:32,667 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-12 23:18:32,668 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:32,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937450360] [2021-11-12 23:18:32,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937450360] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:32,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:32,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:18:32,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768293834] [2021-11-12 23:18:32,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:32,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:18:32,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:32,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:18:32,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:18:32,670 INFO L87 Difference]: Start difference. First operand 3953 states and 12878 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-12 23:18:34,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:34,158 INFO L93 Difference]: Finished difference Result 4899 states and 15855 transitions. [2021-11-12 23:18:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-12 23:18:34,159 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-12 23:18:34,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:34,168 INFO L225 Difference]: With dead ends: 4899 [2021-11-12 23:18:34,168 INFO L226 Difference]: Without dead ends: 4809 [2021-11-12 23:18:34,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=471, Unknown=0, NotChecked=0, Total=650 [2021-11-12 23:18:34,169 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 254 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 783.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.37ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 927.32ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:34,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 51 Invalid, 1791 Unknown, 0 Unchecked, 3.37ms Time], IncrementalHoareTripleChecker [13 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 927.32ms Time] [2021-11-12 23:18:34,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2021-11-12 23:18:34,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4445. [2021-11-12 23:18:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4445 states, 4441 states have (on average 3.3051114613825714) internal successors, (14678), 4444 states have internal predecessors, (14678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4445 states to 4445 states and 14678 transitions. [2021-11-12 23:18:34,293 INFO L78 Accepts]: Start accepts. Automaton has 4445 states and 14678 transitions. Word has length 25 [2021-11-12 23:18:34,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:34,293 INFO L470 AbstractCegarLoop]: Abstraction has 4445 states and 14678 transitions. [2021-11-12 23:18:34,294 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-12 23:18:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4445 states and 14678 transitions. [2021-11-12 23:18:34,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:34,305 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:34,305 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-12 23:18:34,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-12 23:18:34,305 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:34,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:34,306 INFO L85 PathProgramCache]: Analyzing trace with hash -917688532, now seen corresponding path program 8 times [2021-11-12 23:18:34,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:34,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518838864] [2021-11-12 23:18:34,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:34,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:34,676 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-12 23:18:34,677 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:34,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518838864] [2021-11-12 23:18:34,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518838864] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:34,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:34,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:18:34,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324489915] [2021-11-12 23:18:34,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:34,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:18:34,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:34,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:18:34,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:18:34,679 INFO L87 Difference]: Start difference. First operand 4445 states and 14678 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-12 23:18:36,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:36,497 INFO L93 Difference]: Finished difference Result 4858 states and 15600 transitions. [2021-11-12 23:18:36,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-12 23:18:36,498 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-12 23:18:36,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:36,507 INFO L225 Difference]: With dead ends: 4858 [2021-11-12 23:18:36,507 INFO L226 Difference]: Without dead ends: 4768 [2021-11-12 23:18:36,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2021-11-12 23:18:36,509 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 202 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 951.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.45ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1127.22ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:36,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 62 Invalid, 2123 Unknown, 0 Unchecked, 4.45ms Time], IncrementalHoareTripleChecker [16 Valid, 2107 Invalid, 0 Unknown, 0 Unchecked, 1127.22ms Time] [2021-11-12 23:18:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4768 states. [2021-11-12 23:18:36,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4768 to 4493. [2021-11-12 23:18:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4493 states, 4489 states have (on average 3.2717754511026955) internal successors, (14687), 4492 states have internal predecessors, (14687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4493 states to 4493 states and 14687 transitions. [2021-11-12 23:18:36,642 INFO L78 Accepts]: Start accepts. Automaton has 4493 states and 14687 transitions. Word has length 25 [2021-11-12 23:18:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:36,643 INFO L470 AbstractCegarLoop]: Abstraction has 4493 states and 14687 transitions. [2021-11-12 23:18:36,643 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-12 23:18:36,643 INFO L276 IsEmpty]: Start isEmpty. Operand 4493 states and 14687 transitions. [2021-11-12 23:18:36,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:36,655 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:36,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] [2021-11-12 23:18:36,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-12 23:18:36,655 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:36,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:36,656 INFO L85 PathProgramCache]: Analyzing trace with hash -36217454, now seen corresponding path program 9 times [2021-11-12 23:18:36,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:36,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092189562] [2021-11-12 23:18:36,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:36,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:37,075 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-12 23:18:37,075 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:37,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092189562] [2021-11-12 23:18:37,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092189562] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:37,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:37,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:18:37,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364653273] [2021-11-12 23:18:37,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:37,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:18:37,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:37,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:18:37,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:18:37,076 INFO L87 Difference]: Start difference. First operand 4493 states and 14687 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-12 23:18:39,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:39,207 INFO L93 Difference]: Finished difference Result 5397 states and 17180 transitions. [2021-11-12 23:18:39,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-12 23:18:39,207 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-12 23:18:39,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:39,218 INFO L225 Difference]: With dead ends: 5397 [2021-11-12 23:18:39,219 INFO L226 Difference]: Without dead ends: 5293 [2021-11-12 23:18:39,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=298, Invalid=694, Unknown=0, NotChecked=0, Total=992 [2021-11-12 23:18:39,220 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 259 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 934.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.14ms SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1109.72ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:39,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 60 Invalid, 1856 Unknown, 0 Unchecked, 5.14ms Time], IncrementalHoareTripleChecker [47 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 1109.72ms Time] [2021-11-12 23:18:39,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5293 states. [2021-11-12 23:18:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 4059. [2021-11-12 23:18:39,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4059 states, 4055 states have (on average 3.28557336621455) internal successors, (13323), 4058 states have internal predecessors, (13323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4059 states to 4059 states and 13323 transitions. [2021-11-12 23:18:39,349 INFO L78 Accepts]: Start accepts. Automaton has 4059 states and 13323 transitions. Word has length 25 [2021-11-12 23:18:39,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:39,350 INFO L470 AbstractCegarLoop]: Abstraction has 4059 states and 13323 transitions. [2021-11-12 23:18:39,350 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-12 23:18:39,350 INFO L276 IsEmpty]: Start isEmpty. Operand 4059 states and 13323 transitions. [2021-11-12 23:18:39,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:39,360 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:39,360 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-12 23:18:39,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-12 23:18:39,361 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:39,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:39,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1589345368, now seen corresponding path program 4 times [2021-11-12 23:18:39,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:39,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359269344] [2021-11-12 23:18:39,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:39,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:39,824 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-12 23:18:39,824 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:39,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359269344] [2021-11-12 23:18:39,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359269344] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:39,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:39,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:18:39,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754360863] [2021-11-12 23:18:39,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:39,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:18:39,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:39,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:18:39,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:18:39,826 INFO L87 Difference]: Start difference. First operand 4059 states and 13323 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-12 23:18:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:41,381 INFO L93 Difference]: Finished difference Result 4813 states and 15520 transitions. [2021-11-12 23:18:41,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-12 23:18:41,381 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-12 23:18:41,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:41,391 INFO L225 Difference]: With dead ends: 4813 [2021-11-12 23:18:41,391 INFO L226 Difference]: Without dead ends: 4723 [2021-11-12 23:18:41,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2021-11-12 23:18:41,392 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 230 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 672.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.21ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 838.63ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:41,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 33 Invalid, 1144 Unknown, 0 Unchecked, 4.21ms Time], IncrementalHoareTripleChecker [18 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 838.63ms Time] [2021-11-12 23:18:41,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4723 states. [2021-11-12 23:18:41,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4723 to 4481. [2021-11-12 23:18:41,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4481 states, 4477 states have (on average 3.274290819745365) internal successors, (14659), 4480 states have internal predecessors, (14659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:41,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4481 states to 4481 states and 14659 transitions. [2021-11-12 23:18:41,511 INFO L78 Accepts]: Start accepts. Automaton has 4481 states and 14659 transitions. Word has length 25 [2021-11-12 23:18:41,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:41,512 INFO L470 AbstractCegarLoop]: Abstraction has 4481 states and 14659 transitions. [2021-11-12 23:18:41,512 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-12 23:18:41,512 INFO L276 IsEmpty]: Start isEmpty. Operand 4481 states and 14659 transitions. [2021-11-12 23:18:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:41,523 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:41,523 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-12 23:18:41,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-12 23:18:41,524 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:41,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:41,524 INFO L85 PathProgramCache]: Analyzing trace with hash -309928026, now seen corresponding path program 5 times [2021-11-12 23:18:41,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:41,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777607639] [2021-11-12 23:18:41,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:41,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:41,988 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-12 23:18:41,988 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:41,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777607639] [2021-11-12 23:18:41,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777607639] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:41,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:41,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:18:41,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462031993] [2021-11-12 23:18:41,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:41,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:18:41,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:41,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:18:41,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:18:41,990 INFO L87 Difference]: Start difference. First operand 4481 states and 14659 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-12 23:18:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:44,155 INFO L93 Difference]: Finished difference Result 5445 states and 17412 transitions. [2021-11-12 23:18:44,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-12 23:18:44,155 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-12 23:18:44,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:44,168 INFO L225 Difference]: With dead ends: 5445 [2021-11-12 23:18:44,168 INFO L226 Difference]: Without dead ends: 5341 [2021-11-12 23:18:44,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=226, Invalid=530, Unknown=0, NotChecked=0, Total=756 [2021-11-12 23:18:44,169 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 288 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1108.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.38ms SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1308.00ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:44,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 49 Invalid, 1863 Unknown, 0 Unchecked, 6.38ms Time], IncrementalHoareTripleChecker [34 Valid, 1829 Invalid, 0 Unknown, 0 Unchecked, 1308.00ms Time] [2021-11-12 23:18:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5341 states. [2021-11-12 23:18:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5341 to 3939. [2021-11-12 23:18:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3939 states, 3935 states have (on average 3.2612452350698855) internal successors, (12833), 3938 states have internal predecessors, (12833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3939 states to 3939 states and 12833 transitions. [2021-11-12 23:18:44,309 INFO L78 Accepts]: Start accepts. Automaton has 3939 states and 12833 transitions. Word has length 25 [2021-11-12 23:18:44,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:44,310 INFO L470 AbstractCegarLoop]: Abstraction has 3939 states and 12833 transitions. [2021-11-12 23:18:44,310 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-12 23:18:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3939 states and 12833 transitions. [2021-11-12 23:18:44,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:44,319 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:44,320 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-12 23:18:44,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-12 23:18:44,320 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:44,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:44,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1886760970, now seen corresponding path program 6 times [2021-11-12 23:18:44,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:44,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432699209] [2021-11-12 23:18:44,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:44,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:44,754 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-12 23:18:44,755 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:44,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432699209] [2021-11-12 23:18:44,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432699209] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:44,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:44,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:18:44,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240962209] [2021-11-12 23:18:44,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:44,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:18:44,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:44,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:18:44,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:18:44,757 INFO L87 Difference]: Start difference. First operand 3939 states and 12833 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-12 23:18:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:46,000 INFO L93 Difference]: Finished difference Result 4295 states and 13888 transitions. [2021-11-12 23:18:46,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-12 23:18:46,000 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-12 23:18:46,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:46,009 INFO L225 Difference]: With dead ends: 4295 [2021-11-12 23:18:46,010 INFO L226 Difference]: Without dead ends: 4205 [2021-11-12 23:18:46,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2021-11-12 23:18:46,011 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 177 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 673.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.02ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 807.65ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:46,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 37 Invalid, 1262 Unknown, 0 Unchecked, 4.02ms Time], IncrementalHoareTripleChecker [12 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 807.65ms Time] [2021-11-12 23:18:46,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4205 states. [2021-11-12 23:18:46,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4205 to 4085. [2021-11-12 23:18:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4085 states, 4081 states have (on average 3.2577799558931635) internal successors, (13295), 4084 states have internal predecessors, (13295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 13295 transitions. [2021-11-12 23:18:46,184 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 13295 transitions. Word has length 25 [2021-11-12 23:18:46,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:46,185 INFO L470 AbstractCegarLoop]: Abstraction has 4085 states and 13295 transitions. [2021-11-12 23:18:46,185 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-12 23:18:46,185 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 13295 transitions. [2021-11-12 23:18:46,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:46,195 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:46,195 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-12 23:18:46,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-12 23:18:46,195 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:46,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:46,196 INFO L85 PathProgramCache]: Analyzing trace with hash 508932932, now seen corresponding path program 7 times [2021-11-12 23:18:46,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:46,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850166639] [2021-11-12 23:18:46,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:46,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:46,679 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-12 23:18:46,679 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:46,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850166639] [2021-11-12 23:18:46,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850166639] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:46,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:46,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:18:46,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129026995] [2021-11-12 23:18:46,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:46,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:18:46,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:46,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:18:46,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:18:46,683 INFO L87 Difference]: Start difference. First operand 4085 states and 13295 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-12 23:18:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:48,663 INFO L93 Difference]: Finished difference Result 5059 states and 16198 transitions. [2021-11-12 23:18:48,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-12 23:18:48,664 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-12 23:18:48,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:48,678 INFO L225 Difference]: With dead ends: 5059 [2021-11-12 23:18:48,678 INFO L226 Difference]: Without dead ends: 4955 [2021-11-12 23:18:48,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2021-11-12 23:18:48,680 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 220 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 1813 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 956.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.52ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1140.31ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:48,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 51 Invalid, 1838 Unknown, 0 Unchecked, 5.52ms Time], IncrementalHoareTripleChecker [25 Valid, 1813 Invalid, 0 Unknown, 0 Unchecked, 1140.31ms Time] [2021-11-12 23:18:48,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4955 states. [2021-11-12 23:18:48,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4955 to 3699. [2021-11-12 23:18:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3699 states, 3695 states have (on average 3.2673883626522326) internal successors, (12073), 3698 states have internal predecessors, (12073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3699 states to 3699 states and 12073 transitions. [2021-11-12 23:18:48,792 INFO L78 Accepts]: Start accepts. Automaton has 3699 states and 12073 transitions. Word has length 25 [2021-11-12 23:18:48,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:48,792 INFO L470 AbstractCegarLoop]: Abstraction has 3699 states and 12073 transitions. [2021-11-12 23:18:48,793 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-12 23:18:48,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3699 states and 12073 transitions. [2021-11-12 23:18:48,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:48,800 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:48,801 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-12 23:18:48,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-12 23:18:48,801 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:48,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:48,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1060951752, now seen corresponding path program 8 times [2021-11-12 23:18:48,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:48,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961536845] [2021-11-12 23:18:48,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:48,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:49,319 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-12 23:18:49,320 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:49,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961536845] [2021-11-12 23:18:49,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961536845] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:49,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:49,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:18:49,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14060989] [2021-11-12 23:18:49,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:49,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:18:49,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:49,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:18:49,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:18:49,322 INFO L87 Difference]: Start difference. First operand 3699 states and 12073 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-12 23:18:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:51,729 INFO L93 Difference]: Finished difference Result 4587 states and 14573 transitions. [2021-11-12 23:18:51,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-12 23:18:51,730 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-12 23:18:51,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:51,739 INFO L225 Difference]: With dead ends: 4587 [2021-11-12 23:18:51,739 INFO L226 Difference]: Without dead ends: 4483 [2021-11-12 23:18:51,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=264, Invalid=666, Unknown=0, NotChecked=0, Total=930 [2021-11-12 23:18:51,740 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 277 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1215.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.46ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1432.05ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:51,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 63 Invalid, 2111 Unknown, 0 Unchecked, 6.46ms Time], IncrementalHoareTripleChecker [36 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 1432.05ms Time] [2021-11-12 23:18:51,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4483 states. [2021-11-12 23:18:51,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4483 to 3473. [2021-11-12 23:18:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3473 states, 3469 states have (on average 3.237244162582877) internal successors, (11230), 3472 states have internal predecessors, (11230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 11230 transitions. [2021-11-12 23:18:51,814 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 11230 transitions. Word has length 25 [2021-11-12 23:18:51,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:51,815 INFO L470 AbstractCegarLoop]: Abstraction has 3473 states and 11230 transitions. [2021-11-12 23:18:51,815 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-12 23:18:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 11230 transitions. [2021-11-12 23:18:51,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:51,821 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:51,822 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-12 23:18:51,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-12 23:18:51,822 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:51,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:51,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2008237116, now seen corresponding path program 10 times [2021-11-12 23:18:51,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:51,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176712877] [2021-11-12 23:18:51,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:51,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:52,239 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-12 23:18:52,239 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:52,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176712877] [2021-11-12 23:18:52,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176712877] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:52,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:52,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:18:52,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563371024] [2021-11-12 23:18:52,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:52,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:18:52,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:52,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:18:52,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:18:52,242 INFO L87 Difference]: Start difference. First operand 3473 states and 11230 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-12 23:18:53,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:53,676 INFO L93 Difference]: Finished difference Result 3934 states and 12628 transitions. [2021-11-12 23:18:53,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-12 23:18:53,677 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-12 23:18:53,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:53,685 INFO L225 Difference]: With dead ends: 3934 [2021-11-12 23:18:53,685 INFO L226 Difference]: Without dead ends: 3844 [2021-11-12 23:18:53,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2021-11-12 23:18:53,686 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 234 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 735.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.90ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 874.35ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:53,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 52 Invalid, 1497 Unknown, 0 Unchecked, 3.90ms Time], IncrementalHoareTripleChecker [13 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 874.35ms Time] [2021-11-12 23:18:53,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3844 states. [2021-11-12 23:18:53,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3844 to 3774. [2021-11-12 23:18:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3774 states, 3770 states have (on average 3.2374005305039786) internal successors, (12205), 3773 states have internal predecessors, (12205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:53,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 12205 transitions. [2021-11-12 23:18:53,786 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 12205 transitions. Word has length 25 [2021-11-12 23:18:53,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:53,786 INFO L470 AbstractCegarLoop]: Abstraction has 3774 states and 12205 transitions. [2021-11-12 23:18:53,786 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-12 23:18:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 12205 transitions. [2021-11-12 23:18:53,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:53,792 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:53,792 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-12 23:18:53,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-12 23:18:53,793 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:53,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:53,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1271036838, now seen corresponding path program 11 times [2021-11-12 23:18:53,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:53,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812915133] [2021-11-12 23:18:53,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:53,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:54,218 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-12 23:18:54,218 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:54,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812915133] [2021-11-12 23:18:54,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812915133] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:54,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:54,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:18:54,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910435391] [2021-11-12 23:18:54,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:54,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:18:54,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:54,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:18:54,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:18:54,220 INFO L87 Difference]: Start difference. First operand 3774 states and 12205 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-12 23:18:56,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:56,078 INFO L93 Difference]: Finished difference Result 4018 states and 12882 transitions. [2021-11-12 23:18:56,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-12 23:18:56,079 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-12 23:18:56,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:56,087 INFO L225 Difference]: With dead ends: 4018 [2021-11-12 23:18:56,087 INFO L226 Difference]: Without dead ends: 3928 [2021-11-12 23:18:56,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2021-11-12 23:18:56,088 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 218 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 954.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.58ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1136.23ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:56,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 61 Invalid, 1833 Unknown, 0 Unchecked, 5.58ms Time], IncrementalHoareTripleChecker [11 Valid, 1822 Invalid, 0 Unknown, 0 Unchecked, 1136.23ms Time] [2021-11-12 23:18:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3928 states. [2021-11-12 23:18:56,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3928 to 3837. [2021-11-12 23:18:56,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3837 states, 3833 states have (on average 3.2334985650926167) internal successors, (12394), 3836 states have internal predecessors, (12394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 12394 transitions. [2021-11-12 23:18:56,171 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 12394 transitions. Word has length 25 [2021-11-12 23:18:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:56,171 INFO L470 AbstractCegarLoop]: Abstraction has 3837 states and 12394 transitions. [2021-11-12 23:18:56,172 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-12 23:18:56,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 12394 transitions. [2021-11-12 23:18:56,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:56,180 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:56,180 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-12 23:18:56,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-12 23:18:56,181 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:56,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:56,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2142459380, now seen corresponding path program 12 times [2021-11-12 23:18:56,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:56,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350890554] [2021-11-12 23:18:56,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:56,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:18:56,717 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-12 23:18:56,717 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:18:56,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350890554] [2021-11-12 23:18:56,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350890554] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:18:56,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:18:56,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:18:56,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045081348] [2021-11-12 23:18:56,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:18:56,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:18:56,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:56,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:18:56,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:18:56,719 INFO L87 Difference]: Start difference. First operand 3837 states and 12394 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-12 23:18:59,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:18:59,701 INFO L93 Difference]: Finished difference Result 4641 states and 14747 transitions. [2021-11-12 23:18:59,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-12 23:18:59,701 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-12 23:18:59,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:18:59,711 INFO L225 Difference]: With dead ends: 4641 [2021-11-12 23:18:59,711 INFO L226 Difference]: Without dead ends: 4537 [2021-11-12 23:18:59,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2021-11-12 23:18:59,712 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 272 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 2224 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1307.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 2267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.20ms SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1546.32ms IncrementalHoareTripleChecker+Time [2021-11-12 23:18:59,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 78 Invalid, 2267 Unknown, 0 Unchecked, 7.20ms Time], IncrementalHoareTripleChecker [43 Valid, 2224 Invalid, 0 Unknown, 0 Unchecked, 1546.32ms Time] [2021-11-12 23:18:59,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4537 states. [2021-11-12 23:18:59,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4537 to 3543. [2021-11-12 23:18:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3543 states, 3539 states have (on average 3.252331166996327) internal successors, (11510), 3542 states have internal predecessors, (11510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 11510 transitions. [2021-11-12 23:18:59,791 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 11510 transitions. Word has length 25 [2021-11-12 23:18:59,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:18:59,791 INFO L470 AbstractCegarLoop]: Abstraction has 3543 states and 11510 transitions. [2021-11-12 23:18:59,791 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-12 23:18:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 11510 transitions. [2021-11-12 23:18:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:18:59,798 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:18:59,798 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-12 23:18:59,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-12 23:18:59,798 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:18:59,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:18:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1271533662, now seen corresponding path program 13 times [2021-11-12 23:18:59,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:18:59,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806524359] [2021-11-12 23:18:59,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:18:59,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:18:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:00,206 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-12 23:19:00,207 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:00,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806524359] [2021-11-12 23:19:00,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806524359] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:00,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:00,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:19:00,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429111868] [2021-11-12 23:19:00,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:00,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:19:00,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:00,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:19:00,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:19:00,208 INFO L87 Difference]: Start difference. First operand 3543 states and 11510 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-12 23:19:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:01,607 INFO L93 Difference]: Finished difference Result 3717 states and 11830 transitions. [2021-11-12 23:19:01,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-12 23:19:01,608 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-12 23:19:01,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:01,617 INFO L225 Difference]: With dead ends: 3717 [2021-11-12 23:19:01,617 INFO L226 Difference]: Without dead ends: 3627 [2021-11-12 23:19:01,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2021-11-12 23:19:01,618 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 200 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 806.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.46ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 959.53ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:01,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 60 Invalid, 1602 Unknown, 0 Unchecked, 4.46ms Time], IncrementalHoareTripleChecker [12 Valid, 1590 Invalid, 0 Unknown, 0 Unchecked, 959.53ms Time] [2021-11-12 23:19:01,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3627 states. [2021-11-12 23:19:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3627 to 3557. [2021-11-12 23:19:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3553 states have (on average 3.210526315789474) internal successors, (11407), 3556 states have internal predecessors, (11407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 11407 transitions. [2021-11-12 23:19:01,692 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 11407 transitions. Word has length 25 [2021-11-12 23:19:01,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:01,693 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 11407 transitions. [2021-11-12 23:19:01,693 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-12 23:19:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 11407 transitions. [2021-11-12 23:19:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:19:01,699 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:01,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] [2021-11-12 23:19:01,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-12 23:19:01,700 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:19:01,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:01,701 INFO L85 PathProgramCache]: Analyzing trace with hash -390062584, now seen corresponding path program 14 times [2021-11-12 23:19:01,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:01,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458168605] [2021-11-12 23:19:01,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:01,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:02,058 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-12 23:19:02,058 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:02,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458168605] [2021-11-12 23:19:02,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458168605] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:02,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:02,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:19:02,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318833516] [2021-11-12 23:19:02,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:02,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:19:02,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:02,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:19:02,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:19:02,060 INFO L87 Difference]: Start difference. First operand 3557 states and 11407 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-12 23:19:04,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:04,573 INFO L93 Difference]: Finished difference Result 4522 states and 14276 transitions. [2021-11-12 23:19:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-12 23:19:04,574 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-12 23:19:04,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:04,582 INFO L225 Difference]: With dead ends: 4522 [2021-11-12 23:19:04,582 INFO L226 Difference]: Without dead ends: 4411 [2021-11-12 23:19:04,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=312, Invalid=680, Unknown=0, NotChecked=0, Total=992 [2021-11-12 23:19:04,584 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 247 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 1893 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1052.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.82ms SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1247.73ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:04,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 70 Invalid, 1942 Unknown, 0 Unchecked, 5.82ms Time], IncrementalHoareTripleChecker [49 Valid, 1893 Invalid, 0 Unknown, 0 Unchecked, 1247.73ms Time] [2021-11-12 23:19:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4411 states. [2021-11-12 23:19:04,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4411 to 3137. [2021-11-12 23:19:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3137 states, 3133 states have (on average 3.219597829556336) internal successors, (10087), 3136 states have internal predecessors, (10087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 10087 transitions. [2021-11-12 23:19:04,684 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 10087 transitions. Word has length 25 [2021-11-12 23:19:04,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:04,684 INFO L470 AbstractCegarLoop]: Abstraction has 3137 states and 10087 transitions. [2021-11-12 23:19:04,684 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-12 23:19:04,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 10087 transitions. [2021-11-12 23:19:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:04,689 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:04,689 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-12 23:19:04,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-12 23:19:04,690 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:19:04,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:04,690 INFO L85 PathProgramCache]: Analyzing trace with hash 870726772, now seen corresponding path program 1 times [2021-11-12 23:19:04,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:04,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337157627] [2021-11-12 23:19:04,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:04,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:05,457 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-12 23:19:05,458 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:05,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337157627] [2021-11-12 23:19:05,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337157627] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:05,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:05,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:19:05,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024075094] [2021-11-12 23:19:05,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:05,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:19:05,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:05,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:19:05,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:19:05,460 INFO L87 Difference]: Start difference. First operand 3137 states and 10087 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-12 23:19:07,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:07,000 INFO L93 Difference]: Finished difference Result 4659 states and 15196 transitions. [2021-11-12 23:19:07,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-12 23:19:07,001 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-12 23:19:07,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:07,009 INFO L225 Difference]: With dead ends: 4659 [2021-11-12 23:19:07,009 INFO L226 Difference]: Without dead ends: 4659 [2021-11-12 23:19:07,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2021-11-12 23:19:07,010 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 251 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 1811 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 865.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.92ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1021.86ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:07,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 29 Invalid, 1847 Unknown, 0 Unchecked, 4.92ms Time], IncrementalHoareTripleChecker [36 Valid, 1811 Invalid, 0 Unknown, 0 Unchecked, 1021.86ms Time] [2021-11-12 23:19:07,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4659 states. [2021-11-12 23:19:07,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4659 to 3620. [2021-11-12 23:19:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3620 states, 3616 states have (on average 3.2303650442477876) internal successors, (11681), 3619 states have internal predecessors, (11681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:07,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 3620 states and 11681 transitions. [2021-11-12 23:19:07,079 INFO L78 Accepts]: Start accepts. Automaton has 3620 states and 11681 transitions. Word has length 27 [2021-11-12 23:19:07,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:07,079 INFO L470 AbstractCegarLoop]: Abstraction has 3620 states and 11681 transitions. [2021-11-12 23:19:07,079 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-12 23:19:07,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 11681 transitions. [2021-11-12 23:19:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:07,083 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:07,083 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-12 23:19:07,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-12 23:19:07,083 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-12 23:19:07,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:07,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1265588036, now seen corresponding path program 1 times [2021-11-12 23:19:07,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:07,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90114308] [2021-11-12 23:19:07,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:07,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:07,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-12 23:19:07,897 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:07,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90114308] [2021-11-12 23:19:07,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90114308] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:07,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:07,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:19:07,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296044264] [2021-11-12 23:19:07,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:07,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-12 23:19:07,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:07,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-12 23:19:07,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-11-12 23:19:07,899 INFO L87 Difference]: Start difference. First operand 3620 states and 11681 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-12 23:19:09,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:09,662 INFO L93 Difference]: Finished difference Result 5135 states and 16771 transitions. [2021-11-12 23:19:09,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-12 23:19:09,663 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-12 23:19:09,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:09,672 INFO L225 Difference]: With dead ends: 5135 [2021-11-12 23:19:09,672 INFO L226 Difference]: Without dead ends: 5135 [2021-11-12 23:19:09,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2021-11-12 23:19:09,673 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 294 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 870.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.00ms SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1030.75ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:09,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 28 Invalid, 1878 Unknown, 0 Unchecked, 5.00ms Time], IncrementalHoareTripleChecker [45 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 1030.75ms Time] [2021-11-12 23:19:09,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2021-11-12 23:19:09,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 3790. [2021-11-12 23:19:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3790 states, 3786 states have (on average 3.2271526677231908) internal successors, (12218), 3789 states have internal predecessors, (12218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 12218 transitions. [2021-11-12 23:19:09,749 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 12218 transitions. Word has length 27 [2021-11-12 23:19:09,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:09,749 INFO L470 AbstractCegarLoop]: Abstraction has 3790 states and 12218 transitions. [2021-11-12 23:19:09,749 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-12 23:19:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 12218 transitions. [2021-11-12 23:19:09,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:09,753 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:09,753 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-12 23:19:09,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-12 23:19:09,754 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:19:09,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:09,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1349697430, now seen corresponding path program 2 times [2021-11-12 23:19:09,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:09,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968156180] [2021-11-12 23:19:09,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:09,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:10,296 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-12 23:19:10,297 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:10,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968156180] [2021-11-12 23:19:10,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968156180] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:10,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:10,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:19:10,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656565244] [2021-11-12 23:19:10,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:10,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:19:10,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:10,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:19:10,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:19:10,298 INFO L87 Difference]: Start difference. First operand 3790 states and 12218 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-12 23:19:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:12,219 INFO L93 Difference]: Finished difference Result 6634 states and 21538 transitions. [2021-11-12 23:19:12,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-12 23:19:12,220 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-12 23:19:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:12,240 INFO L225 Difference]: With dead ends: 6634 [2021-11-12 23:19:12,240 INFO L226 Difference]: Without dead ends: 6634 [2021-11-12 23:19:12,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2021-11-12 23:19:12,241 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 287 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1064.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.99ms SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1242.78ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:12,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 37 Invalid, 1949 Unknown, 0 Unchecked, 5.99ms Time], IncrementalHoareTripleChecker [39 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 1242.78ms Time] [2021-11-12 23:19:12,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6634 states. [2021-11-12 23:19:12,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6634 to 4401. [2021-11-12 23:19:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4401 states, 4397 states have (on average 3.2494882874687288) internal successors, (14288), 4400 states have internal predecessors, (14288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4401 states to 4401 states and 14288 transitions. [2021-11-12 23:19:12,342 INFO L78 Accepts]: Start accepts. Automaton has 4401 states and 14288 transitions. Word has length 27 [2021-11-12 23:19:12,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:12,342 INFO L470 AbstractCegarLoop]: Abstraction has 4401 states and 14288 transitions. [2021-11-12 23:19:12,342 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-12 23:19:12,342 INFO L276 IsEmpty]: Start isEmpty. Operand 4401 states and 14288 transitions. [2021-11-12 23:19:12,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:12,348 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:12,348 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-12 23:19:12,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-12 23:19:12,349 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:19:12,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:12,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1349697429, now seen corresponding path program 1 times [2021-11-12 23:19:12,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:12,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165905115] [2021-11-12 23:19:12,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:12,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:13,022 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-12 23:19:13,022 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:13,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165905115] [2021-11-12 23:19:13,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165905115] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:13,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:13,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:19:13,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280462420] [2021-11-12 23:19:13,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:13,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-12 23:19:13,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:13,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-12 23:19:13,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-11-12 23:19:13,024 INFO L87 Difference]: Start difference. First operand 4401 states and 14288 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-12 23:19:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:14,783 INFO L93 Difference]: Finished difference Result 6544 states and 21200 transitions. [2021-11-12 23:19:14,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-12 23:19:14,783 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-12 23:19:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:14,797 INFO L225 Difference]: With dead ends: 6544 [2021-11-12 23:19:14,797 INFO L226 Difference]: Without dead ends: 6544 [2021-11-12 23:19:14,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2021-11-12 23:19:14,798 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 292 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 1992 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 886.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 2031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.04ms SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1049.55ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:14,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 37 Invalid, 2031 Unknown, 0 Unchecked, 4.04ms Time], IncrementalHoareTripleChecker [39 Valid, 1992 Invalid, 0 Unknown, 0 Unchecked, 1049.55ms Time] [2021-11-12 23:19:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6544 states. [2021-11-12 23:19:14,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6544 to 3925. [2021-11-12 23:19:14,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3925 states, 3921 states have (on average 3.219331803111451) internal successors, (12623), 3924 states have internal predecessors, (12623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 12623 transitions. [2021-11-12 23:19:14,884 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 12623 transitions. Word has length 27 [2021-11-12 23:19:14,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:14,884 INFO L470 AbstractCegarLoop]: Abstraction has 3925 states and 12623 transitions. [2021-11-12 23:19:14,885 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-12 23:19:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 12623 transitions. [2021-11-12 23:19:14,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:14,913 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:14,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, 1, 1] [2021-11-12 23:19:14,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-12 23:19:14,913 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:19:14,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:14,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1773206164, now seen corresponding path program 2 times [2021-11-12 23:19:14,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:14,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378293232] [2021-11-12 23:19:14,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:14,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:15,452 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-12 23:19:15,452 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:15,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378293232] [2021-11-12 23:19:15,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378293232] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:15,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:15,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:19:15,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53979267] [2021-11-12 23:19:15,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:15,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:19:15,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:15,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:19:15,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:19:15,454 INFO L87 Difference]: Start difference. First operand 3925 states and 12623 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 23:19:16,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:16,795 INFO L93 Difference]: Finished difference Result 6564 states and 21361 transitions. [2021-11-12 23:19:16,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-12 23:19:16,795 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 23:19:16,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:16,809 INFO L225 Difference]: With dead ends: 6564 [2021-11-12 23:19:16,809 INFO L226 Difference]: Without dead ends: 6564 [2021-11-12 23:19:16,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2021-11-12 23:19:16,810 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 292 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 786.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.02ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 934.24ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:16,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 61 Invalid, 1711 Unknown, 0 Unchecked, 4.02ms Time], IncrementalHoareTripleChecker [25 Valid, 1686 Invalid, 0 Unknown, 0 Unchecked, 934.24ms Time] [2021-11-12 23:19:16,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6564 states. [2021-11-12 23:19:16,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6564 to 4621. [2021-11-12 23:19:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4621 states, 4617 states have (on average 3.213991769547325) internal successors, (14839), 4620 states have internal predecessors, (14839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4621 states to 4621 states and 14839 transitions. [2021-11-12 23:19:16,904 INFO L78 Accepts]: Start accepts. Automaton has 4621 states and 14839 transitions. Word has length 27 [2021-11-12 23:19:16,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:16,905 INFO L470 AbstractCegarLoop]: Abstraction has 4621 states and 14839 transitions. [2021-11-12 23:19:16,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 23:19:16,905 INFO L276 IsEmpty]: Start isEmpty. Operand 4621 states and 14839 transitions. [2021-11-12 23:19:16,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:16,909 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:16,909 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-12 23:19:16,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-12 23:19:16,909 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-12 23:19:16,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:16,909 INFO L85 PathProgramCache]: Analyzing trace with hash 181029646, now seen corresponding path program 3 times [2021-11-12 23:19:16,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:16,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964401387] [2021-11-12 23:19:16,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:16,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:17,636 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-12 23:19:17,636 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:17,636 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964401387] [2021-11-12 23:19:17,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964401387] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:17,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:17,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:19:17,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943100245] [2021-11-12 23:19:17,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:17,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-12 23:19:17,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:17,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-12 23:19:17,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-11-12 23:19:17,638 INFO L87 Difference]: Start difference. First operand 4621 states and 14839 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-12 23:19:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:19,603 INFO L93 Difference]: Finished difference Result 6969 states and 22603 transitions. [2021-11-12 23:19:19,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-12 23:19:19,603 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-12 23:19:19,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:19,617 INFO L225 Difference]: With dead ends: 6969 [2021-11-12 23:19:19,617 INFO L226 Difference]: Without dead ends: 6969 [2021-11-12 23:19:19,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2021-11-12 23:19:19,621 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 304 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 995.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.65ms SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1172.73ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:19,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 50 Invalid, 1968 Unknown, 0 Unchecked, 4.65ms Time], IncrementalHoareTripleChecker [38 Valid, 1930 Invalid, 0 Unknown, 0 Unchecked, 1172.73ms Time] [2021-11-12 23:19:19,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6969 states. [2021-11-12 23:19:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6969 to 4861. [2021-11-12 23:19:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4861 states, 4857 states have (on average 3.203417747580811) internal successors, (15559), 4860 states have internal predecessors, (15559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:19,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4861 states to 4861 states and 15559 transitions. [2021-11-12 23:19:19,736 INFO L78 Accepts]: Start accepts. Automaton has 4861 states and 15559 transitions. Word has length 27 [2021-11-12 23:19:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:19,736 INFO L470 AbstractCegarLoop]: Abstraction has 4861 states and 15559 transitions. [2021-11-12 23:19:19,736 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-12 23:19:19,736 INFO L276 IsEmpty]: Start isEmpty. Operand 4861 states and 15559 transitions. [2021-11-12 23:19:19,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:19,741 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:19,741 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-12 23:19:19,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-12 23:19:19,741 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:19:19,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:19,741 INFO L85 PathProgramCache]: Analyzing trace with hash -30189192, now seen corresponding path program 4 times [2021-11-12 23:19:19,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:19,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105721246] [2021-11-12 23:19:19,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:19,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:20,389 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-12 23:19:20,389 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:20,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105721246] [2021-11-12 23:19:20,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105721246] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:20,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:20,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-12 23:19:20,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510809718] [2021-11-12 23:19:20,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:20,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-12 23:19:20,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:20,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-12 23:19:20,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-11-12 23:19:20,391 INFO L87 Difference]: Start difference. First operand 4861 states and 15559 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-12 23:19:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:22,726 INFO L93 Difference]: Finished difference Result 8151 states and 26602 transitions. [2021-11-12 23:19:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-12 23:19:22,727 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-12 23:19:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:22,742 INFO L225 Difference]: With dead ends: 8151 [2021-11-12 23:19:22,743 INFO L226 Difference]: Without dead ends: 8151 [2021-11-12 23:19:22,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=226, Invalid=896, Unknown=0, NotChecked=0, Total=1122 [2021-11-12 23:19:22,744 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 389 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 2794 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1207.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.49ms SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1464.96ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:22,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 77 Invalid, 2838 Unknown, 0 Unchecked, 5.49ms Time], IncrementalHoareTripleChecker [44 Valid, 2794 Invalid, 0 Unknown, 0 Unchecked, 1464.96ms Time] [2021-11-12 23:19:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8151 states. [2021-11-12 23:19:22,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8151 to 5069. [2021-11-12 23:19:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5069 states, 5065 states have (on average 3.2017769002961503) internal successors, (16217), 5068 states have internal predecessors, (16217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:22,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5069 states to 5069 states and 16217 transitions. [2021-11-12 23:19:22,839 INFO L78 Accepts]: Start accepts. Automaton has 5069 states and 16217 transitions. Word has length 27 [2021-11-12 23:19:22,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:22,840 INFO L470 AbstractCegarLoop]: Abstraction has 5069 states and 16217 transitions. [2021-11-12 23:19:22,840 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-12 23:19:22,840 INFO L276 IsEmpty]: Start isEmpty. Operand 5069 states and 16217 transitions. [2021-11-12 23:19:22,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:22,845 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:22,845 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-12 23:19:22,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-12 23:19:22,845 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-12 23:19:22,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:22,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2102982276, now seen corresponding path program 5 times [2021-11-12 23:19:22,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:22,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688630083] [2021-11-12 23:19:22,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:22,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:23,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-12 23:19:23,410 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:23,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688630083] [2021-11-12 23:19:23,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688630083] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:23,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:23,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:19:23,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018345142] [2021-11-12 23:19:23,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:23,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:19:23,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:23,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:19:23,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:19:23,412 INFO L87 Difference]: Start difference. First operand 5069 states and 16217 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-12 23:19:25,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:25,188 INFO L93 Difference]: Finished difference Result 6764 states and 21915 transitions. [2021-11-12 23:19:25,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-12 23:19:25,189 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-12 23:19:25,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:25,202 INFO L225 Difference]: With dead ends: 6764 [2021-11-12 23:19:25,202 INFO L226 Difference]: Without dead ends: 6764 [2021-11-12 23:19:25,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2021-11-12 23:19:25,203 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 236 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 2238 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1021.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 2270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.72ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1205.21ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:25,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 52 Invalid, 2270 Unknown, 0 Unchecked, 4.72ms Time], IncrementalHoareTripleChecker [32 Valid, 2238 Invalid, 0 Unknown, 0 Unchecked, 1205.21ms Time] [2021-11-12 23:19:25,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6764 states. [2021-11-12 23:19:25,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6764 to 5605. [2021-11-12 23:19:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5605 states, 5601 states have (on average 3.224781289055526) internal successors, (18062), 5604 states have internal predecessors, (18062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5605 states to 5605 states and 18062 transitions. [2021-11-12 23:19:25,348 INFO L78 Accepts]: Start accepts. Automaton has 5605 states and 18062 transitions. Word has length 27 [2021-11-12 23:19:25,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:25,349 INFO L470 AbstractCegarLoop]: Abstraction has 5605 states and 18062 transitions. [2021-11-12 23:19:25,349 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-12 23:19:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 5605 states and 18062 transitions. [2021-11-12 23:19:25,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:25,353 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:25,354 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-12 23:19:25,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-12 23:19:25,354 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-12 23:19:25,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:25,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2102982277, now seen corresponding path program 2 times [2021-11-12 23:19:25,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:25,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994903713] [2021-11-12 23:19:25,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:25,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:26,120 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-12 23:19:26,120 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:26,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994903713] [2021-11-12 23:19:26,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994903713] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:26,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:26,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:19:26,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570791674] [2021-11-12 23:19:26,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:26,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-12 23:19:26,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:26,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-12 23:19:26,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-11-12 23:19:26,122 INFO L87 Difference]: Start difference. First operand 5605 states and 18062 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-12 23:19:28,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:28,020 INFO L93 Difference]: Finished difference Result 6674 states and 21577 transitions. [2021-11-12 23:19:28,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-12 23:19:28,020 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-12 23:19:28,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:28,033 INFO L225 Difference]: With dead ends: 6674 [2021-11-12 23:19:28,033 INFO L226 Difference]: Without dead ends: 6674 [2021-11-12 23:19:28,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2021-11-12 23:19:28,034 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 241 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1014.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 2362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.51ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1200.10ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:28,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 52 Invalid, 2362 Unknown, 0 Unchecked, 4.51ms Time], IncrementalHoareTripleChecker [32 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 1200.10ms Time] [2021-11-12 23:19:28,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2021-11-12 23:19:28,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 5129. [2021-11-12 23:19:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5129 states, 5125 states have (on average 3.1994146341463416) internal successors, (16397), 5128 states have internal predecessors, (16397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5129 states to 5129 states and 16397 transitions. [2021-11-12 23:19:28,130 INFO L78 Accepts]: Start accepts. Automaton has 5129 states and 16397 transitions. Word has length 27 [2021-11-12 23:19:28,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:28,131 INFO L470 AbstractCegarLoop]: Abstraction has 5129 states and 16397 transitions. [2021-11-12 23:19:28,131 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-12 23:19:28,131 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 16397 transitions. [2021-11-12 23:19:28,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:28,137 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:28,137 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-12 23:19:28,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-12 23:19:28,137 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:19:28,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:28,138 INFO L85 PathProgramCache]: Analyzing trace with hash -661257944, now seen corresponding path program 6 times [2021-11-12 23:19:28,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:28,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44379300] [2021-11-12 23:19:28,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:28,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:28,860 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-12 23:19:28,860 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:28,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44379300] [2021-11-12 23:19:28,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44379300] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:28,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:28,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:19:28,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059398708] [2021-11-12 23:19:28,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:28,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-12 23:19:28,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:28,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-12 23:19:28,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-11-12 23:19:28,862 INFO L87 Difference]: Start difference. First operand 5129 states and 16397 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-12 23:19:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:30,608 INFO L93 Difference]: Finished difference Result 7993 states and 25709 transitions. [2021-11-12 23:19:30,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-12 23:19:30,611 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-12 23:19:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:30,629 INFO L225 Difference]: With dead ends: 7993 [2021-11-12 23:19:30,629 INFO L226 Difference]: Without dead ends: 7993 [2021-11-12 23:19:30,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2021-11-12 23:19:30,630 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 314 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 2132 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 935.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 2171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.64ms SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1109.14ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:30,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 61 Invalid, 2171 Unknown, 0 Unchecked, 4.64ms Time], IncrementalHoareTripleChecker [39 Valid, 2132 Invalid, 0 Unknown, 0 Unchecked, 1109.14ms Time] [2021-11-12 23:19:30,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7993 states. [2021-11-12 23:19:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7993 to 5609. [2021-11-12 23:19:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5609 states, 5605 states have (on average 3.182337198929527) internal successors, (17837), 5608 states have internal predecessors, (17837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5609 states to 5609 states and 17837 transitions. [2021-11-12 23:19:30,752 INFO L78 Accepts]: Start accepts. Automaton has 5609 states and 17837 transitions. Word has length 27 [2021-11-12 23:19:30,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:30,753 INFO L470 AbstractCegarLoop]: Abstraction has 5609 states and 17837 transitions. [2021-11-12 23:19:30,753 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-12 23:19:30,753 INFO L276 IsEmpty]: Start isEmpty. Operand 5609 states and 17837 transitions. [2021-11-12 23:19:30,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:30,759 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:30,759 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-12 23:19:30,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-12 23:19:30,759 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:19:30,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:30,759 INFO L85 PathProgramCache]: Analyzing trace with hash -872476782, now seen corresponding path program 7 times [2021-11-12 23:19:30,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:30,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498577924] [2021-11-12 23:19:30,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:30,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:31,381 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-12 23:19:31,381 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:31,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498577924] [2021-11-12 23:19:31,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498577924] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:31,381 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:31,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-12 23:19:31,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227663636] [2021-11-12 23:19:31,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:31,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-12 23:19:31,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:31,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-12 23:19:31,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-11-12 23:19:31,383 INFO L87 Difference]: Start difference. First operand 5609 states and 17837 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-12 23:19:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:33,909 INFO L93 Difference]: Finished difference Result 9153 states and 29669 transitions. [2021-11-12 23:19:33,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-12 23:19:33,909 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-12 23:19:33,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:33,929 INFO L225 Difference]: With dead ends: 9153 [2021-11-12 23:19:33,930 INFO L226 Difference]: Without dead ends: 9153 [2021-11-12 23:19:33,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=225, Invalid=897, Unknown=0, NotChecked=0, Total=1122 [2021-11-12 23:19:33,931 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 375 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 2966 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1333.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 3007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.83ms SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1588.29ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:33,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 84 Invalid, 3007 Unknown, 0 Unchecked, 5.83ms Time], IncrementalHoareTripleChecker [41 Valid, 2966 Invalid, 0 Unknown, 0 Unchecked, 1588.29ms Time] [2021-11-12 23:19:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9153 states. [2021-11-12 23:19:34,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9153 to 5309. [2021-11-12 23:19:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5309 states, 5305 states have (on average 3.1926484448633365) internal successors, (16937), 5308 states have internal predecessors, (16937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5309 states to 5309 states and 16937 transitions. [2021-11-12 23:19:34,061 INFO L78 Accepts]: Start accepts. Automaton has 5309 states and 16937 transitions. Word has length 27 [2021-11-12 23:19:34,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:34,061 INFO L470 AbstractCegarLoop]: Abstraction has 5309 states and 16937 transitions. [2021-11-12 23:19:34,061 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-12 23:19:34,061 INFO L276 IsEmpty]: Start isEmpty. Operand 5309 states and 16937 transitions. [2021-11-12 23:19:34,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:34,067 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:34,067 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-12 23:19:34,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-12 23:19:34,067 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:19:34,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:34,068 INFO L85 PathProgramCache]: Analyzing trace with hash 617321208, now seen corresponding path program 3 times [2021-11-12 23:19:34,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:34,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25574534] [2021-11-12 23:19:34,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:34,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:34,558 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-12 23:19:34,558 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:34,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25574534] [2021-11-12 23:19:34,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25574534] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:34,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:34,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:19:34,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403863784] [2021-11-12 23:19:34,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:34,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:19:34,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:34,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:19:34,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:19:34,560 INFO L87 Difference]: Start difference. First operand 5309 states and 16937 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 23:19:36,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:36,086 INFO L93 Difference]: Finished difference Result 7579 states and 24420 transitions. [2021-11-12 23:19:36,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-12 23:19:36,086 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 23:19:36,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:36,102 INFO L225 Difference]: With dead ends: 7579 [2021-11-12 23:19:36,103 INFO L226 Difference]: Without dead ends: 7579 [2021-11-12 23:19:36,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2021-11-12 23:19:36,103 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 280 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 1946 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 922.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.08ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1091.60ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:36,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 72 Invalid, 1969 Unknown, 0 Unchecked, 4.08ms Time], IncrementalHoareTripleChecker [23 Valid, 1946 Invalid, 0 Unknown, 0 Unchecked, 1091.60ms Time] [2021-11-12 23:19:36,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7579 states. [2021-11-12 23:19:36,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7579 to 5073. [2021-11-12 23:19:36,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5073 states, 5069 states have (on average 3.2016176760702306) internal successors, (16229), 5072 states have internal predecessors, (16229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5073 states to 5073 states and 16229 transitions. [2021-11-12 23:19:36,214 INFO L78 Accepts]: Start accepts. Automaton has 5073 states and 16229 transitions. Word has length 27 [2021-11-12 23:19:36,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:36,214 INFO L470 AbstractCegarLoop]: Abstraction has 5073 states and 16229 transitions. [2021-11-12 23:19:36,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 23:19:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 5073 states and 16229 transitions. [2021-11-12 23:19:36,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:36,219 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:36,219 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-12 23:19:36,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-12 23:19:36,220 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-12 23:19:36,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:36,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1563686678, now seen corresponding path program 4 times [2021-11-12 23:19:36,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:36,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855331662] [2021-11-12 23:19:36,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:36,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:36,839 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-12 23:19:36,839 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:36,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855331662] [2021-11-12 23:19:36,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855331662] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:36,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:36,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:19:36,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326827657] [2021-11-12 23:19:36,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:36,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:19:36,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:36,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:19:36,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:19:36,841 INFO L87 Difference]: Start difference. First operand 5073 states and 16229 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 23:19:38,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:38,287 INFO L93 Difference]: Finished difference Result 7339 states and 23700 transitions. [2021-11-12 23:19:38,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-12 23:19:38,288 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 23:19:38,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:38,303 INFO L225 Difference]: With dead ends: 7339 [2021-11-12 23:19:38,303 INFO L226 Difference]: Without dead ends: 7339 [2021-11-12 23:19:38,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2021-11-12 23:19:38,304 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 317 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 839.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.09ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 999.86ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:38,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 65 Invalid, 1803 Unknown, 0 Unchecked, 4.09ms Time], IncrementalHoareTripleChecker [21 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 999.86ms Time] [2021-11-12 23:19:38,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7339 states. [2021-11-12 23:19:38,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7339 to 4713. [2021-11-12 23:19:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4713 states, 4709 states have (on average 3.2170312168188575) internal successors, (15149), 4712 states have internal predecessors, (15149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:38,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4713 states to 4713 states and 15149 transitions. [2021-11-12 23:19:38,454 INFO L78 Accepts]: Start accepts. Automaton has 4713 states and 15149 transitions. Word has length 27 [2021-11-12 23:19:38,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:38,454 INFO L470 AbstractCegarLoop]: Abstraction has 4713 states and 15149 transitions. [2021-11-12 23:19:38,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 23:19:38,454 INFO L276 IsEmpty]: Start isEmpty. Operand 4713 states and 15149 transitions. [2021-11-12 23:19:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:38,460 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:38,460 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-12 23:19:38,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-12 23:19:38,460 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:19:38,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:38,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2036187864, now seen corresponding path program 5 times [2021-11-12 23:19:38,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:38,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085305868] [2021-11-12 23:19:38,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:38,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:38,967 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-12 23:19:38,967 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:38,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085305868] [2021-11-12 23:19:38,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085305868] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:38,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:38,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:19:38,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557845167] [2021-11-12 23:19:38,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:38,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:19:38,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:38,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:19:38,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:19:38,969 INFO L87 Difference]: Start difference. First operand 4713 states and 15149 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 23:19:40,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:40,353 INFO L93 Difference]: Finished difference Result 6619 states and 21679 transitions. [2021-11-12 23:19:40,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-12 23:19:40,353 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 23:19:40,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:40,366 INFO L225 Difference]: With dead ends: 6619 [2021-11-12 23:19:40,366 INFO L226 Difference]: Without dead ends: 6619 [2021-11-12 23:19:40,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2021-11-12 23:19:40,367 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 324 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 821.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.16ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 975.77ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:40,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 63 Invalid, 1846 Unknown, 0 Unchecked, 4.16ms Time], IncrementalHoareTripleChecker [25 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 975.77ms Time] [2021-11-12 23:19:40,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6619 states. [2021-11-12 23:19:40,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6619 to 5621. [2021-11-12 23:19:40,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5621 states, 5617 states have (on average 3.2469289656400213) internal successors, (18238), 5620 states have internal predecessors, (18238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5621 states to 5621 states and 18238 transitions. [2021-11-12 23:19:40,466 INFO L78 Accepts]: Start accepts. Automaton has 5621 states and 18238 transitions. Word has length 27 [2021-11-12 23:19:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:40,466 INFO L470 AbstractCegarLoop]: Abstraction has 5621 states and 18238 transitions. [2021-11-12 23:19:40,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 23:19:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 5621 states and 18238 transitions. [2021-11-12 23:19:40,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:40,471 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:40,471 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-12 23:19:40,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-12 23:19:40,472 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-12 23:19:40,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:40,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2036187865, now seen corresponding path program 1 times [2021-11-12 23:19:40,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:40,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728606034] [2021-11-12 23:19:40,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:40,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:40,954 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-12 23:19:40,955 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:40,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728606034] [2021-11-12 23:19:40,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728606034] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:40,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:40,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:19:40,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212946416] [2021-11-12 23:19:40,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:40,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:19:40,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:40,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:19:40,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:19:40,956 INFO L87 Difference]: Start difference. First operand 5621 states and 18238 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 23:19:42,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:42,368 INFO L93 Difference]: Finished difference Result 6619 states and 21540 transitions. [2021-11-12 23:19:42,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-12 23:19:42,369 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 23:19:42,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:42,381 INFO L225 Difference]: With dead ends: 6619 [2021-11-12 23:19:42,381 INFO L226 Difference]: Without dead ends: 6619 [2021-11-12 23:19:42,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2021-11-12 23:19:42,382 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 323 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 1813 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 842.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.02ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 995.74ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:42,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 63 Invalid, 1836 Unknown, 0 Unchecked, 4.02ms Time], IncrementalHoareTripleChecker [23 Valid, 1813 Invalid, 0 Unknown, 0 Unchecked, 995.74ms Time] [2021-11-12 23:19:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6619 states. [2021-11-12 23:19:42,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6619 to 4593. [2021-11-12 23:19:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4593 states, 4589 states have (on average 3.2227064719982565) internal successors, (14789), 4592 states have internal predecessors, (14789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4593 states to 4593 states and 14789 transitions. [2021-11-12 23:19:42,468 INFO L78 Accepts]: Start accepts. Automaton has 4593 states and 14789 transitions. Word has length 27 [2021-11-12 23:19:42,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:42,468 INFO L470 AbstractCegarLoop]: Abstraction has 4593 states and 14789 transitions. [2021-11-12 23:19:42,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 23:19:42,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 14789 transitions. [2021-11-12 23:19:42,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:42,473 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:42,474 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-12 23:19:42,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-12 23:19:42,474 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:19:42,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:42,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1332004532, now seen corresponding path program 6 times [2021-11-12 23:19:42,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:42,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656072620] [2021-11-12 23:19:42,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:42,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:42,913 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-12 23:19:42,913 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:42,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656072620] [2021-11-12 23:19:42,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656072620] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:42,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:42,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:19:42,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846171230] [2021-11-12 23:19:42,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:42,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:19:42,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:42,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:19:42,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:19:42,915 INFO L87 Difference]: Start difference. First operand 4593 states and 14789 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 23:19:44,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:44,434 INFO L93 Difference]: Finished difference Result 6938 states and 22699 transitions. [2021-11-12 23:19:44,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-12 23:19:44,435 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 23:19:44,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:44,449 INFO L225 Difference]: With dead ends: 6938 [2021-11-12 23:19:44,449 INFO L226 Difference]: Without dead ends: 6938 [2021-11-12 23:19:44,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2021-11-12 23:19:44,450 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 372 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 2064 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 905.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 2090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.57ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1077.67ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:44,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 71 Invalid, 2090 Unknown, 0 Unchecked, 4.57ms Time], IncrementalHoareTripleChecker [26 Valid, 2064 Invalid, 0 Unknown, 0 Unchecked, 1077.67ms Time] [2021-11-12 23:19:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6938 states. [2021-11-12 23:19:44,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6938 to 4502. [2021-11-12 23:19:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4502 states, 4498 states have (on average 3.2258781680746997) internal successors, (14510), 4501 states have internal predecessors, (14510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4502 states to 4502 states and 14510 transitions. [2021-11-12 23:19:44,538 INFO L78 Accepts]: Start accepts. Automaton has 4502 states and 14510 transitions. Word has length 27 [2021-11-12 23:19:44,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:44,538 INFO L470 AbstractCegarLoop]: Abstraction has 4502 states and 14510 transitions. [2021-11-12 23:19:44,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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-12 23:19:44,538 INFO L276 IsEmpty]: Start isEmpty. Operand 4502 states and 14510 transitions. [2021-11-12 23:19:44,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:44,565 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:44,565 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-12 23:19:44,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-12 23:19:44,565 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-12 23:19:44,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2033459362, now seen corresponding path program 8 times [2021-11-12 23:19:44,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:44,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913205482] [2021-11-12 23:19:44,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:44,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:45,155 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-12 23:19:45,156 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:45,156 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913205482] [2021-11-12 23:19:45,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913205482] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:45,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:45,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:19:45,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750635337] [2021-11-12 23:19:45,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:45,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:19:45,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:45,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:19:45,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:19:45,157 INFO L87 Difference]: Start difference. First operand 4502 states and 14510 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-12 23:19:46,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:46,879 INFO L93 Difference]: Finished difference Result 6702 states and 21922 transitions. [2021-11-12 23:19:46,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-12 23:19:46,879 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-12 23:19:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:46,892 INFO L225 Difference]: With dead ends: 6702 [2021-11-12 23:19:46,892 INFO L226 Difference]: Without dead ends: 6702 [2021-11-12 23:19:46,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2021-11-12 23:19:46,893 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 352 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 947.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.69ms SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1125.04ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:46,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 84 Invalid, 2174 Unknown, 0 Unchecked, 4.69ms Time], IncrementalHoareTripleChecker [31 Valid, 2143 Invalid, 0 Unknown, 0 Unchecked, 1125.04ms Time] [2021-11-12 23:19:46,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6702 states. [2021-11-12 23:19:46,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6702 to 5584. [2021-11-12 23:19:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5584 states, 5580 states have (on average 3.2474910394265235) internal successors, (18121), 5583 states have internal predecessors, (18121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5584 states to 5584 states and 18121 transitions. [2021-11-12 23:19:46,989 INFO L78 Accepts]: Start accepts. Automaton has 5584 states and 18121 transitions. Word has length 27 [2021-11-12 23:19:46,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:46,990 INFO L470 AbstractCegarLoop]: Abstraction has 5584 states and 18121 transitions. [2021-11-12 23:19:46,990 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-12 23:19:46,990 INFO L276 IsEmpty]: Start isEmpty. Operand 5584 states and 18121 transitions. [2021-11-12 23:19:46,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:46,994 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:46,995 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-12 23:19:46,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-12 23:19:46,995 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-12 23:19:46,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:46,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2033459363, now seen corresponding path program 3 times [2021-11-12 23:19:46,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:46,995 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767147399] [2021-11-12 23:19:46,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:46,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:47,840 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-12 23:19:47,840 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:47,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767147399] [2021-11-12 23:19:47,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767147399] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:47,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:47,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-12 23:19:47,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362740672] [2021-11-12 23:19:47,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:47,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-12 23:19:47,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:47,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-12 23:19:47,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-11-12 23:19:47,842 INFO L87 Difference]: Start difference. First operand 5584 states and 18121 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-12 23:19:49,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:49,625 INFO L93 Difference]: Finished difference Result 7154 states and 23376 transitions. [2021-11-12 23:19:49,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-12 23:19:49,625 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-12 23:19:49,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:49,639 INFO L225 Difference]: With dead ends: 7154 [2021-11-12 23:19:49,639 INFO L226 Difference]: Without dead ends: 7154 [2021-11-12 23:19:49,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2021-11-12 23:19:49,640 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 370 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 1992 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 865.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.14ms SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1028.55ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:49,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 61 Invalid, 2039 Unknown, 0 Unchecked, 4.14ms Time], IncrementalHoareTripleChecker [47 Valid, 1992 Invalid, 0 Unknown, 0 Unchecked, 1028.55ms Time] [2021-11-12 23:19:49,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7154 states. [2021-11-12 23:19:49,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7154 to 5566. [2021-11-12 23:19:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5566 states, 5562 states have (on average 3.24829198130169) internal successors, (18067), 5565 states have internal predecessors, (18067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5566 states to 5566 states and 18067 transitions. [2021-11-12 23:19:49,739 INFO L78 Accepts]: Start accepts. Automaton has 5566 states and 18067 transitions. Word has length 27 [2021-11-12 23:19:49,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:49,740 INFO L470 AbstractCegarLoop]: Abstraction has 5566 states and 18067 transitions. [2021-11-12 23:19:49,740 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-12 23:19:49,740 INFO L276 IsEmpty]: Start isEmpty. Operand 5566 states and 18067 transitions. [2021-11-12 23:19:49,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:49,748 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:49,748 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-12 23:19:49,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-12 23:19:49,749 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-12 23:19:49,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:49,749 INFO L85 PathProgramCache]: Analyzing trace with hash -2041371251, now seen corresponding path program 4 times [2021-11-12 23:19:49,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:49,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702146037] [2021-11-12 23:19:49,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:49,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:50,337 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-12 23:19:50,338 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:50,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702146037] [2021-11-12 23:19:50,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702146037] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:50,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:50,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-12 23:19:50,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635544862] [2021-11-12 23:19:50,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:50,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-12 23:19:50,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:50,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-12 23:19:50,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-11-12 23:19:50,341 INFO L87 Difference]: Start difference. First operand 5566 states and 18067 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-12 23:19:52,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:52,885 INFO L93 Difference]: Finished difference Result 7895 states and 25768 transitions. [2021-11-12 23:19:52,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-12 23:19:52,886 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-12 23:19:52,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:52,907 INFO L225 Difference]: With dead ends: 7895 [2021-11-12 23:19:52,907 INFO L226 Difference]: Without dead ends: 7895 [2021-11-12 23:19:52,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=225, Invalid=897, Unknown=0, NotChecked=0, Total=1122 [2021-11-12 23:19:52,908 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 349 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 3266 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1409.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.02ms SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1665.23ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:52,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 96 Invalid, 3299 Unknown, 0 Unchecked, 6.02ms Time], IncrementalHoareTripleChecker [33 Valid, 3266 Invalid, 0 Unknown, 0 Unchecked, 1665.23ms Time] [2021-11-12 23:19:52,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7895 states. [2021-11-12 23:19:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7895 to 4436. [2021-11-12 23:19:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4436 states, 4432 states have (on average 3.229241877256318) internal successors, (14312), 4435 states have internal predecessors, (14312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4436 states to 4436 states and 14312 transitions. [2021-11-12 23:19:53,013 INFO L78 Accepts]: Start accepts. Automaton has 4436 states and 14312 transitions. Word has length 27 [2021-11-12 23:19:53,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:53,014 INFO L470 AbstractCegarLoop]: Abstraction has 4436 states and 14312 transitions. [2021-11-12 23:19:53,014 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-12 23:19:53,014 INFO L276 IsEmpty]: Start isEmpty. Operand 4436 states and 14312 transitions. [2021-11-12 23:19:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:53,018 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:53,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, 1, 1] [2021-11-12 23:19:53,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-12 23:19:53,019 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-12 23:19:53,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1615230328, now seen corresponding path program 9 times [2021-11-12 23:19:53,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:53,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635474197] [2021-11-12 23:19:53,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:53,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:53,605 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-12 23:19:53,606 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:53,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635474197] [2021-11-12 23:19:53,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635474197] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:53,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:53,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:19:53,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631152951] [2021-11-12 23:19:53,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:53,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:19:53,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:53,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:19:53,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:19:53,607 INFO L87 Difference]: Start difference. First operand 4436 states and 14312 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-12 23:19:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:55,333 INFO L93 Difference]: Finished difference Result 6472 states and 21103 transitions. [2021-11-12 23:19:55,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-12 23:19:55,334 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-12 23:19:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:55,346 INFO L225 Difference]: With dead ends: 6472 [2021-11-12 23:19:55,346 INFO L226 Difference]: Without dead ends: 6472 [2021-11-12 23:19:55,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2021-11-12 23:19:55,347 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 344 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 968.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 2196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.43ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1145.52ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:55,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 86 Invalid, 2196 Unknown, 0 Unchecked, 4.43ms Time], IncrementalHoareTripleChecker [35 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 1145.52ms Time] [2021-11-12 23:19:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6472 states. [2021-11-12 23:19:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6472 to 4436. [2021-11-12 23:19:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4436 states, 4432 states have (on average 3.229241877256318) internal successors, (14312), 4435 states have internal predecessors, (14312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4436 states to 4436 states and 14312 transitions. [2021-11-12 23:19:55,451 INFO L78 Accepts]: Start accepts. Automaton has 4436 states and 14312 transitions. Word has length 27 [2021-11-12 23:19:55,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:55,451 INFO L470 AbstractCegarLoop]: Abstraction has 4436 states and 14312 transitions. [2021-11-12 23:19:55,451 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-12 23:19:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 4436 states and 14312 transitions. [2021-11-12 23:19:55,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:55,454 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:55,455 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-12 23:19:55,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-12 23:19:55,455 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-12 23:19:55,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:55,455 INFO L85 PathProgramCache]: Analyzing trace with hash -100858492, now seen corresponding path program 10 times [2021-11-12 23:19:55,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:55,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319049648] [2021-11-12 23:19:55,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:55,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:56,055 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-12 23:19:56,056 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:56,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319049648] [2021-11-12 23:19:56,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319049648] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:56,056 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:56,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-12 23:19:56,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165591756] [2021-11-12 23:19:56,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:56,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-12 23:19:56,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:56,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-12 23:19:56,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-11-12 23:19:56,057 INFO L87 Difference]: Start difference. First operand 4436 states and 14312 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-12 23:19:58,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:58,486 INFO L93 Difference]: Finished difference Result 6906 states and 22561 transitions. [2021-11-12 23:19:58,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-12 23:19:58,487 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-12 23:19:58,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:58,500 INFO L225 Difference]: With dead ends: 6906 [2021-11-12 23:19:58,500 INFO L226 Difference]: Without dead ends: 6906 [2021-11-12 23:19:58,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2021-11-12 23:19:58,501 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 414 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 2776 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1263.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.73ms SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1490.63ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:58,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [414 Valid, 94 Invalid, 2817 Unknown, 0 Unchecked, 5.73ms Time], IncrementalHoareTripleChecker [41 Valid, 2776 Invalid, 0 Unknown, 0 Unchecked, 1490.63ms Time] [2021-11-12 23:19:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6906 states. [2021-11-12 23:19:58,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6906 to 4451. [2021-11-12 23:19:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4451 states, 4447 states have (on average 3.230267596132224) internal successors, (14365), 4450 states have internal predecessors, (14365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:58,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4451 states to 4451 states and 14365 transitions. [2021-11-12 23:19:58,590 INFO L78 Accepts]: Start accepts. Automaton has 4451 states and 14365 transitions. Word has length 27 [2021-11-12 23:19:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:58,590 INFO L470 AbstractCegarLoop]: Abstraction has 4451 states and 14365 transitions. [2021-11-12 23:19:58,590 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-12 23:19:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 4451 states and 14365 transitions. [2021-11-12 23:19:58,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:19:58,594 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:58,594 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-12 23:19:58,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-12 23:19:58,594 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:19:58,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:58,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1249361408, now seen corresponding path program 11 times [2021-11-12 23:19:58,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:58,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024940913] [2021-11-12 23:19:58,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:58,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:59,084 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-12 23:19:59,084 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:59,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024940913] [2021-11-12 23:19:59,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024940913] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:19:59,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:19:59,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:19:59,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766400868] [2021-11-12 23:19:59,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:19:59,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:19:59,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:59,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:19:59,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:19:59,085 INFO L87 Difference]: Start difference. First operand 4451 states and 14365 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-12 23:20:00,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:20:00,861 INFO L93 Difference]: Finished difference Result 6457 states and 21175 transitions. [2021-11-12 23:20:00,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-12 23:20:00,862 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-12 23:20:00,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:20:00,874 INFO L225 Difference]: With dead ends: 6457 [2021-11-12 23:20:00,874 INFO L226 Difference]: Without dead ends: 6457 [2021-11-12 23:20:00,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2021-11-12 23:20:00,875 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 299 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 2299 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1001.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 2324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.63ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1187.99ms IncrementalHoareTripleChecker+Time [2021-11-12 23:20:00,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 87 Invalid, 2324 Unknown, 0 Unchecked, 4.63ms Time], IncrementalHoareTripleChecker [25 Valid, 2299 Invalid, 0 Unknown, 0 Unchecked, 1187.99ms Time] [2021-11-12 23:20:00,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6457 states. [2021-11-12 23:20:00,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6457 to 5219. [2021-11-12 23:20:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5219 states, 5215 states have (on average 3.2625119846596355) internal successors, (17014), 5218 states have internal predecessors, (17014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:20:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5219 states to 5219 states and 17014 transitions. [2021-11-12 23:20:00,970 INFO L78 Accepts]: Start accepts. Automaton has 5219 states and 17014 transitions. Word has length 27 [2021-11-12 23:20:00,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:20:00,970 INFO L470 AbstractCegarLoop]: Abstraction has 5219 states and 17014 transitions. [2021-11-12 23:20:00,970 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-12 23:20:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 5219 states and 17014 transitions. [2021-11-12 23:20:00,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:20:00,975 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:20:00,975 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-12 23:20:00,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-12 23:20:00,975 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-12 23:20:00,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:20:00,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1249361407, now seen corresponding path program 5 times [2021-11-12 23:20:00,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:20:00,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716215668] [2021-11-12 23:20:00,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:20:00,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:20:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:20:01,848 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-12 23:20:01,848 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:20:01,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716215668] [2021-11-12 23:20:01,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716215668] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:20:01,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:20:01,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-12 23:20:01,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794427771] [2021-11-12 23:20:01,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:20:01,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-12 23:20:01,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:20:01,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-12 23:20:01,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-11-12 23:20:01,850 INFO L87 Difference]: Start difference. First operand 5219 states and 17014 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-12 23:20:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:20:03,985 INFO L93 Difference]: Finished difference Result 6921 states and 22665 transitions. [2021-11-12 23:20:03,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-12 23:20:03,985 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-12 23:20:03,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:20:03,999 INFO L225 Difference]: With dead ends: 6921 [2021-11-12 23:20:03,999 INFO L226 Difference]: Without dead ends: 6921 [2021-11-12 23:20:04,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2021-11-12 23:20:04,001 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 300 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1121.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.37ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1332.20ms IncrementalHoareTripleChecker+Time [2021-11-12 23:20:04,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 81 Invalid, 2610 Unknown, 0 Unchecked, 5.37ms Time], IncrementalHoareTripleChecker [35 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 1332.20ms Time] [2021-11-12 23:20:04,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6921 states. [2021-11-12 23:20:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6921 to 5219. [2021-11-12 23:20:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5219 states, 5215 states have (on average 3.2625119846596355) internal successors, (17014), 5218 states have internal predecessors, (17014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:20:04,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5219 states to 5219 states and 17014 transitions. [2021-11-12 23:20:04,100 INFO L78 Accepts]: Start accepts. Automaton has 5219 states and 17014 transitions. Word has length 27 [2021-11-12 23:20:04,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:20:04,100 INFO L470 AbstractCegarLoop]: Abstraction has 5219 states and 17014 transitions. [2021-11-12 23:20:04,100 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-12 23:20:04,100 INFO L276 IsEmpty]: Start isEmpty. Operand 5219 states and 17014 transitions. [2021-11-12 23:20:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:20:04,104 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:20:04,104 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-12 23:20:04,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-12 23:20:04,105 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-12 23:20:04,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:20:04,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1029224725, now seen corresponding path program 6 times [2021-11-12 23:20:04,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:20:04,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131620261] [2021-11-12 23:20:04,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:20:04,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:20:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:20:04,694 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-12 23:20:04,694 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:20:04,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131620261] [2021-11-12 23:20:04,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131620261] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:20:04,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:20:04,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-12 23:20:04,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772701398] [2021-11-12 23:20:04,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:20:04,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-12 23:20:04,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:20:04,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-12 23:20:04,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-11-12 23:20:04,696 INFO L87 Difference]: Start difference. First operand 5219 states and 17014 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-12 23:20:07,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:20:07,171 INFO L93 Difference]: Finished difference Result 7927 states and 25973 transitions. [2021-11-12 23:20:07,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-12 23:20:07,172 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-12 23:20:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:20:07,187 INFO L225 Difference]: With dead ends: 7927 [2021-11-12 23:20:07,187 INFO L226 Difference]: Without dead ends: 7927 [2021-11-12 23:20:07,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=225, Invalid=897, Unknown=0, NotChecked=0, Total=1122 [2021-11-12 23:20:07,189 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 346 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 3162 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1353.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 3194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.52ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1603.48ms IncrementalHoareTripleChecker+Time [2021-11-12 23:20:07,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 94 Invalid, 3194 Unknown, 0 Unchecked, 6.52ms Time], IncrementalHoareTripleChecker [32 Valid, 3162 Invalid, 0 Unknown, 0 Unchecked, 1603.48ms Time] [2021-11-12 23:20:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7927 states. [2021-11-12 23:20:07,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7927 to 4011. [2021-11-12 23:20:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4011 states, 4007 states have (on average 3.250561517344647) internal successors, (13025), 4010 states have internal predecessors, (13025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:20:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4011 states to 4011 states and 13025 transitions. [2021-11-12 23:20:07,317 INFO L78 Accepts]: Start accepts. Automaton has 4011 states and 13025 transitions. Word has length 27 [2021-11-12 23:20:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:20:07,318 INFO L470 AbstractCegarLoop]: Abstraction has 4011 states and 13025 transitions. [2021-11-12 23:20:07,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-12 23:20:07,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4011 states and 13025 transitions. [2021-11-12 23:20:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-12 23:20:07,323 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:20:07,323 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-12 23:20:07,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-12 23:20:07,323 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-12 23:20:07,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:20:07,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1706790793, now seen corresponding path program 1 times [2021-11-12 23:20:07,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:20:07,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514400616] [2021-11-12 23:20:07,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:20:07,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:20:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:20:08,070 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-12 23:20:08,070 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:20:08,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514400616] [2021-11-12 23:20:08,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514400616] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:20:08,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293792863] [2021-11-12 23:20:08,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:20:08,071 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:20:08,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:20:08,072 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:20:08,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-12 23:20:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:20:08,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 76 conjunts are in the unsatisfiable core [2021-11-12 23:20:08,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:20:08,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:20:08,290 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-12 23:20:08,291 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 61 treesize of output 47 [2021-11-12 23:20:08,300 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 72 treesize of output 70 [2021-11-12 23:20:08,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:20:08,523 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-12 23:20:08,523 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-12 23:20:08,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:20:08,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-12 23:20:08,868 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-12 23:20:08,868 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-12 23:20:08,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:20:08,981 INFO L354 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2021-11-12 23:20:08,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 109 [2021-11-12 23:20:09,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:20:09,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:20:09,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:20:09,051 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 40 treesize of output 24 [2021-11-12 23:20:09,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:20:09,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:20:09,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:20:09,088 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 69 treesize of output 35 [2021-11-12 23:20:09,865 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-11-12 23:20:09,865 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-12 23:20:09,906 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-12 23:20:09,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:20:59,273 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-12 23:20:59,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293792863] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:20:59,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1606979071] [2021-11-12 23:20:59,283 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-12 23:20:59,296 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:20:59,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 38 [2021-11-12 23:20:59,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190993800] [2021-11-12 23:20:59,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:20:59,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-12 23:20:59,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:20:59,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-12 23:20:59,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1407, Unknown=16, NotChecked=0, Total=1560 [2021-11-12 23:20:59,298 INFO L87 Difference]: Start difference. First operand 4011 states and 13025 transitions. Second operand has 40 states, 39 states have (on average 2.1794871794871793) internal successors, (85), 39 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:21:04,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:04,307 INFO L93 Difference]: Finished difference Result 7528 states and 24797 transitions. [2021-11-12 23:21:04,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-12 23:21:04,307 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.1794871794871793) internal successors, (85), 39 states have internal predecessors, (85), 0 states have call successors, (0), 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-12 23:21:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:04,324 INFO L225 Difference]: With dead ends: 7528 [2021-11-12 23:21:04,325 INFO L226 Difference]: Without dead ends: 7528 [2021-11-12 23:21:04,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 51.6s TimeCoverageRelationStatistics Valid=412, Invalid=2542, Unknown=16, NotChecked=0, Total=2970 [2021-11-12 23:21:04,326 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 503 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 3361 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2306.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 5246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.43ms SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1851 IncrementalHoareTripleChecker+Unchecked, 2703.61ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:04,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [503 Valid, 171 Invalid, 5246 Unknown, 0 Unchecked, 11.43ms Time], IncrementalHoareTripleChecker [34 Valid, 3361 Invalid, 0 Unknown, 1851 Unchecked, 2703.61ms Time] [2021-11-12 23:21:04,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7528 states. [2021-11-12 23:21:04,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7528 to 4584. [2021-11-12 23:21:04,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4584 states, 4580 states have (on average 3.286681222707424) internal successors, (15053), 4583 states have internal predecessors, (15053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:21:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 15053 transitions. [2021-11-12 23:21:04,434 INFO L78 Accepts]: Start accepts. Automaton has 4584 states and 15053 transitions. Word has length 29 [2021-11-12 23:21:04,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:04,434 INFO L470 AbstractCegarLoop]: Abstraction has 4584 states and 15053 transitions. [2021-11-12 23:21:04,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.1794871794871793) internal successors, (85), 39 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:21:04,434 INFO L276 IsEmpty]: Start isEmpty. Operand 4584 states and 15053 transitions. [2021-11-12 23:21:04,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-12 23:21:04,438 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:04,438 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-12 23:21:04,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-12 23:21:04,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-11-12 23:21:04,639 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-12 23:21:04,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:04,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1706790792, now seen corresponding path program 1 times [2021-11-12 23:21:04,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:04,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762531322] [2021-11-12 23:21:04,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:04,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:05,614 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-12 23:21:05,614 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:05,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762531322] [2021-11-12 23:21:05,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762531322] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:21:05,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174759344] [2021-11-12 23:21:05,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:05,615 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:21:05,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:21:05,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:21:05,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-12 23:21:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:05,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 76 conjunts are in the unsatisfiable core [2021-11-12 23:21:05,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:21:05,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:21:05,755 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-12 23:21:05,756 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 61 treesize of output 47 [2021-11-12 23:21:05,763 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 294 treesize of output 278 [2021-11-12 23:21:05,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:21:05,949 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-12 23:21:05,949 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-12 23:21:06,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:21:06,286 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-12 23:21:06,299 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-12 23:21:06,300 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-12 23:21:06,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:21:06,417 INFO L354 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2021-11-12 23:21:06,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 109 [2021-11-12 23:21:06,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:21:06,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:21:06,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:21:06,504 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 46 treesize of output 30 [2021-11-12 23:21:06,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:21:06,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:21:06,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:21:06,531 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-12 23:21:06,531 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 92 treesize of output 48 [2021-11-12 23:21:07,448 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-11-12 23:21:07,448 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 100 treesize of output 58 [2021-11-12 23:21:07,487 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-12 23:21:07,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:21:35,916 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_writer_fnThread1of1ForFork1_ring_enqueue_~x#1_141| Int)) (or (and (forall ((|v_ULTIMATE.start_main_#t~pre34#1_72| Int) (|aux_mod_writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1_66| Int) (|ULTIMATE.start_main_~#writer~0#1.offset| Int)) (or (<= (let ((.cse0 (select (let ((.cse1 (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~pre34#1_72|)))) (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| (let ((.cse3 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (store (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) |v_writer_fnThread1of1ForFork1_ring_enqueue_~x#1_141|)) .cse3 (+ (mod |aux_mod_writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1_66| 4) (- 4)))))) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| (* (select .cse0 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|) 4) 4))) 8) (= |aux_mod_writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1_66| 0) (<= 4 |aux_mod_writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1_66|) (< |aux_mod_writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1_66| 0))) (forall ((|v_ULTIMATE.start_main_#t~pre34#1_72| Int) (|ULTIMATE.start_main_~#writer~0#1.offset| Int) (|writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| Int)) (let ((.cse9 (+ |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| 1))) (let ((.cse8 (mod .cse9 4))) (or (<= (let ((.cse4 (select (let ((.cse5 (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~pre34#1_72|)))) (store .cse5 |c_ULTIMATE.start_main_~#r~3#1.base| (let ((.cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (store (let ((.cse6 (select .cse5 |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_fnThread1of1ForFork1_ring_enqueue_~x#1_141|)) .cse7 .cse8)))) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (select .cse4 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| 4 (* (select .cse4 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|) 4)))) 8) (and (not (= .cse8 0)) (< .cse9 0))))))) (< 1 |v_writer_fnThread1of1ForFork1_ring_enqueue_~x#1_141|))) is different from false [2021-11-12 23:21:38,221 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_writer_fnThread1of1ForFork1_ring_enqueue_~x#1_141| Int)) (or (and (forall ((|v_ULTIMATE.start_main_#t~pre34#1_72| Int) (|ULTIMATE.start_main_~#writer~0#1.offset| Int) (|writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| Int)) (let ((.cse4 (+ |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#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~pre34#1_72|)) |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_fnThread1of1ForFork1_ring_enqueue_~x#1_141|)) .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 (not (= .cse3 0)) (< .cse4 0)))))) (forall ((|v_ULTIMATE.start_main_#t~pre34#1_72| Int) (|aux_mod_writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1_66| Int) (|ULTIMATE.start_main_~#writer~0#1.offset| Int)) (or (<= (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~pre34#1_72|)) |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_fnThread1of1ForFork1_ring_enqueue_~x#1_141|)) .cse7 (+ (mod |aux_mod_writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1_66| 4) (- 4)))))) (select .cse5 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse5 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4))) 8) (= |aux_mod_writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1_66| 0) (<= 4 |aux_mod_writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1_66|) (< |aux_mod_writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1_66| 0)))) (< 1 |v_writer_fnThread1of1ForFork1_ring_enqueue_~x#1_141|))) is different from false [2021-11-12 23:21:38,225 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-12 23:21:38,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174759344] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:21:38,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2033654764] [2021-11-12 23:21:38,226 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-12 23:21:38,227 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:21:38,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 39 [2021-11-12 23:21:38,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058300894] [2021-11-12 23:21:38,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:21:38,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-12 23:21:38,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:38,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-12 23:21:38,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1350, Unknown=10, NotChecked=150, Total=1640 [2021-11-12 23:21:38,229 INFO L87 Difference]: Start difference. First operand 4584 states and 15053 transitions. Second operand has 41 states, 40 states have (on average 2.175) internal successors, (87), 40 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-12 23:21:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:44,267 INFO L93 Difference]: Finished difference Result 9012 states and 29701 transitions. [2021-11-12 23:21:44,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-12 23:21:44,267 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.175) internal successors, (87), 40 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-12 23:21:44,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:44,286 INFO L225 Difference]: With dead ends: 9012 [2021-11-12 23:21:44,286 INFO L226 Difference]: Without dead ends: 9012 [2021-11-12 23:21:44,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 32.8s TimeCoverageRelationStatistics Valid=489, Invalid=2815, Unknown=10, NotChecked=226, Total=3540 [2021-11-12 23:21:44,288 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 851 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 3818 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2648.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 5480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.21ms SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 3818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1610 IncrementalHoareTripleChecker+Unchecked, 3104.12ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:44,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [851 Valid, 187 Invalid, 5480 Unknown, 0 Unchecked, 14.21ms Time], IncrementalHoareTripleChecker [52 Valid, 3818 Invalid, 0 Unknown, 1610 Unchecked, 3104.12ms Time] [2021-11-12 23:21:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9012 states. [2021-11-12 23:21:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9012 to 4547. [2021-11-12 23:21:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4547 states, 4543 states have (on average 3.2832929782082325) internal successors, (14916), 4546 states have internal predecessors, (14916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:21:44,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4547 states to 4547 states and 14916 transitions. [2021-11-12 23:21:44,394 INFO L78 Accepts]: Start accepts. Automaton has 4547 states and 14916 transitions. Word has length 29 [2021-11-12 23:21:44,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:44,394 INFO L470 AbstractCegarLoop]: Abstraction has 4547 states and 14916 transitions. [2021-11-12 23:21:44,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.175) internal successors, (87), 40 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-12 23:21:44,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4547 states and 14916 transitions. [2021-11-12 23:21:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-12 23:21:44,398 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:44,398 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-12 23:21:44,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-12 23:21:44,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-11-12 23:21:44,599 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:21:44,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:44,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1780959574, now seen corresponding path program 1 times [2021-11-12 23:21:44,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:44,600 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092455253] [2021-11-12 23:21:44,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:44,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:45,033 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-12 23:21:45,033 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:45,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092455253] [2021-11-12 23:21:45,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092455253] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:21:45,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:21:45,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-12 23:21:45,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692188743] [2021-11-12 23:21:45,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:21:45,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:21:45,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:45,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:21:45,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:21:45,034 INFO L87 Difference]: Start difference. First operand 4547 states and 14916 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-12 23:21:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:46,263 INFO L93 Difference]: Finished difference Result 11995 states and 39520 transitions. [2021-11-12 23:21:46,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-12 23:21:46,264 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-12 23:21:46,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:46,290 INFO L225 Difference]: With dead ends: 11995 [2021-11-12 23:21:46,290 INFO L226 Difference]: Without dead ends: 11995 [2021-11-12 23:21:46,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2021-11-12 23:21:46,291 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 337 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 684.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.49ms SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 820.80ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:46,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 26 Invalid, 1236 Unknown, 0 Unchecked, 3.49ms Time], IncrementalHoareTripleChecker [51 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 820.80ms Time] [2021-11-12 23:21:46,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11995 states. [2021-11-12 23:21:46,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11995 to 9678. [2021-11-12 23:21:46,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9678 states, 9674 states have (on average 3.357659706429605) internal successors, (32482), 9677 states have internal predecessors, (32482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:21:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9678 states to 9678 states and 32482 transitions. [2021-11-12 23:21:46,496 INFO L78 Accepts]: Start accepts. Automaton has 9678 states and 32482 transitions. Word has length 30 [2021-11-12 23:21:46,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:46,497 INFO L470 AbstractCegarLoop]: Abstraction has 9678 states and 32482 transitions. [2021-11-12 23:21:46,497 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-12 23:21:46,497 INFO L276 IsEmpty]: Start isEmpty. Operand 9678 states and 32482 transitions. [2021-11-12 23:21:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-12 23:21:46,506 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:46,506 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-12 23:21:46,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-12 23:21:46,506 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:21:46,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:46,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1910499802, now seen corresponding path program 1 times [2021-11-12 23:21:46,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:46,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100599471] [2021-11-12 23:21:46,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:46,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:46,983 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-12 23:21:46,984 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:46,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100599471] [2021-11-12 23:21:46,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100599471] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:21:46,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:21:46,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:21:46,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361065904] [2021-11-12 23:21:46,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:21:46,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:21:46,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:46,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:21:46,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:21:46,985 INFO L87 Difference]: Start difference. First operand 9678 states and 32482 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-12 23:21:48,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:48,221 INFO L93 Difference]: Finished difference Result 14938 states and 50011 transitions. [2021-11-12 23:21:48,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-12 23:21:48,222 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-12 23:21:48,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:48,256 INFO L225 Difference]: With dead ends: 14938 [2021-11-12 23:21:48,256 INFO L226 Difference]: Without dead ends: 14938 [2021-11-12 23:21:48,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2021-11-12 23:21:48,257 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 395 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 629.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.28ms SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 744.83ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:48,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 33 Invalid, 1119 Unknown, 0 Unchecked, 3.28ms Time], IncrementalHoareTripleChecker [57 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 744.83ms Time] [2021-11-12 23:21:48,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14938 states. [2021-11-12 23:21:48,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14938 to 11720. [2021-11-12 23:21:48,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11720 states, 11716 states have (on average 3.3670194605667465) internal successors, (39448), 11719 states have internal predecessors, (39448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:21:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11720 states to 11720 states and 39448 transitions. [2021-11-12 23:21:48,494 INFO L78 Accepts]: Start accepts. Automaton has 11720 states and 39448 transitions. Word has length 30 [2021-11-12 23:21:48,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:48,494 INFO L470 AbstractCegarLoop]: Abstraction has 11720 states and 39448 transitions. [2021-11-12 23:21:48,494 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-12 23:21:48,494 INFO L276 IsEmpty]: Start isEmpty. Operand 11720 states and 39448 transitions. [2021-11-12 23:21:48,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-12 23:21:48,506 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:48,506 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-12 23:21:48,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-12 23:21:48,507 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:21:48,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:48,507 INFO L85 PathProgramCache]: Analyzing trace with hash -742718822, now seen corresponding path program 2 times [2021-11-12 23:21:48,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:48,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669988732] [2021-11-12 23:21:48,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:48,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:48,829 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-12 23:21:48,829 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:48,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669988732] [2021-11-12 23:21:48,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669988732] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:21:48,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:21:48,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-12 23:21:48,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545394870] [2021-11-12 23:21:48,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:21:48,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:21:48,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:48,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:21:48,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:21:48,831 INFO L87 Difference]: Start difference. First operand 11720 states and 39448 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-12 23:21:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:50,258 INFO L93 Difference]: Finished difference Result 19838 states and 66208 transitions. [2021-11-12 23:21:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-12 23:21:50,259 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-12 23:21:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:50,402 INFO L225 Difference]: With dead ends: 19838 [2021-11-12 23:21:50,402 INFO L226 Difference]: Without dead ends: 19838 [2021-11-12 23:21:50,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2021-11-12 23:21:50,403 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 402 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 758.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.83ms SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 890.03ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:50,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 49 Invalid, 1286 Unknown, 0 Unchecked, 3.83ms Time], IncrementalHoareTripleChecker [57 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 890.03ms Time] [2021-11-12 23:21:50,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19838 states. [2021-11-12 23:21:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19838 to 12520. [2021-11-12 23:21:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12520 states, 12516 states have (on average 3.360738255033557) internal successors, (42063), 12519 states have internal predecessors, (42063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:21:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12520 states to 12520 states and 42063 transitions. [2021-11-12 23:21:50,681 INFO L78 Accepts]: Start accepts. Automaton has 12520 states and 42063 transitions. Word has length 30 [2021-11-12 23:21:50,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:50,682 INFO L470 AbstractCegarLoop]: Abstraction has 12520 states and 42063 transitions. [2021-11-12 23:21:50,682 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-12 23:21:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 12520 states and 42063 transitions. [2021-11-12 23:21:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-12 23:21:50,697 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:50,697 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-12 23:21:50,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-12 23:21:50,698 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:21:50,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:50,698 INFO L85 PathProgramCache]: Analyzing trace with hash -433610330, now seen corresponding path program 2 times [2021-11-12 23:21:50,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:50,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322877356] [2021-11-12 23:21:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:50,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:51,049 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-12 23:21:51,049 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:51,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322877356] [2021-11-12 23:21:51,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322877356] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:21:51,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:21:51,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-12 23:21:51,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827392097] [2021-11-12 23:21:51,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:21:51,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-12 23:21:51,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:51,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-12 23:21:51,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-12 23:21:51,050 INFO L87 Difference]: Start difference. First operand 12520 states and 42063 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-12 23:21:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:52,935 INFO L93 Difference]: Finished difference Result 22504 states and 75531 transitions. [2021-11-12 23:21:52,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-12 23:21:52,935 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-12 23:21:52,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:52,995 INFO L225 Difference]: With dead ends: 22504 [2021-11-12 23:21:52,996 INFO L226 Difference]: Without dead ends: 22504 [2021-11-12 23:21:52,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2021-11-12 23:21:52,996 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 456 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 950.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.31ms SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1109.65ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:52,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [456 Valid, 47 Invalid, 1298 Unknown, 0 Unchecked, 5.31ms Time], IncrementalHoareTripleChecker [53 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 1109.65ms Time] [2021-11-12 23:21:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22504 states. [2021-11-12 23:21:53,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22504 to 13196. [2021-11-12 23:21:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13196 states, 13192 states have (on average 3.3861431170406306) internal successors, (44670), 13195 states have internal predecessors, (44670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:21:53,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13196 states to 13196 states and 44670 transitions. [2021-11-12 23:21:53,318 INFO L78 Accepts]: Start accepts. Automaton has 13196 states and 44670 transitions. Word has length 30 [2021-11-12 23:21:53,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:53,318 INFO L470 AbstractCegarLoop]: Abstraction has 13196 states and 44670 transitions. [2021-11-12 23:21:53,318 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-12 23:21:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand 13196 states and 44670 transitions. [2021-11-12 23:21:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-12 23:21:53,331 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:53,331 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-12 23:21:53,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-12 23:21:53,331 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:21:53,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:53,332 INFO L85 PathProgramCache]: Analyzing trace with hash 574775496, now seen corresponding path program 3 times [2021-11-12 23:21:53,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:53,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505023613] [2021-11-12 23:21:53,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:53,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:53,687 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-12 23:21:53,687 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:53,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505023613] [2021-11-12 23:21:53,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505023613] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:21:53,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:21:53,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-12 23:21:53,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88556522] [2021-11-12 23:21:53,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:21:53,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-12 23:21:53,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:53,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-12 23:21:53,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-12 23:21:53,689 INFO L87 Difference]: Start difference. First operand 13196 states and 44670 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-12 23:21:55,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:55,503 INFO L93 Difference]: Finished difference Result 22651 states and 76474 transitions. [2021-11-12 23:21:55,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-12 23:21:55,504 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-12 23:21:55,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:55,561 INFO L225 Difference]: With dead ends: 22651 [2021-11-12 23:21:55,561 INFO L226 Difference]: Without dead ends: 22651 [2021-11-12 23:21:55,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2021-11-12 23:21:55,562 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 540 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 881.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.73ms SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1037.12ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:55,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [540 Valid, 68 Invalid, 1364 Unknown, 0 Unchecked, 4.73ms Time], IncrementalHoareTripleChecker [59 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 1037.12ms Time] [2021-11-12 23:21:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22651 states. [2021-11-12 23:21:55,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22651 to 11091. [2021-11-12 23:21:55,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11091 states, 11087 states have (on average 3.3831514386218093) internal successors, (37509), 11090 states have internal predecessors, (37509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:21:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11091 states to 11091 states and 37509 transitions. [2021-11-12 23:21:55,904 INFO L78 Accepts]: Start accepts. Automaton has 11091 states and 37509 transitions. Word has length 30 [2021-11-12 23:21:55,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:55,904 INFO L470 AbstractCegarLoop]: Abstraction has 11091 states and 37509 transitions. [2021-11-12 23:21:55,904 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-12 23:21:55,904 INFO L276 IsEmpty]: Start isEmpty. Operand 11091 states and 37509 transitions. [2021-11-12 23:21:55,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-12 23:21:55,915 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:55,915 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-12 23:21:55,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-11-12 23:21:55,915 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:21:55,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:55,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1725613124, now seen corresponding path program 3 times [2021-11-12 23:21:55,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:55,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076328594] [2021-11-12 23:21:55,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:55,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:56,314 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-12 23:21:56,314 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:56,314 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076328594] [2021-11-12 23:21:56,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076328594] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:21:56,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:21:56,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-12 23:21:56,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961681011] [2021-11-12 23:21:56,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:21:56,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:21:56,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:56,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:21:56,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:21:56,317 INFO L87 Difference]: Start difference. First operand 11091 states and 37509 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-12 23:21:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:58,315 INFO L93 Difference]: Finished difference Result 20059 states and 67445 transitions. [2021-11-12 23:21:58,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-12 23:21:58,315 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-12 23:21:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:58,364 INFO L225 Difference]: With dead ends: 20059 [2021-11-12 23:21:58,364 INFO L226 Difference]: Without dead ends: 20059 [2021-11-12 23:21:58,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2021-11-12 23:21:58,365 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 469 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1059.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.38ms SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1250.13ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:58,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 118 Invalid, 1982 Unknown, 0 Unchecked, 5.38ms Time], IncrementalHoareTripleChecker [43 Valid, 1939 Invalid, 0 Unknown, 0 Unchecked, 1250.13ms Time] [2021-11-12 23:21:58,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20059 states. [2021-11-12 23:21:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20059 to 11636. [2021-11-12 23:21:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11636 states, 11632 states have (on average 3.3935694635488307) internal successors, (39474), 11635 states have internal predecessors, (39474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:21:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11636 states to 11636 states and 39474 transitions. [2021-11-12 23:21:58,766 INFO L78 Accepts]: Start accepts. Automaton has 11636 states and 39474 transitions. Word has length 30 [2021-11-12 23:21:58,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:58,767 INFO L470 AbstractCegarLoop]: Abstraction has 11636 states and 39474 transitions. [2021-11-12 23:21:58,767 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-12 23:21:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand 11636 states and 39474 transitions. [2021-11-12 23:21:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-12 23:21:58,777 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:58,778 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-12 23:21:58,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-11-12 23:21:58,778 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:21:58,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:58,778 INFO L85 PathProgramCache]: Analyzing trace with hash -266244758, now seen corresponding path program 1 times [2021-11-12 23:21:58,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:58,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644919551] [2021-11-12 23:21:58,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:58,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:59,576 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-12 23:21:59,576 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:59,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644919551] [2021-11-12 23:21:59,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644919551] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:21:59,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447065971] [2021-11-12 23:21:59,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:59,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:21:59,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:21:59,578 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:21:59,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-12 23:21:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:59,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 76 conjunts are in the unsatisfiable core [2021-11-12 23:21:59,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:21:59,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:21:59,700 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-12 23:21:59,701 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 61 treesize of output 47 [2021-11-12 23:21:59,705 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 215 treesize of output 213 [2021-11-12 23:21:59,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:21:59,845 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-12 23:21:59,846 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-12 23:22:00,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:22:00,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-12 23:22:00,132 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-12 23:22:00,132 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-12 23:22:00,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:22:00,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:22:00,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:22:00,208 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-12 23:22:00,209 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-12 23:22:00,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:22:00,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:22:00,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:22:00,264 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 49 treesize of output 27 [2021-11-12 23:22:00,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:22:00,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:22:00,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:22:00,296 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 60 treesize of output 32 [2021-11-12 23:22:00,956 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-11-12 23:22:00,956 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-12 23:22:00,992 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-12 23:22:00,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:22:55,725 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-12 23:22:55,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447065971] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:22:55,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [428434568] [2021-11-12 23:22:55,726 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-12 23:22:55,728 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:22:55,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 39 [2021-11-12 23:22:55,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271410147] [2021-11-12 23:22:55,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:22:55,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-12 23:22:55,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:22:55,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-12 23:22:55,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1488, Unknown=16, NotChecked=0, Total=1640 [2021-11-12 23:22:55,730 INFO L87 Difference]: Start difference. First operand 11636 states and 39474 transitions. Second operand has 41 states, 40 states have (on average 2.25) internal successors, (90), 40 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:01,035 INFO L93 Difference]: Finished difference Result 17874 states and 60376 transitions. [2021-11-12 23:23:01,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-12 23:23:01,035 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.25) internal successors, (90), 40 states have internal predecessors, (90), 0 states have call successors, (0), 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-12 23:23:01,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:01,077 INFO L225 Difference]: With dead ends: 17874 [2021-11-12 23:23:01,077 INFO L226 Difference]: Without dead ends: 17874 [2021-11-12 23:23:01,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 56.1s TimeCoverageRelationStatistics Valid=413, Invalid=2651, Unknown=16, NotChecked=0, Total=3080 [2021-11-12 23:23:01,078 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 750 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 3671 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2363.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 5599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.96ms SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 3671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1876 IncrementalHoareTripleChecker+Unchecked, 2762.50ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:01,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [750 Valid, 184 Invalid, 5599 Unknown, 0 Unchecked, 10.96ms Time], IncrementalHoareTripleChecker [52 Valid, 3671 Invalid, 0 Unknown, 1876 Unchecked, 2762.50ms Time] [2021-11-12 23:23:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17874 states. [2021-11-12 23:23:01,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17874 to 11475. [2021-11-12 23:23:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11475 states, 11471 states have (on average 3.392816668119606) internal successors, (38919), 11474 states have internal predecessors, (38919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11475 states to 11475 states and 38919 transitions. [2021-11-12 23:23:01,406 INFO L78 Accepts]: Start accepts. Automaton has 11475 states and 38919 transitions. Word has length 30 [2021-11-12 23:23:01,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:01,407 INFO L470 AbstractCegarLoop]: Abstraction has 11475 states and 38919 transitions. [2021-11-12 23:23:01,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.25) internal successors, (90), 40 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:01,407 INFO L276 IsEmpty]: Start isEmpty. Operand 11475 states and 38919 transitions. [2021-11-12 23:23:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-12 23:23:01,418 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:01,418 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-12 23:23:01,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-12 23:23:01,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2021-11-12 23:23:01,619 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-12 23:23:01,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:01,619 INFO L85 PathProgramCache]: Analyzing trace with hash 461125022, now seen corresponding path program 4 times [2021-11-12 23:23:01,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:01,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203641072] [2021-11-12 23:23:01,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:01,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:01,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-12 23:23:01,985 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:01,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203641072] [2021-11-12 23:23:01,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203641072] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:23:01,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:23:01,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-12 23:23:01,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362672128] [2021-11-12 23:23:01,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:23:01,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:23:01,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:01,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:23:01,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:23:01,987 INFO L87 Difference]: Start difference. First operand 11475 states and 38919 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-12 23:23:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:04,091 INFO L93 Difference]: Finished difference Result 21022 states and 70765 transitions. [2021-11-12 23:23:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-12 23:23:04,091 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-12 23:23:04,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:04,142 INFO L225 Difference]: With dead ends: 21022 [2021-11-12 23:23:04,143 INFO L226 Difference]: Without dead ends: 21022 [2021-11-12 23:23:04,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2021-11-12 23:23:04,143 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 437 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1088.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.64ms SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1279.03ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:04,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 80 Invalid, 1836 Unknown, 0 Unchecked, 5.64ms Time], IncrementalHoareTripleChecker [41 Valid, 1795 Invalid, 0 Unknown, 0 Unchecked, 1279.03ms Time] [2021-11-12 23:23:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21022 states. [2021-11-12 23:23:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21022 to 10351. [2021-11-12 23:23:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10351 states, 10347 states have (on average 3.410070551850778) internal successors, (35284), 10350 states have internal predecessors, (35284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10351 states to 10351 states and 35284 transitions. [2021-11-12 23:23:04,409 INFO L78 Accepts]: Start accepts. Automaton has 10351 states and 35284 transitions. Word has length 30 [2021-11-12 23:23:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:04,410 INFO L470 AbstractCegarLoop]: Abstraction has 10351 states and 35284 transitions. [2021-11-12 23:23:04,410 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-12 23:23:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 10351 states and 35284 transitions. [2021-11-12 23:23:04,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:23:04,419 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23: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] [2021-11-12 23:23:04,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-11-12 23:23:04,419 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:23:04,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:04,420 INFO L85 PathProgramCache]: Analyzing trace with hash 624828899, now seen corresponding path program 1 times [2021-11-12 23:23:04,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:04,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068353960] [2021-11-12 23:23:04,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:04,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:05,488 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-12 23:23:05,489 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:05,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068353960] [2021-11-12 23:23:05,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068353960] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:23:05,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:23:05,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-12 23:23:05,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641528930] [2021-11-12 23:23:05,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:23:05,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-12 23:23:05,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:05,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-12 23:23:05,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-11-12 23:23:05,490 INFO L87 Difference]: Start difference. First operand 10351 states and 35284 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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-12 23:23:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:08,397 INFO L93 Difference]: Finished difference Result 11328 states and 38483 transitions. [2021-11-12 23:23:08,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-12 23:23:08,397 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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-12 23:23:08,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:08,423 INFO L225 Difference]: With dead ends: 11328 [2021-11-12 23:23:08,423 INFO L226 Difference]: Without dead ends: 11328 [2021-11-12 23:23:08,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2021-11-12 23:23:08,424 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 333 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 2988 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1698.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 3025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.56ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1974.97ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:08,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 21 Invalid, 3025 Unknown, 0 Unchecked, 7.56ms Time], IncrementalHoareTripleChecker [37 Valid, 2988 Invalid, 0 Unknown, 0 Unchecked, 1974.97ms Time] [2021-11-12 23:23:08,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11328 states. [2021-11-12 23:23:08,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11328 to 11168. [2021-11-12 23:23:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11168 states, 11164 states have (on average 3.4084557506270152) internal successors, (38052), 11167 states have internal predecessors, (38052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:08,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11168 states to 11168 states and 38052 transitions. [2021-11-12 23:23:08,695 INFO L78 Accepts]: Start accepts. Automaton has 11168 states and 38052 transitions. Word has length 31 [2021-11-12 23:23:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:08,695 INFO L470 AbstractCegarLoop]: Abstraction has 11168 states and 38052 transitions. [2021-11-12 23:23:08,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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-12 23:23:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 11168 states and 38052 transitions. [2021-11-12 23:23:08,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:23:08,706 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:08,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, 1, 1, 1, 1] [2021-11-12 23:23:08,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-11-12 23:23:08,706 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:23:08,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:08,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1233784922, now seen corresponding path program 1 times [2021-11-12 23:23:08,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:08,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764380471] [2021-11-12 23:23:08,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:08,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:08,742 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-12 23:23:08,743 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:08,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764380471] [2021-11-12 23:23:08,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764380471] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:23:08,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:23:08,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-12 23:23:08,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757182507] [2021-11-12 23:23:08,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:23:08,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-12 23:23:08,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:08,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-12 23:23:08,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-12 23:23:08,745 INFO L87 Difference]: Start difference. First operand 11168 states and 38052 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-12 23:23:08,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:08,867 INFO L93 Difference]: Finished difference Result 4862 states and 14634 transitions. [2021-11-12 23:23:08,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-12 23:23:08,867 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-12 23:23:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:08,880 INFO L225 Difference]: With dead ends: 4862 [2021-11-12 23:23:08,880 INFO L226 Difference]: Without dead ends: 4862 [2021-11-12 23:23:08,880 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-12 23:23:08,881 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 78.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.03ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 92.62ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:08,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 29 Invalid, 72 Unknown, 0 Unchecked, 1.03ms Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 92.62ms Time] [2021-11-12 23:23:08,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2021-11-12 23:23:08,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 4162. [2021-11-12 23:23:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4162 states, 4158 states have (on average 2.9663299663299663) internal successors, (12334), 4161 states have internal predecessors, (12334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 12334 transitions. [2021-11-12 23:23:08,978 INFO L78 Accepts]: Start accepts. Automaton has 4162 states and 12334 transitions. Word has length 31 [2021-11-12 23:23:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:08,979 INFO L470 AbstractCegarLoop]: Abstraction has 4162 states and 12334 transitions. [2021-11-12 23:23:08,979 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-12 23:23:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 4162 states and 12334 transitions. [2021-11-12 23:23:08,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:23:08,983 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:08,983 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-12 23:23:08,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-11-12 23:23:08,984 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:23:08,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:08,984 INFO L85 PathProgramCache]: Analyzing trace with hash -904047437, now seen corresponding path program 1 times [2021-11-12 23:23:08,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:08,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413274485] [2021-11-12 23:23:08,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:08,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:10,438 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-12 23:23:10,439 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:10,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413274485] [2021-11-12 23:23:10,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413274485] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:23:10,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:23:10,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-12 23:23:10,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860853951] [2021-11-12 23:23:10,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:23:10,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-12 23:23:10,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:10,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-12 23:23:10,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2021-11-12 23:23:10,440 INFO L87 Difference]: Start difference. First operand 4162 states and 12334 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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-12 23:23:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:13,847 INFO L93 Difference]: Finished difference Result 4671 states and 13779 transitions. [2021-11-12 23:23:13,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-12 23:23:13,847 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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-12 23:23:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:13,886 INFO L225 Difference]: With dead ends: 4671 [2021-11-12 23:23:13,886 INFO L226 Difference]: Without dead ends: 4671 [2021-11-12 23:23:13,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=189, Invalid=1001, Unknown=0, NotChecked=0, Total=1190 [2021-11-12 23:23:13,887 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 274 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 3149 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1881.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 3193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.36ms SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2176.44ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:13,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 23 Invalid, 3193 Unknown, 0 Unchecked, 10.36ms Time], IncrementalHoareTripleChecker [44 Valid, 3149 Invalid, 0 Unknown, 0 Unchecked, 2176.44ms Time] [2021-11-12 23:23:13,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2021-11-12 23:23:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4452. [2021-11-12 23:23:13,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4452 states, 4448 states have (on average 2.9678507194244603) internal successors, (13201), 4451 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-12 23:23:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4452 states to 4452 states and 13201 transitions. [2021-11-12 23:23:13,952 INFO L78 Accepts]: Start accepts. Automaton has 4452 states and 13201 transitions. Word has length 31 [2021-11-12 23:23:13,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:13,952 INFO L470 AbstractCegarLoop]: Abstraction has 4452 states and 13201 transitions. [2021-11-12 23:23:13,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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-12 23:23:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4452 states and 13201 transitions. [2021-11-12 23:23:13,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:23:13,956 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:13,956 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-12 23:23:13,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-11-12 23:23:13,956 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:23:13,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:13,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1388954919, now seen corresponding path program 2 times [2021-11-12 23:23:13,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:13,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733041078] [2021-11-12 23:23:13,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:13,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:15,120 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-12 23:23:15,120 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:15,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733041078] [2021-11-12 23:23:15,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733041078] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:23:15,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:23:15,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-12 23:23:15,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566073496] [2021-11-12 23:23:15,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:23:15,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-12 23:23:15,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:15,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-12 23:23:15,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2021-11-12 23:23:15,121 INFO L87 Difference]: Start difference. First operand 4452 states and 13201 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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-12 23:23:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:18,343 INFO L93 Difference]: Finished difference Result 5660 states and 16607 transitions. [2021-11-12 23:23:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-12 23:23:18,343 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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-12 23:23:18,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:18,353 INFO L225 Difference]: With dead ends: 5660 [2021-11-12 23:23:18,353 INFO L226 Difference]: Without dead ends: 5660 [2021-11-12 23:23:18,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2021-11-12 23:23:18,354 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 336 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1699.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 3061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.26ms SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1972.90ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:18,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 33 Invalid, 3061 Unknown, 0 Unchecked, 7.26ms Time], IncrementalHoareTripleChecker [45 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 1972.90ms Time] [2021-11-12 23:23:18,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5660 states. [2021-11-12 23:23:18,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5660 to 4474. [2021-11-12 23:23:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4474 states, 4470 states have (on average 2.968008948545861) internal successors, (13267), 4473 states have internal predecessors, (13267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 13267 transitions. [2021-11-12 23:23:18,432 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 13267 transitions. Word has length 31 [2021-11-12 23:23:18,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:18,433 INFO L470 AbstractCegarLoop]: Abstraction has 4474 states and 13267 transitions. [2021-11-12 23:23:18,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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-12 23:23:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 13267 transitions. [2021-11-12 23:23:18,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:23:18,436 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:18,436 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-12 23:23:18,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-11-12 23:23:18,437 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:23:18,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:18,437 INFO L85 PathProgramCache]: Analyzing trace with hash -583217149, now seen corresponding path program 2 times [2021-11-12 23:23:18,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:18,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234359388] [2021-11-12 23:23:18,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:18,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:19,446 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-12 23:23:19,446 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:19,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234359388] [2021-11-12 23:23:19,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234359388] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:23:19,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:23:19,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-12 23:23:19,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498324215] [2021-11-12 23:23:19,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:23:19,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-12 23:23:19,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:19,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-12 23:23:19,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2021-11-12 23:23:19,451 INFO L87 Difference]: Start difference. First operand 4474 states and 13267 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:23:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:22,627 INFO L93 Difference]: Finished difference Result 5524 states and 16243 transitions. [2021-11-12 23:23:22,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-12 23:23:22,627 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:23:22,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:22,637 INFO L225 Difference]: With dead ends: 5524 [2021-11-12 23:23:22,637 INFO L226 Difference]: Without dead ends: 5524 [2021-11-12 23:23:22,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2021-11-12 23:23:22,637 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 292 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 3476 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1874.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 3512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.18ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2179.08ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:22,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 61 Invalid, 3512 Unknown, 0 Unchecked, 8.18ms Time], IncrementalHoareTripleChecker [36 Valid, 3476 Invalid, 0 Unknown, 0 Unchecked, 2179.08ms Time] [2021-11-12 23:23:22,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2021-11-12 23:23:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 4554. [2021-11-12 23:23:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4554 states, 4550 states have (on average 2.961978021978022) internal successors, (13477), 4553 states have internal predecessors, (13477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 13477 transitions. [2021-11-12 23:23:22,788 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 13477 transitions. Word has length 31 [2021-11-12 23:23:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:22,790 INFO L470 AbstractCegarLoop]: Abstraction has 4554 states and 13477 transitions. [2021-11-12 23:23:22,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:23:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 13477 transitions. [2021-11-12 23:23:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:23:22,794 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:22,794 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-12 23:23:22,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-11-12 23:23:22,794 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:23:22,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:22,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1837634385, now seen corresponding path program 3 times [2021-11-12 23:23:22,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:22,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489355516] [2021-11-12 23:23:22,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:22,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:23,802 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-12 23:23:23,803 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:23,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489355516] [2021-11-12 23:23:23,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489355516] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:23:23,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:23:23,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-12 23:23:23,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123846701] [2021-11-12 23:23:23,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:23:23,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-12 23:23:23,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:23,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-12 23:23:23,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-12 23:23:23,804 INFO L87 Difference]: Start difference. First operand 4554 states and 13477 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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-12 23:23:26,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:26,660 INFO L93 Difference]: Finished difference Result 5498 states and 16132 transitions. [2021-11-12 23:23:26,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-12 23:23:26,661 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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-12 23:23:26,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:26,670 INFO L225 Difference]: With dead ends: 5498 [2021-11-12 23:23:26,670 INFO L226 Difference]: Without dead ends: 5498 [2021-11-12 23:23:26,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2021-11-12 23:23:26,674 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 311 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 2988 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1789.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 3014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.30ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2084.70ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:26,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 78 Invalid, 3014 Unknown, 0 Unchecked, 8.30ms Time], IncrementalHoareTripleChecker [26 Valid, 2988 Invalid, 0 Unknown, 0 Unchecked, 2084.70ms Time] [2021-11-12 23:23:26,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5498 states. [2021-11-12 23:23:26,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5498 to 4828. [2021-11-12 23:23:26,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4828 states, 4824 states have (on average 2.9537728026533996) internal successors, (14249), 4827 states have internal predecessors, (14249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4828 states to 4828 states and 14249 transitions. [2021-11-12 23:23:26,787 INFO L78 Accepts]: Start accepts. Automaton has 4828 states and 14249 transitions. Word has length 31 [2021-11-12 23:23:26,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:26,787 INFO L470 AbstractCegarLoop]: Abstraction has 4828 states and 14249 transitions. [2021-11-12 23:23:26,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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-12 23:23:26,787 INFO L276 IsEmpty]: Start isEmpty. Operand 4828 states and 14249 transitions. [2021-11-12 23:23:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:23:26,791 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:26,792 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-12 23:23:26,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-11-12 23:23:26,792 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:23:26,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:26,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1209707651, now seen corresponding path program 3 times [2021-11-12 23:23:26,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:26,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247271711] [2021-11-12 23:23:26,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:26,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:27,896 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-12 23:23:27,896 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:27,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247271711] [2021-11-12 23:23:27,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247271711] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:23:27,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:23:27,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-12 23:23:27,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199903354] [2021-11-12 23:23:27,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:23:27,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-12 23:23:27,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:27,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-12 23:23:27,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2021-11-12 23:23:27,898 INFO L87 Difference]: Start difference. First operand 4828 states and 14249 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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-12 23:23:31,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:31,405 INFO L93 Difference]: Finished difference Result 5926 states and 17365 transitions. [2021-11-12 23:23:31,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-12 23:23:31,405 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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-12 23:23:31,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:31,416 INFO L225 Difference]: With dead ends: 5926 [2021-11-12 23:23:31,416 INFO L226 Difference]: Without dead ends: 5926 [2021-11-12 23:23:31,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2021-11-12 23:23:31,417 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 307 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 3649 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2011.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.40ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2330.97ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:31,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 63 Invalid, 3686 Unknown, 0 Unchecked, 8.40ms Time], IncrementalHoareTripleChecker [37 Valid, 3649 Invalid, 0 Unknown, 0 Unchecked, 2330.97ms Time] [2021-11-12 23:23:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2021-11-12 23:23:31,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 4908. [2021-11-12 23:23:31,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4908 states, 4904 states have (on average 2.948409461663948) internal successors, (14459), 4907 states have internal predecessors, (14459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4908 states to 4908 states and 14459 transitions. [2021-11-12 23:23:31,501 INFO L78 Accepts]: Start accepts. Automaton has 4908 states and 14459 transitions. Word has length 31 [2021-11-12 23:23:31,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:31,502 INFO L470 AbstractCegarLoop]: Abstraction has 4908 states and 14459 transitions. [2021-11-12 23:23:31,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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-12 23:23:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4908 states and 14459 transitions. [2021-11-12 23:23:31,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:23:31,506 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:31,506 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-12 23:23:31,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-11-12 23:23:31,506 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-12 23:23:31,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:31,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1712513817, now seen corresponding path program 4 times [2021-11-12 23:23:31,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:31,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372582162] [2021-11-12 23:23:31,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:31,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:32,761 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-12 23:23:32,761 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:32,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372582162] [2021-11-12 23:23:32,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372582162] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:23:32,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:23:32,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-12 23:23:32,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315392220] [2021-11-12 23:23:32,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:23:32,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-12 23:23:32,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:32,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-12 23:23:32,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2021-11-12 23:23:32,763 INFO L87 Difference]: Start difference. First operand 4908 states and 14459 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:23:37,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:37,261 INFO L93 Difference]: Finished difference Result 6476 states and 18982 transitions. [2021-11-12 23:23:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-12 23:23:37,262 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:23:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:37,272 INFO L225 Difference]: With dead ends: 6476 [2021-11-12 23:23:37,272 INFO L226 Difference]: Without dead ends: 6476 [2021-11-12 23:23:37,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2021-11-12 23:23:37,273 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 391 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 4559 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2503.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 4604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.51ms SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 4559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2913.73ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:37,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 97 Invalid, 4604 Unknown, 0 Unchecked, 10.51ms Time], IncrementalHoareTripleChecker [45 Valid, 4559 Invalid, 0 Unknown, 0 Unchecked, 2913.73ms Time] [2021-11-12 23:23:37,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6476 states. [2021-11-12 23:23:37,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6476 to 5176. [2021-11-12 23:23:37,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5176 states, 5172 states have (on average 2.944895591647332) internal successors, (15231), 5175 states have internal predecessors, (15231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5176 states to 5176 states and 15231 transitions. [2021-11-12 23:23:37,364 INFO L78 Accepts]: Start accepts. Automaton has 5176 states and 15231 transitions. Word has length 31 [2021-11-12 23:23:37,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:37,365 INFO L470 AbstractCegarLoop]: Abstraction has 5176 states and 15231 transitions. [2021-11-12 23:23:37,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:23:37,365 INFO L276 IsEmpty]: Start isEmpty. Operand 5176 states and 15231 transitions. [2021-11-12 23:23:37,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:23:37,370 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:37,370 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-12 23:23:37,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-11-12 23:23:37,370 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-12 23:23:37,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1549446157, now seen corresponding path program 5 times [2021-11-12 23:23:37,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:37,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607453483] [2021-11-12 23:23:37,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:37,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:38,570 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-12 23:23:38,570 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:38,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607453483] [2021-11-12 23:23:38,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607453483] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:23:38,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:23:38,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-12 23:23:38,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493444486] [2021-11-12 23:23:38,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:23:38,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-12 23:23:38,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:38,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-12 23:23:38,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2021-11-12 23:23:38,572 INFO L87 Difference]: Start difference. First operand 5176 states and 15231 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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-12 23:23:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:41,959 INFO L93 Difference]: Finished difference Result 5775 states and 16894 transitions. [2021-11-12 23:23:41,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-12 23:23:41,959 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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-12 23:23:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:41,969 INFO L225 Difference]: With dead ends: 5775 [2021-11-12 23:23:41,969 INFO L226 Difference]: Without dead ends: 5775 [2021-11-12 23:23:41,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2021-11-12 23:23:41,969 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 271 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 3654 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1960.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 3695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.44ms SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2273.75ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:41,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 51 Invalid, 3695 Unknown, 0 Unchecked, 8.44ms Time], IncrementalHoareTripleChecker [41 Valid, 3654 Invalid, 0 Unknown, 0 Unchecked, 2273.75ms Time] [2021-11-12 23:23:41,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2021-11-12 23:23:42,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 5177. [2021-11-12 23:23:42,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5177 states, 5173 states have (on average 2.944906243959018) internal successors, (15234), 5176 states have internal predecessors, (15234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5177 states to 5177 states and 15234 transitions. [2021-11-12 23:23:42,053 INFO L78 Accepts]: Start accepts. Automaton has 5177 states and 15234 transitions. Word has length 31 [2021-11-12 23:23:42,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:42,054 INFO L470 AbstractCegarLoop]: Abstraction has 5177 states and 15234 transitions. [2021-11-12 23:23:42,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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-12 23:23:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 5177 states and 15234 transitions. [2021-11-12 23:23:42,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:23:42,059 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:42,059 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-12 23:23:42,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-11-12 23:23:42,059 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-12 23:23:42,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:42,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1370198889, now seen corresponding path program 6 times [2021-11-12 23:23:42,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:42,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520276686] [2021-11-12 23:23:42,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:42,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:43,122 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-12 23:23:43,122 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:43,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520276686] [2021-11-12 23:23:43,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520276686] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:23:43,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:23:43,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-12 23:23:43,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938060072] [2021-11-12 23:23:43,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:23:43,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-12 23:23:43,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:43,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-12 23:23:43,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2021-11-12 23:23:43,124 INFO L87 Difference]: Start difference. First operand 5177 states and 15234 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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-12 23:23:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:46,355 INFO L93 Difference]: Finished difference Result 6389 states and 18604 transitions. [2021-11-12 23:23:46,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-12 23:23:46,355 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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-12 23:23:46,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:46,366 INFO L225 Difference]: With dead ends: 6389 [2021-11-12 23:23:46,366 INFO L226 Difference]: Without dead ends: 6389 [2021-11-12 23:23:46,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2021-11-12 23:23:46,367 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 333 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 3534 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1887.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 3574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.32ms SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2190.68ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:46,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 73 Invalid, 3574 Unknown, 0 Unchecked, 8.32ms Time], IncrementalHoareTripleChecker [40 Valid, 3534 Invalid, 0 Unknown, 0 Unchecked, 2190.68ms Time] [2021-11-12 23:23:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6389 states. [2021-11-12 23:23:46,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6389 to 5267. [2021-11-12 23:23:46,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5267 states, 5263 states have (on average 2.9401482044461336) internal successors, (15474), 5266 states have internal predecessors, (15474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5267 states to 5267 states and 15474 transitions. [2021-11-12 23:23:46,510 INFO L78 Accepts]: Start accepts. Automaton has 5267 states and 15474 transitions. Word has length 31 [2021-11-12 23:23:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:46,510 INFO L470 AbstractCegarLoop]: Abstraction has 5267 states and 15474 transitions. [2021-11-12 23:23:46,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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-12 23:23:46,510 INFO L276 IsEmpty]: Start isEmpty. Operand 5267 states and 15474 transitions. [2021-11-12 23:23:46,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:23:46,514 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:46,514 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-12 23:23:46,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-11-12 23:23:46,514 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-12 23:23:46,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:46,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1873005055, now seen corresponding path program 7 times [2021-11-12 23:23:46,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:46,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738825485] [2021-11-12 23:23:46,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:46,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:47,751 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-12 23:23:47,751 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:47,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738825485] [2021-11-12 23:23:47,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738825485] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:23:47,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:23:47,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-12 23:23:47,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50404974] [2021-11-12 23:23:47,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:23:47,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-12 23:23:47,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:47,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-12 23:23:47,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-11-12 23:23:47,753 INFO L87 Difference]: Start difference. First operand 5267 states and 15474 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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-12 23:23:50,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:50,911 INFO L93 Difference]: Finished difference Result 6621 states and 19276 transitions. [2021-11-12 23:23:50,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-12 23:23:50,911 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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-12 23:23:50,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:50,922 INFO L225 Difference]: With dead ends: 6621 [2021-11-12 23:23:50,922 INFO L226 Difference]: Without dead ends: 6621 [2021-11-12 23:23:50,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=165, Invalid=891, Unknown=0, NotChecked=0, Total=1056 [2021-11-12 23:23:50,923 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 331 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 3435 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1882.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.22ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2182.56ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:50,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 99 Invalid, 3465 Unknown, 0 Unchecked, 8.22ms Time], IncrementalHoareTripleChecker [30 Valid, 3435 Invalid, 0 Unknown, 0 Unchecked, 2182.56ms Time] [2021-11-12 23:23:50,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6621 states. [2021-11-12 23:23:51,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6621 to 5166. [2021-11-12 23:23:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5166 states, 5162 states have (on average 2.944788841534289) internal successors, (15201), 5165 states have internal predecessors, (15201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:51,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 15201 transitions. [2021-11-12 23:23:51,031 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 15201 transitions. Word has length 31 [2021-11-12 23:23:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:51,031 INFO L470 AbstractCegarLoop]: Abstraction has 5166 states and 15201 transitions. [2021-11-12 23:23:51,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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-12 23:23:51,031 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 15201 transitions. [2021-11-12 23:23:51,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:23:51,036 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:51,036 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-12 23:23:51,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-11-12 23:23:51,036 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-12 23:23:51,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:51,036 INFO L85 PathProgramCache]: Analyzing trace with hash -557017497, now seen corresponding path program 4 times [2021-11-12 23:23:51,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:51,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646582687] [2021-11-12 23:23:51,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:51,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:52,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-12 23:23:52,394 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:52,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646582687] [2021-11-12 23:23:52,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646582687] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:23:52,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:23:52,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-12 23:23:52,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238120756] [2021-11-12 23:23:52,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:23:52,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-12 23:23:52,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:52,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-12 23:23:52,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2021-11-12 23:23:52,396 INFO L87 Difference]: Start difference. First operand 5166 states and 15201 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:23:55,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:55,462 INFO L93 Difference]: Finished difference Result 5797 states and 16906 transitions. [2021-11-12 23:23:55,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-12 23:23:55,463 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:23:55,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:55,472 INFO L225 Difference]: With dead ends: 5797 [2021-11-12 23:23:55,473 INFO L226 Difference]: Without dead ends: 5797 [2021-11-12 23:23:55,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2021-11-12 23:23:55,473 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 288 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 3323 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1815.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 3358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.91ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2105.80ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:55,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 71 Invalid, 3358 Unknown, 0 Unchecked, 7.91ms Time], IncrementalHoareTripleChecker [35 Valid, 3323 Invalid, 0 Unknown, 0 Unchecked, 2105.80ms Time] [2021-11-12 23:23:55,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5797 states. [2021-11-12 23:23:55,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5797 to 5226. [2021-11-12 23:23:55,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5226 states, 5222 states have (on average 2.9396782841823055) internal successors, (15351), 5225 states have internal predecessors, (15351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:55,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5226 states to 5226 states and 15351 transitions. [2021-11-12 23:23:55,557 INFO L78 Accepts]: Start accepts. Automaton has 5226 states and 15351 transitions. Word has length 31 [2021-11-12 23:23:55,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:55,557 INFO L470 AbstractCegarLoop]: Abstraction has 5226 states and 15351 transitions. [2021-11-12 23:23:55,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:23:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 5226 states and 15351 transitions. [2021-11-12 23:23:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:23:55,562 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:55,562 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-12 23:23:55,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-11-12 23:23:55,562 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-12 23:23:55,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:55,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1863834037, now seen corresponding path program 5 times [2021-11-12 23:23:55,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:55,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468981895] [2021-11-12 23:23:55,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:55,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:56,599 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-12 23:23:56,600 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:56,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468981895] [2021-11-12 23:23:56,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468981895] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:23:56,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:23:56,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-12 23:23:56,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493733989] [2021-11-12 23:23:56,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:23:56,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-12 23:23:56,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:56,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-12 23:23:56,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-12 23:23:56,603 INFO L87 Difference]: Start difference. First operand 5226 states and 15351 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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-12 23:23:59,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:59,114 INFO L93 Difference]: Finished difference Result 6492 states and 18929 transitions. [2021-11-12 23:23:59,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-12 23:23:59,114 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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-12 23:23:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:59,125 INFO L225 Difference]: With dead ends: 6492 [2021-11-12 23:23:59,125 INFO L226 Difference]: Without dead ends: 6492 [2021-11-12 23:23:59,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2021-11-12 23:23:59,126 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 372 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 2968 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1574.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.42ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1834.92ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:59,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 80 Invalid, 2996 Unknown, 0 Unchecked, 7.42ms Time], IncrementalHoareTripleChecker [28 Valid, 2968 Invalid, 0 Unknown, 0 Unchecked, 1834.92ms Time] [2021-11-12 23:23:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6492 states. [2021-11-12 23:23:59,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6492 to 5136. [2021-11-12 23:23:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5136 states, 5132 states have (on average 2.9444660950896338) internal successors, (15111), 5135 states have internal predecessors, (15111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:59,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5136 states to 5136 states and 15111 transitions. [2021-11-12 23:23:59,216 INFO L78 Accepts]: Start accepts. Automaton has 5136 states and 15111 transitions. Word has length 31 [2021-11-12 23:23:59,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:59,217 INFO L470 AbstractCegarLoop]: Abstraction has 5136 states and 15111 transitions. [2021-11-12 23:23:59,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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-12 23:23:59,217 INFO L276 IsEmpty]: Start isEmpty. Operand 5136 states and 15111 transitions. [2021-11-12 23:23:59,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:23:59,221 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:59,221 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-12 23:23:59,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-11-12 23:23:59,221 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-12 23:23:59,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:59,222 INFO L85 PathProgramCache]: Analyzing trace with hash 638172037, now seen corresponding path program 6 times [2021-11-12 23:23:59,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:59,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518558401] [2021-11-12 23:23:59,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:59,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:00,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-12 23:24:00,557 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:00,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518558401] [2021-11-12 23:24:00,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518558401] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:00,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:00,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-12 23:24:00,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059877468] [2021-11-12 23:24:00,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:00,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-12 23:24:00,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:00,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-12 23:24:00,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2021-11-12 23:24:00,558 INFO L87 Difference]: Start difference. First operand 5136 states and 15111 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:24:03,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:03,590 INFO L93 Difference]: Finished difference Result 5643 states and 16546 transitions. [2021-11-12 23:24:03,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-12 23:24:03,591 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:24:03,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:03,599 INFO L225 Difference]: With dead ends: 5643 [2021-11-12 23:24:03,599 INFO L226 Difference]: Without dead ends: 5643 [2021-11-12 23:24:03,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2021-11-12 23:24:03,600 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 350 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 3047 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1772.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.82ms SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2050.07ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:03,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 63 Invalid, 3091 Unknown, 0 Unchecked, 7.82ms Time], IncrementalHoareTripleChecker [44 Valid, 3047 Invalid, 0 Unknown, 0 Unchecked, 2050.07ms Time] [2021-11-12 23:24:03,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2021-11-12 23:24:03,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5130. [2021-11-12 23:24:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5130 states, 5126 states have (on average 2.944986344127975) internal successors, (15096), 5129 states have internal predecessors, (15096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5130 states to 5130 states and 15096 transitions. [2021-11-12 23:24:03,683 INFO L78 Accepts]: Start accepts. Automaton has 5130 states and 15096 transitions. Word has length 31 [2021-11-12 23:24:03,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:03,684 INFO L470 AbstractCegarLoop]: Abstraction has 5130 states and 15096 transitions. [2021-11-12 23:24:03,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:24:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5130 states and 15096 transitions. [2021-11-12 23:24:03,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:24:03,688 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:03,689 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-12 23:24:03,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-11-12 23:24:03,689 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-12 23:24:03,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:03,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1235943725, now seen corresponding path program 7 times [2021-11-12 23:24:03,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:03,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028285865] [2021-11-12 23:24:03,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:03,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:04,641 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-12 23:24:04,641 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:04,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028285865] [2021-11-12 23:24:04,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028285865] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:04,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:04,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-12 23:24:04,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836576638] [2021-11-12 23:24:04,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:04,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-12 23:24:04,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:04,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-12 23:24:04,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-12 23:24:04,642 INFO L87 Difference]: Start difference. First operand 5130 states and 15096 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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-12 23:24:07,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:07,177 INFO L93 Difference]: Finished difference Result 6360 states and 18624 transitions. [2021-11-12 23:24:07,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-12 23:24:07,177 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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-12 23:24:07,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:07,187 INFO L225 Difference]: With dead ends: 6360 [2021-11-12 23:24:07,187 INFO L226 Difference]: Without dead ends: 6360 [2021-11-12 23:24:07,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2021-11-12 23:24:07,188 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 345 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1593.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.45ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1851.97ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:07,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 80 Invalid, 2937 Unknown, 0 Unchecked, 7.45ms Time], IncrementalHoareTripleChecker [26 Valid, 2911 Invalid, 0 Unknown, 0 Unchecked, 1851.97ms Time] [2021-11-12 23:24:07,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6360 states. [2021-11-12 23:24:07,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6360 to 5076. [2021-11-12 23:24:07,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5076 states, 5072 states have (on average 2.949723974763407) internal successors, (14961), 5075 states have internal predecessors, (14961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 14961 transitions. [2021-11-12 23:24:07,269 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 14961 transitions. Word has length 31 [2021-11-12 23:24:07,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:07,270 INFO L470 AbstractCegarLoop]: Abstraction has 5076 states and 14961 transitions. [2021-11-12 23:24:07,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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-12 23:24:07,270 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 14961 transitions. [2021-11-12 23:24:07,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:24:07,275 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:07,275 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-12 23:24:07,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-11-12 23:24:07,275 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-12 23:24:07,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:07,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1023661639, now seen corresponding path program 8 times [2021-11-12 23:24:07,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:07,276 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973401787] [2021-11-12 23:24:07,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:07,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:07,896 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-12 23:24:07,896 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:07,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973401787] [2021-11-12 23:24:07,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973401787] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:07,896 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:07,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-12 23:24:07,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55275906] [2021-11-12 23:24:07,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:07,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-12 23:24:07,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:07,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-12 23:24:07,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-11-12 23:24:07,897 INFO L87 Difference]: Start difference. First operand 5076 states and 14961 transitions. Second operand has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 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-12 23:24:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:10,310 INFO L93 Difference]: Finished difference Result 5807 states and 17048 transitions. [2021-11-12 23:24:10,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-12 23:24:10,311 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 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-12 23:24:10,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:10,353 INFO L225 Difference]: With dead ends: 5807 [2021-11-12 23:24:10,353 INFO L226 Difference]: Without dead ends: 5807 [2021-11-12 23:24:10,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2021-11-12 23:24:10,354 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 277 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 2968 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1590.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 2990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.37ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1853.29ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:10,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 70 Invalid, 2990 Unknown, 0 Unchecked, 7.37ms Time], IncrementalHoareTripleChecker [22 Valid, 2968 Invalid, 0 Unknown, 0 Unchecked, 1853.29ms Time] [2021-11-12 23:24:10,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5807 states. [2021-11-12 23:24:10,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5807 to 5056. [2021-11-12 23:24:10,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5056 states, 5052 states have (on average 2.9515043547110054) internal successors, (14911), 5055 states have internal predecessors, (14911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5056 states to 5056 states and 14911 transitions. [2021-11-12 23:24:10,431 INFO L78 Accepts]: Start accepts. Automaton has 5056 states and 14911 transitions. Word has length 31 [2021-11-12 23:24:10,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:10,431 INFO L470 AbstractCegarLoop]: Abstraction has 5056 states and 14911 transitions. [2021-11-12 23:24:10,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 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-12 23:24:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 5056 states and 14911 transitions. [2021-11-12 23:24:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:24:10,436 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:10,436 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-12 23:24:10,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-11-12 23:24:10,436 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-12 23:24:10,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:10,437 INFO L85 PathProgramCache]: Analyzing trace with hash -303199197, now seen corresponding path program 9 times [2021-11-12 23:24:10,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:10,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020866619] [2021-11-12 23:24:10,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:10,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:11,088 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-12 23:24:11,088 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:11,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020866619] [2021-11-12 23:24:11,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020866619] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:11,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:11,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-12 23:24:11,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91854095] [2021-11-12 23:24:11,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:11,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-12 23:24:11,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:11,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-12 23:24:11,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-12 23:24:11,090 INFO L87 Difference]: Start difference. First operand 5056 states and 14911 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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-12 23:24:13,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:13,542 INFO L93 Difference]: Finished difference Result 5732 states and 16805 transitions. [2021-11-12 23:24:13,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-12 23:24:13,542 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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-12 23:24:13,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:13,552 INFO L225 Difference]: With dead ends: 5732 [2021-11-12 23:24:13,552 INFO L226 Difference]: Without dead ends: 5732 [2021-11-12 23:24:13,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2021-11-12 23:24:13,553 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 366 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 2878 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1504.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.43ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1769.22ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:13,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 80 Invalid, 2913 Unknown, 0 Unchecked, 7.43ms Time], IncrementalHoareTripleChecker [35 Valid, 2878 Invalid, 0 Unknown, 0 Unchecked, 1769.22ms Time] [2021-11-12 23:24:13,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5732 states. [2021-11-12 23:24:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5732 to 4812. [2021-11-12 23:24:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4808 states have (on average 2.9552828618968388) internal successors, (14209), 4811 states have internal predecessors, (14209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 14209 transitions. [2021-11-12 23:24:13,664 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 14209 transitions. Word has length 31 [2021-11-12 23:24:13,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:13,664 INFO L470 AbstractCegarLoop]: Abstraction has 4812 states and 14209 transitions. [2021-11-12 23:24:13,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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-12 23:24:13,664 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 14209 transitions. [2021-11-12 23:24:13,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:24:13,668 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:13,668 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-12 23:24:13,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-11-12 23:24:13,669 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-12 23:24:13,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:13,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1954398447, now seen corresponding path program 8 times [2021-11-12 23:24:13,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:13,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272122740] [2021-11-12 23:24:13,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:13,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:15,151 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-12 23:24:15,152 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:15,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272122740] [2021-11-12 23:24:15,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272122740] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:15,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:15,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-12 23:24:15,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503571522] [2021-11-12 23:24:15,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:15,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-12 23:24:15,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:15,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-12 23:24:15,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2021-11-12 23:24:15,153 INFO L87 Difference]: Start difference. First operand 4812 states and 14209 transitions. Second operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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-12 23:24:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:18,593 INFO L93 Difference]: Finished difference Result 5377 states and 15789 transitions. [2021-11-12 23:24:18,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-12 23:24:18,594 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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-12 23:24:18,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:18,602 INFO L225 Difference]: With dead ends: 5377 [2021-11-12 23:24:18,602 INFO L226 Difference]: Without dead ends: 5377 [2021-11-12 23:24:18,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=221, Invalid=1185, Unknown=0, NotChecked=0, Total=1406 [2021-11-12 23:24:18,603 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 319 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 3541 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1911.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 3587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.25ms SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2220.29ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:18,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 83 Invalid, 3587 Unknown, 0 Unchecked, 8.25ms Time], IncrementalHoareTripleChecker [46 Valid, 3541 Invalid, 0 Unknown, 0 Unchecked, 2220.29ms Time] [2021-11-12 23:24:18,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5377 states. [2021-11-12 23:24:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5377 to 4866. [2021-11-12 23:24:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4866 states, 4862 states have (on average 2.9502262443438916) internal successors, (14344), 4865 states have internal predecessors, (14344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4866 states to 4866 states and 14344 transitions. [2021-11-12 23:24:18,680 INFO L78 Accepts]: Start accepts. Automaton has 4866 states and 14344 transitions. Word has length 31 [2021-11-12 23:24:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:18,680 INFO L470 AbstractCegarLoop]: Abstraction has 4866 states and 14344 transitions. [2021-11-12 23:24:18,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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-12 23:24:18,681 INFO L276 IsEmpty]: Start isEmpty. Operand 4866 states and 14344 transitions. [2021-11-12 23:24:18,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:24:18,684 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:18,685 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-12 23:24:18,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-11-12 23:24:18,685 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-12 23:24:18,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:18,685 INFO L85 PathProgramCache]: Analyzing trace with hash 912310011, now seen corresponding path program 9 times [2021-11-12 23:24:18,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:18,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724063847] [2021-11-12 23:24:18,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:18,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:19,760 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-12 23:24:19,760 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:19,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724063847] [2021-11-12 23:24:19,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724063847] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:19,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:19,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-12 23:24:19,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197095140] [2021-11-12 23:24:19,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:19,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-12 23:24:19,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:19,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-12 23:24:19,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2021-11-12 23:24:19,761 INFO L87 Difference]: Start difference. First operand 4866 states and 14344 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:24:23,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:23,789 INFO L93 Difference]: Finished difference Result 6525 states and 19150 transitions. [2021-11-12 23:24:23,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-12 23:24:23,789 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:24:23,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:23,800 INFO L225 Difference]: With dead ends: 6525 [2021-11-12 23:24:23,800 INFO L226 Difference]: Without dead ends: 6525 [2021-11-12 23:24:23,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2021-11-12 23:24:23,801 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 376 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 4190 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2225.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 4235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.60ms SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 4190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2593.38ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:23,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 101 Invalid, 4235 Unknown, 0 Unchecked, 9.60ms Time], IncrementalHoareTripleChecker [45 Valid, 4190 Invalid, 0 Unknown, 0 Unchecked, 2593.38ms Time] [2021-11-12 23:24:23,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6525 states. [2021-11-12 23:24:23,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6525 to 4812. [2021-11-12 23:24:23,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4808 states have (on average 2.9552828618968388) internal successors, (14209), 4811 states have internal predecessors, (14209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 14209 transitions. [2021-11-12 23:24:23,910 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 14209 transitions. Word has length 31 [2021-11-12 23:24:23,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:23,910 INFO L470 AbstractCegarLoop]: Abstraction has 4812 states and 14209 transitions. [2021-11-12 23:24:23,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:24:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 14209 transitions. [2021-11-12 23:24:23,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:24:23,915 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:23,915 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-12 23:24:23,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-11-12 23:24:23,915 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-12 23:24:23,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:23,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1143716361, now seen corresponding path program 10 times [2021-11-12 23:24:23,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:23,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181820949] [2021-11-12 23:24:23,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:23,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:25,002 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-12 23:24:25,002 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:25,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181820949] [2021-11-12 23:24:25,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181820949] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:25,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:25,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-12 23:24:25,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209001771] [2021-11-12 23:24:25,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:25,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-12 23:24:25,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:25,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-12 23:24:25,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2021-11-12 23:24:25,004 INFO L87 Difference]: Start difference. First operand 4812 states and 14209 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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-12 23:24:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:28,792 INFO L93 Difference]: Finished difference Result 5715 states and 16784 transitions. [2021-11-12 23:24:28,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-12 23:24:28,792 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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-12 23:24:28,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:28,801 INFO L225 Difference]: With dead ends: 5715 [2021-11-12 23:24:28,801 INFO L226 Difference]: Without dead ends: 5715 [2021-11-12 23:24:28,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=235, Invalid=1171, Unknown=0, NotChecked=0, Total=1406 [2021-11-12 23:24:28,802 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 340 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 3931 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2062.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 3969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.07ms SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2401.36ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:28,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 109 Invalid, 3969 Unknown, 0 Unchecked, 9.07ms Time], IncrementalHoareTripleChecker [38 Valid, 3931 Invalid, 0 Unknown, 0 Unchecked, 2401.36ms Time] [2021-11-12 23:24:28,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5715 states. [2021-11-12 23:24:28,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5715 to 4812. [2021-11-12 23:24:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4808 states have (on average 2.9552828618968388) internal successors, (14209), 4811 states have internal predecessors, (14209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 14209 transitions. [2021-11-12 23:24:28,881 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 14209 transitions. Word has length 31 [2021-11-12 23:24:28,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:28,881 INFO L470 AbstractCegarLoop]: Abstraction has 4812 states and 14209 transitions. [2021-11-12 23:24:28,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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-12 23:24:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 14209 transitions. [2021-11-12 23:24:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:24:28,885 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:28,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, 1] [2021-11-12 23:24:28,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-11-12 23:24:28,885 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-12 23:24:28,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:28,886 INFO L85 PathProgramCache]: Analyzing trace with hash 27910899, now seen corresponding path program 11 times [2021-11-12 23:24:28,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:28,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670374150] [2021-11-12 23:24:28,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:28,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:29,722 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-12 23:24:29,722 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:29,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670374150] [2021-11-12 23:24:29,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670374150] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:29,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:29,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-12 23:24:29,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963037874] [2021-11-12 23:24:29,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:29,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-12 23:24:29,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:29,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-12 23:24:29,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2021-11-12 23:24:29,724 INFO L87 Difference]: Start difference. First operand 4812 states and 14209 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:24:33,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:33,694 INFO L93 Difference]: Finished difference Result 5731 states and 16810 transitions. [2021-11-12 23:24:33,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-12 23:24:33,695 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:24:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:33,705 INFO L225 Difference]: With dead ends: 5731 [2021-11-12 23:24:33,705 INFO L226 Difference]: Without dead ends: 5731 [2021-11-12 23:24:33,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=257, Invalid=1303, Unknown=0, NotChecked=0, Total=1560 [2021-11-12 23:24:33,706 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 372 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 4199 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2172.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 4247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.46ms SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 4199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2533.38ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:33,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 118 Invalid, 4247 Unknown, 0 Unchecked, 9.46ms Time], IncrementalHoareTripleChecker [48 Valid, 4199 Invalid, 0 Unknown, 0 Unchecked, 2533.38ms Time] [2021-11-12 23:24:33,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5731 states. [2021-11-12 23:24:33,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5731 to 4688. [2021-11-12 23:24:33,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4688 states, 4684 states have (on average 2.9519641332194704) internal successors, (13827), 4687 states have internal predecessors, (13827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4688 states to 4688 states and 13827 transitions. [2021-11-12 23:24:33,786 INFO L78 Accepts]: Start accepts. Automaton has 4688 states and 13827 transitions. Word has length 31 [2021-11-12 23:24:33,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:33,786 INFO L470 AbstractCegarLoop]: Abstraction has 4688 states and 13827 transitions. [2021-11-12 23:24:33,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:24:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 4688 states and 13827 transitions. [2021-11-12 23:24:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:24:33,823 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:33,823 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-12 23:24:33,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-11-12 23:24:33,824 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-12 23:24:33,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:33,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1409974639, now seen corresponding path program 12 times [2021-11-12 23:24:33,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:33,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939405642] [2021-11-12 23:24:33,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:33,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:34,954 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-12 23:24:34,954 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:34,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939405642] [2021-11-12 23:24:34,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939405642] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:34,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:34,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-12 23:24:34,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998038250] [2021-11-12 23:24:34,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:34,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-12 23:24:34,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:34,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-12 23:24:34,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2021-11-12 23:24:34,955 INFO L87 Difference]: Start difference. First operand 4688 states and 13827 transitions. Second operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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-12 23:24:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:38,191 INFO L93 Difference]: Finished difference Result 5279 states and 15452 transitions. [2021-11-12 23:24:38,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-12 23:24:38,191 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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-12 23:24:38,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:38,199 INFO L225 Difference]: With dead ends: 5279 [2021-11-12 23:24:38,199 INFO L226 Difference]: Without dead ends: 5279 [2021-11-12 23:24:38,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=221, Invalid=1185, Unknown=0, NotChecked=0, Total=1406 [2021-11-12 23:24:38,200 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 337 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 3232 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1744.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.57ms SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2027.54ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:38,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 75 Invalid, 3279 Unknown, 0 Unchecked, 7.57ms Time], IncrementalHoareTripleChecker [47 Valid, 3232 Invalid, 0 Unknown, 0 Unchecked, 2027.54ms Time] [2021-11-12 23:24:38,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5279 states. [2021-11-12 23:24:38,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5279 to 4688. [2021-11-12 23:24:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4688 states, 4684 states have (on average 2.9519641332194704) internal successors, (13827), 4687 states have internal predecessors, (13827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:38,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4688 states to 4688 states and 13827 transitions. [2021-11-12 23:24:38,279 INFO L78 Accepts]: Start accepts. Automaton has 4688 states and 13827 transitions. Word has length 31 [2021-11-12 23:24:38,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:38,280 INFO L470 AbstractCegarLoop]: Abstraction has 4688 states and 13827 transitions. [2021-11-12 23:24:38,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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-12 23:24:38,280 INFO L276 IsEmpty]: Start isEmpty. Operand 4688 states and 13827 transitions. [2021-11-12 23:24:38,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:24:38,284 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:38,284 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-12 23:24:38,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-11-12 23:24:38,284 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-12 23:24:38,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:38,284 INFO L85 PathProgramCache]: Analyzing trace with hash -18284199, now seen corresponding path program 13 times [2021-11-12 23:24:38,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:38,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959422433] [2021-11-12 23:24:38,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:38,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:39,669 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-12 23:24:39,669 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:39,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959422433] [2021-11-12 23:24:39,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959422433] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:39,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:39,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-12 23:24:39,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138957234] [2021-11-12 23:24:39,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:39,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-12 23:24:39,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:39,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-12 23:24:39,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2021-11-12 23:24:39,670 INFO L87 Difference]: Start difference. First operand 4688 states and 13827 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:24:43,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:43,858 INFO L93 Difference]: Finished difference Result 6294 states and 18470 transitions. [2021-11-12 23:24:43,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-12 23:24:43,858 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:24:43,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:43,869 INFO L225 Difference]: With dead ends: 6294 [2021-11-12 23:24:43,869 INFO L226 Difference]: Without dead ends: 6294 [2021-11-12 23:24:43,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2021-11-12 23:24:43,870 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 376 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 4486 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2376.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 4529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.35ms SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2767.74ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:43,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 104 Invalid, 4529 Unknown, 0 Unchecked, 10.35ms Time], IncrementalHoareTripleChecker [43 Valid, 4486 Invalid, 0 Unknown, 0 Unchecked, 2767.74ms Time] [2021-11-12 23:24:43,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6294 states. [2021-11-12 23:24:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6294 to 4324. [2021-11-12 23:24:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4324 states, 4320 states have (on average 2.966203703703704) internal successors, (12814), 4323 states have internal predecessors, (12814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4324 states to 4324 states and 12814 transitions. [2021-11-12 23:24:43,963 INFO L78 Accepts]: Start accepts. Automaton has 4324 states and 12814 transitions. Word has length 31 [2021-11-12 23:24:43,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:43,964 INFO L470 AbstractCegarLoop]: Abstraction has 4324 states and 12814 transitions. [2021-11-12 23:24:43,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-12 23:24:43,964 INFO L276 IsEmpty]: Start isEmpty. Operand 4324 states and 12814 transitions. [2021-11-12 23:24:43,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-12 23:24:43,967 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:43,967 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-12 23:24:43,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-11-12 23:24:43,967 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:24:43,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:43,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2105138177, now seen corresponding path program 1 times [2021-11-12 23:24:43,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:43,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823347346] [2021-11-12 23:24:43,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:43,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:44,295 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-12 23:24:44,295 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:44,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823347346] [2021-11-12 23:24:44,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823347346] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:24:44,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738350488] [2021-11-12 23:24:44,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:44,295 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:24:44,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:24:44,297 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:24:44,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28b322-8a12-4e93-9fa0-708ad43390a7/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-12 23:24:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:44,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-12 23:24:44,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:24:44,579 INFO L354 Elim1Store]: treesize reduction 365, result has 12.0 percent of original size [2021-11-12 23:24:44,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 108 [2021-11-12 23:24:46,161 INFO L354 Elim1Store]: treesize reduction 144, result has 33.6 percent of original size [2021-11-12 23:24:46,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 76 treesize of output 132 [2021-11-12 23:24:46,482 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-12 23:24:46,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-11-12 23:24:46,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2021-11-12 23:24:46,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 81 [2021-11-12 23:24:46,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2021-11-12 23:24:46,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 27 [2021-11-12 23:24:47,330 INFO L354 Elim1Store]: treesize reduction 174, result has 32.3 percent of original size [2021-11-12 23:24:47,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 160 treesize of output 190 [2021-11-12 23:24:48,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-11-12 23:24:48,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2021-11-12 23:24:49,062 INFO L354 Elim1Store]: treesize reduction 126, result has 18.2 percent of original size [2021-11-12 23:24:49,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 90 [2021-11-12 23:24:49,564 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-12 23:24:49,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 64 [2021-11-12 23:24:49,617 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-12 23:24:49,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:30:09,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((|reader_twoThread1of1ForFork0_~val~1#1| Int)) (or (and (forall ((|ULTIMATE.start_ring_enqueue_#t~mem9#1| Int)) (or (and (forall ((|reader_twoThread1of1ForFork0_#t~mem26#1| Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| Int) (|ULTIMATE.start_ring_enqueue_#t~mem8#1| Int) (|ULTIMATE.start_ring_enqueue_~x#1| Int) (|reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| Int)) (let ((.cse1 (+ |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| 1))) (let ((.cse0 (mod .cse1 4))) (or (and (not (= .cse0 0)) (< .cse1 0)) (<= (select (store (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| (* |ULTIMATE.start_ring_enqueue_#t~mem8#1| 4) 4) |ULTIMATE.start_ring_enqueue_~x#1|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20) (mod (+ |ULTIMATE.start_ring_enqueue_#t~mem9#1| 1) 4))))) (store .cse2 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store (select .cse2 |c_reader_twoThread1of1ForFork0_~r~2#1.base|) |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| .cse0))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base|) (+ (* |reader_twoThread1of1ForFork0_~val~1#1| 4) (- 4) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) (+ |reader_twoThread1of1ForFork0_#t~mem26#1| 1)) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) 0))))) (forall ((|reader_twoThread1of1ForFork0_#t~mem26#1| Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| Int) (|aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68| Int) (|ULTIMATE.start_ring_enqueue_#t~mem8#1| Int) (|ULTIMATE.start_ring_enqueue_~x#1| Int)) (or (< |aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68| 0) (<= (select (store (select (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| (* |ULTIMATE.start_ring_enqueue_#t~mem8#1| 4) 4) |ULTIMATE.start_ring_enqueue_~x#1|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20) (mod (+ |ULTIMATE.start_ring_enqueue_#t~mem9#1| 1) 4))))) (store .cse3 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store (select .cse3 |c_reader_twoThread1of1ForFork0_~r~2#1.base|) |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| (+ (mod |aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68| 4) (- 4))))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base|) (+ (* |reader_twoThread1of1ForFork0_~val~1#1| 4) (- 4) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) (+ |reader_twoThread1of1ForFork0_#t~mem26#1| 1)) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) 0) (<= 4 |aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68|) (= |aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68| 0)))) (let ((.cse4 (+ |ULTIMATE.start_ring_enqueue_#t~mem9#1| 1))) (and (< .cse4 0) (not (= (mod .cse4 4) 0)))))) (forall ((|aux_mod_ULTIMATE.start_ring_enqueue_#t~mem9#1_53| Int)) (or (< |aux_mod_ULTIMATE.start_ring_enqueue_#t~mem9#1_53| 0) (and (forall ((|reader_twoThread1of1ForFork0_#t~mem26#1| Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| Int) (|ULTIMATE.start_ring_enqueue_#t~mem8#1| Int) (|ULTIMATE.start_ring_enqueue_~x#1| Int) (|reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| Int)) (let ((.cse7 (+ |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| 1))) (let ((.cse6 (mod .cse7 4))) (or (<= (select (store (select (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| (* |ULTIMATE.start_ring_enqueue_#t~mem8#1| 4) 4) |ULTIMATE.start_ring_enqueue_~x#1|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20) (+ (mod |aux_mod_ULTIMATE.start_ring_enqueue_#t~mem9#1_53| 4) (- 4)))))) (store .cse5 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store (select .cse5 |c_reader_twoThread1of1ForFork0_~r~2#1.base|) |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| .cse6))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base|) (+ (* |reader_twoThread1of1ForFork0_~val~1#1| 4) (- 4) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) (+ |reader_twoThread1of1ForFork0_#t~mem26#1| 1)) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) 0) (and (not (= .cse6 0)) (< .cse7 0)))))) (forall ((|reader_twoThread1of1ForFork0_#t~mem26#1| Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| Int) (|aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68| Int) (|ULTIMATE.start_ring_enqueue_#t~mem8#1| Int) (|ULTIMATE.start_ring_enqueue_~x#1| Int)) (or (<= (select (store (select (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| (* |ULTIMATE.start_ring_enqueue_#t~mem8#1| 4) 4) |ULTIMATE.start_ring_enqueue_~x#1|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20) (+ (mod |aux_mod_ULTIMATE.start_ring_enqueue_#t~mem9#1_53| 4) (- 4)))))) (store .cse8 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store (select .cse8 |c_reader_twoThread1of1ForFork0_~r~2#1.base|) |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| (+ (mod |aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68| 4) (- 4))))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base|) (+ (* |reader_twoThread1of1ForFork0_~val~1#1| 4) (- 4) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) (+ |reader_twoThread1of1ForFork0_#t~mem26#1| 1)) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) 0) (< |aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68| 0) (<= 4 |aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68|) (= |aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68| 0)))) (= |aux_mod_ULTIMATE.start_ring_enqueue_#t~mem9#1_53| 0) (<= 4 |aux_mod_ULTIMATE.start_ring_enqueue_#t~mem9#1_53|)))) (<= |reader_twoThread1of1ForFork0_~val~1#1| 1))) is different from false [2021-11-12 23:30:23,841 WARN L838 $PredicateComparison]: unable to prove that (forall ((|reader_twoThread1of1ForFork0_~val~1#1| Int)) (or (<= |reader_twoThread1of1ForFork0_~val~1#1| 1) (and (forall ((|ULTIMATE.start_ring_enqueue_#t~mem9#1| Int)) (or (and (forall ((|reader_twoThread1of1ForFork0_#t~mem26#1| Int) (|ULTIMATE.start_main_~#writer~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~pre34#1_76| Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| Int) (|ULTIMATE.start_ring_enqueue_#t~mem8#1| Int) (|ULTIMATE.start_ring_enqueue_~x#1| Int) (|reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| Int)) (let ((.cse1 (+ |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| 1))) (let ((.cse0 (mod .cse1 4))) (or (and (not (= .cse0 0)) (< .cse1 0)) (<= (select (store (select (let ((.cse2 (let ((.cse3 (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~pre34#1_76|)))) (store .cse3 |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| (* |ULTIMATE.start_ring_enqueue_#t~mem8#1| 4) 4) |ULTIMATE.start_ring_enqueue_~x#1|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20) (mod (+ |ULTIMATE.start_ring_enqueue_#t~mem9#1| 1) 4)))))) (store .cse2 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store (select .cse2 |c_reader_twoThread1of1ForFork0_~r~2#1.base|) |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| .cse0))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base|) (+ (* |reader_twoThread1of1ForFork0_~val~1#1| 4) (- 4) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) (+ |reader_twoThread1of1ForFork0_#t~mem26#1| 1)) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) 0))))) (forall ((|reader_twoThread1of1ForFork0_#t~mem26#1| Int) (|ULTIMATE.start_main_~#writer~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~pre34#1_76| Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| Int) (|aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68| Int) (|ULTIMATE.start_ring_enqueue_#t~mem8#1| Int) (|ULTIMATE.start_ring_enqueue_~x#1| Int)) (or (<= (select (store (select (let ((.cse4 (let ((.cse5 (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~pre34#1_76|)))) (store .cse5 |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| (* |ULTIMATE.start_ring_enqueue_#t~mem8#1| 4) 4) |ULTIMATE.start_ring_enqueue_~x#1|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20) (mod (+ |ULTIMATE.start_ring_enqueue_#t~mem9#1| 1) 4)))))) (store .cse4 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store (select .cse4 |c_reader_twoThread1of1ForFork0_~r~2#1.base|) |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| (+ (mod |aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68| 4) (- 4))))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base|) (+ (* |reader_twoThread1of1ForFork0_~val~1#1| 4) (- 4) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) (+ |reader_twoThread1of1ForFork0_#t~mem26#1| 1)) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) 0) (< |aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68| 0) (<= 4 |aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68|) (= |aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68| 0)))) (let ((.cse6 (+ |ULTIMATE.start_ring_enqueue_#t~mem9#1| 1))) (and (< .cse6 0) (not (= (mod .cse6 4) 0)))))) (forall ((|aux_mod_ULTIMATE.start_ring_enqueue_#t~mem9#1_53| Int)) (or (< |aux_mod_ULTIMATE.start_ring_enqueue_#t~mem9#1_53| 0) (and (forall ((|reader_twoThread1of1ForFork0_#t~mem26#1| Int) (|ULTIMATE.start_main_~#writer~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~pre34#1_76| Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| Int) (|aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68| Int) (|ULTIMATE.start_ring_enqueue_#t~mem8#1| Int) (|ULTIMATE.start_ring_enqueue_~x#1| Int)) (or (< |aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68| 0) (<= (select (store (select (let ((.cse7 (let ((.cse8 (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~pre34#1_76|)))) (store .cse8 |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (select .cse8 |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| (* |ULTIMATE.start_ring_enqueue_#t~mem8#1| 4) 4) |ULTIMATE.start_ring_enqueue_~x#1|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20) (+ (mod |aux_mod_ULTIMATE.start_ring_enqueue_#t~mem9#1_53| 4) (- 4))))))) (store .cse7 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store (select .cse7 |c_reader_twoThread1of1ForFork0_~r~2#1.base|) |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| (+ (mod |aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68| 4) (- 4))))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base|) (+ (* |reader_twoThread1of1ForFork0_~val~1#1| 4) (- 4) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) (+ |reader_twoThread1of1ForFork0_#t~mem26#1| 1)) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) 0) (<= 4 |aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68|) (= |aux_mod_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1_68| 0))) (forall ((|reader_twoThread1of1ForFork0_#t~mem26#1| Int) (|ULTIMATE.start_main_~#writer~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~pre34#1_76| Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| Int) (|ULTIMATE.start_ring_enqueue_#t~mem8#1| Int) (|ULTIMATE.start_ring_enqueue_~x#1| Int) (|reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| Int)) (let ((.cse12 (+ |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| 1))) (let ((.cse10 (mod .cse12 4))) (or (<= (select (store (select (let ((.cse9 (let ((.cse11 (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~pre34#1_76|)))) (store .cse11 |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (select .cse11 |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| (* |ULTIMATE.start_ring_enqueue_#t~mem8#1| 4) 4) |ULTIMATE.start_ring_enqueue_~x#1|) (+ |ULTIMATE.start_ring_enqueue_~r#1.offset| 20) (+ (mod |aux_mod_ULTIMATE.start_ring_enqueue_#t~mem9#1_53| 4) (- 4))))))) (store .cse9 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store (select .cse9 |c_reader_twoThread1of1ForFork0_~r~2#1.base|) |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| .cse10))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base|) (+ (* |reader_twoThread1of1ForFork0_~val~1#1| 4) (- 4) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) (+ |reader_twoThread1of1ForFork0_#t~mem26#1| 1)) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) 0) (and (not (= .cse10 0)) (< .cse12 0))))))) (= |aux_mod_ULTIMATE.start_ring_enqueue_#t~mem9#1_53| 0) (<= 4 |aux_mod_ULTIMATE.start_ring_enqueue_#t~mem9#1_53|)))))) is different from false