./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:43:36,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:43:36,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:43:36,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:43:36,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:43:36,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:43:36,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:43:36,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:43:36,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:43:36,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:43:36,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:43:36,473 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:43:36,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:43:36,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:43:36,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:43:36,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:43:36,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:43:36,480 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:43:36,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:43:36,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:43:36,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:43:36,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:43:36,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:43:36,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:43:36,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:43:36,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:43:36,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:43:36,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:43:36,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:43:36,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:43:36,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:43:36,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:43:36,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:43:36,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:43:36,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:43:36,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:43:36,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:43:36,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:43:36,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:43:36,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:43:36,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:43:36,520 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:43:36,568 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:43:36,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:43:36,573 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:43:36,574 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:43:36,575 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:43:36,575 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:43:36,592 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:43:36,592 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:43:36,592 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:43:36,593 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:43:36,593 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:43:36,593 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:43:36,593 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:43:36,594 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:43:36,594 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:43:36,594 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:43:36,595 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:43:36,595 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:43:36,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:43:36,596 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:43:36,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:43:36,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:43:36,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:43:36,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:43:36,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:43:36,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:43:36,598 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:43:36,599 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:43:36,599 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:43:36,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:43:36,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:43:36,600 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:43:36,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:43:36,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:43:36,601 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:43:36,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:43:36,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:43:36,603 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:43:36,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:43:36,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:43:36,605 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:43:36,605 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/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_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur 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 [2022-11-26 00:43:36,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:43:36,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:43:36,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:43:36,908 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:43:36,909 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:43:36,910 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2022-11-26 00:43:40,033 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:43:40,329 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:43:40,329 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2022-11-26 00:43:40,363 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/data/c74bd8e61/909ae7ddb0764c7296c03d7766eedfa5/FLAG506831e41 [2022-11-26 00:43:40,393 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/data/c74bd8e61/909ae7ddb0764c7296c03d7766eedfa5 [2022-11-26 00:43:40,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:43:40,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:43:40,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:43:40,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:43:40,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:43:40,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:43:40" (1/1) ... [2022-11-26 00:43:40,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6678e893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:43:40, skipping insertion in model container [2022-11-26 00:43:40,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:43:40" (1/1) ... [2022-11-26 00:43:40,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:43:40,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:43:40,620 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-26 00:43:40,977 WARN L237 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_658ef196-2f18-4f26-9ed4-7cfa35bfed57/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39095,39108] [2022-11-26 00:43:40,986 WARN L237 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_658ef196-2f18-4f26-9ed4-7cfa35bfed57/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39180,39193] [2022-11-26 00:43:40,989 WARN L237 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_658ef196-2f18-4f26-9ed4-7cfa35bfed57/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39232,39245] [2022-11-26 00:43:41,095 WARN L237 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_658ef196-2f18-4f26-9ed4-7cfa35bfed57/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49388,49401] [2022-11-26 00:43:41,096 WARN L237 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_658ef196-2f18-4f26-9ed4-7cfa35bfed57/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49437,49450] [2022-11-26 00:43:41,099 WARN L237 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_658ef196-2f18-4f26-9ed4-7cfa35bfed57/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49565,49578] [2022-11-26 00:43:41,102 WARN L237 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_658ef196-2f18-4f26-9ed4-7cfa35bfed57/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49623,49636] [2022-11-26 00:43:41,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:43:41,126 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:43:41,139 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-26 00:43:41,184 WARN L237 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_658ef196-2f18-4f26-9ed4-7cfa35bfed57/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39095,39108] [2022-11-26 00:43:41,190 WARN L237 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_658ef196-2f18-4f26-9ed4-7cfa35bfed57/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39180,39193] [2022-11-26 00:43:41,191 WARN L237 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_658ef196-2f18-4f26-9ed4-7cfa35bfed57/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39232,39245] [2022-11-26 00:43:41,201 WARN L237 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_658ef196-2f18-4f26-9ed4-7cfa35bfed57/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49388,49401] [2022-11-26 00:43:41,207 WARN L237 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_658ef196-2f18-4f26-9ed4-7cfa35bfed57/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49437,49450] [2022-11-26 00:43:41,210 WARN L237 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_658ef196-2f18-4f26-9ed4-7cfa35bfed57/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49565,49578] [2022-11-26 00:43:41,212 WARN L237 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_658ef196-2f18-4f26-9ed4-7cfa35bfed57/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49623,49636] [2022-11-26 00:43:41,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:43:41,292 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:43:41,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:43:41 WrapperNode [2022-11-26 00:43:41,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:43:41,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:43:41,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:43:41,295 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:43:41,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:43:41" (1/1) ... [2022-11-26 00:43:41,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:43:41" (1/1) ... [2022-11-26 00:43:41,369 INFO L138 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 203 [2022-11-26 00:43:41,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:43:41,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:43:41,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:43:41,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:43:41,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:43:41" (1/1) ... [2022-11-26 00:43:41,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:43:41" (1/1) ... [2022-11-26 00:43:41,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:43:41" (1/1) ... [2022-11-26 00:43:41,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:43:41" (1/1) ... [2022-11-26 00:43:41,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:43:41" (1/1) ... [2022-11-26 00:43:41,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:43:41" (1/1) ... [2022-11-26 00:43:41,408 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:43:41" (1/1) ... [2022-11-26 00:43:41,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:43:41" (1/1) ... [2022-11-26 00:43:41,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:43:41,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:43:41,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:43:41,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:43:41,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:43:41" (1/1) ... [2022-11-26 00:43:41,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:43:41,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:43:41,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:43:41,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:43:41,491 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-11-26 00:43:41,491 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-11-26 00:43:41,491 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-11-26 00:43:41,491 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-11-26 00:43:41,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:43:41,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:43:41,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:43:41,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:43:41,492 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-26 00:43:41,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:43:41,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:43:41,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:43:41,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:43:41,495 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-26 00:43:41,651 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:43:41,653 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:43:42,186 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:43:42,196 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:43:42,202 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-26 00:43:42,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:43:42 BoogieIcfgContainer [2022-11-26 00:43:42,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:43:42,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:43:42,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:43:42,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:43:42,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:43:40" (1/3) ... [2022-11-26 00:43:42,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0325d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:43:42, skipping insertion in model container [2022-11-26 00:43:42,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:43:41" (2/3) ... [2022-11-26 00:43:42,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0325d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:43:42, skipping insertion in model container [2022-11-26 00:43:42,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:43:42" (3/3) ... [2022-11-26 00:43:42,220 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2022-11-26 00:43:42,234 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-26 00:43:42,245 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:43:42,245 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-26 00:43:42,245 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-26 00:43:42,420 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-26 00:43:42,481 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-26 00:43:42,502 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 233 transitions, 482 flow [2022-11-26 00:43:42,507 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 233 transitions, 482 flow [2022-11-26 00:43:42,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 233 transitions, 482 flow [2022-11-26 00:43:42,677 INFO L130 PetriNetUnfolder]: 17/231 cut-off events. [2022-11-26 00:43:42,677 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-26 00:43:42,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 231 events. 17/231 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 462 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2022-11-26 00:43:42,702 INFO L119 LiptonReduction]: Number of co-enabled transitions 19012 [2022-11-26 00:43:50,826 INFO L134 LiptonReduction]: Checked pairs total: 41023 [2022-11-26 00:43:50,826 INFO L136 LiptonReduction]: Total number of compositions: 217 [2022-11-26 00:43:50,837 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 62 transitions, 140 flow [2022-11-26 00:43:50,991 INFO L135 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) [2022-11-26 00:43:51,016 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:43:51,024 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@666f8bf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:43:51,025 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-26 00:43:51,035 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) [2022-11-26 00:43:51,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:43:51,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:43:51,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:43:51,054 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:43:51,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:43:51,059 INFO L85 PathProgramCache]: Analyzing trace with hash 682624271, now seen corresponding path program 1 times [2022-11-26 00:43:51,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:43:51,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471314949] [2022-11-26 00:43:51,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:43:51,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:43:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:43:51,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:43:51,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:43:51,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471314949] [2022-11-26 00:43:51,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471314949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:43:51,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:43:51,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:43:51,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947197575] [2022-11-26 00:43:51,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:43:51,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-26 00:43:51,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:43:51,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-26 00:43:51,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 00:43:51,377 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 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:43:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:43:51,540 INFO L93 Difference]: Finished difference Result 2350 states and 7661 transitions. [2022-11-26 00:43:51,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-26 00:43:51,543 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-26 00:43:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:43:51,593 INFO L225 Difference]: With dead ends: 2350 [2022-11-26 00:43:51,593 INFO L226 Difference]: Without dead ends: 2348 [2022-11-26 00:43:51,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 00:43:51,605 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:43:51,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:43:51,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2022-11-26 00:43:51,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2348. [2022-11-26 00:43:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2348 states, 2344 states have (on average 3.2670648464163823) internal successors, (7658), 2347 states have internal predecessors, (7658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:43:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 7658 transitions. [2022-11-26 00:43:51,774 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 7658 transitions. Word has length 13 [2022-11-26 00:43:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:43:51,775 INFO L495 AbstractCegarLoop]: Abstraction has 2348 states and 7658 transitions. [2022-11-26 00:43:51,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:43:51,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 7658 transitions. [2022-11-26 00:43:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 00:43:51,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:43:51,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:43:51,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:43:51,815 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:43:51,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:43:51,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1514052737, now seen corresponding path program 1 times [2022-11-26 00:43:51,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:43:51,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656711995] [2022-11-26 00:43:51,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:43:51,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:43:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:43:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:43:52,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:43:52,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656711995] [2022-11-26 00:43:52,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656711995] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:43:52,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:43:52,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:43:52,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781415282] [2022-11-26 00:43:52,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:43:52,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:43:52,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:43:52,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:43:52,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:43:52,992 INFO L87 Difference]: Start difference. First operand 2348 states and 7658 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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) [2022-11-26 00:43:53,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:43:53,344 INFO L93 Difference]: Finished difference Result 2336 states and 7632 transitions. [2022-11-26 00:43:53,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:43:53,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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 [2022-11-26 00:43:53,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:43:53,363 INFO L225 Difference]: With dead ends: 2336 [2022-11-26 00:43:53,364 INFO L226 Difference]: Without dead ends: 2336 [2022-11-26 00:43:53,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-26 00:43:53,365 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:43:53,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 9 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:43:53,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2022-11-26 00:43:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2336. [2022-11-26 00:43:53,446 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) [2022-11-26 00:43:53,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 7632 transitions. [2022-11-26 00:43:53,461 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 7632 transitions. Word has length 17 [2022-11-26 00:43:53,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:43:53,461 INFO L495 AbstractCegarLoop]: Abstraction has 2336 states and 7632 transitions. [2022-11-26 00:43:53,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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) [2022-11-26 00:43:53,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 7632 transitions. [2022-11-26 00:43:53,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-26 00:43:53,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:43:53,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:43:53,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:43:53,465 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:43:53,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:43:53,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1402138809, now seen corresponding path program 1 times [2022-11-26 00:43:53,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:43:53,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074134323] [2022-11-26 00:43:53,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:43:53,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:43:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:43:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:43:54,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:43:54,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074134323] [2022-11-26 00:43:54,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074134323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:43:54,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:43:54,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 00:43:54,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534150751] [2022-11-26 00:43:54,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:43:54,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 00:43:54,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:43:54,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 00:43:54,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:43:54,270 INFO L87 Difference]: Start difference. First operand 2336 states and 7632 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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) [2022-11-26 00:43:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:43:54,820 INFO L93 Difference]: Finished difference Result 3120 states and 10350 transitions. [2022-11-26 00:43:54,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:43:54,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 [2022-11-26 00:43:54,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:43:54,844 INFO L225 Difference]: With dead ends: 3120 [2022-11-26 00:43:54,844 INFO L226 Difference]: Without dead ends: 3109 [2022-11-26 00:43:54,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:43:54,849 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 102 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:43:54,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 8 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 00:43:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2022-11-26 00:43:54,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 2909. [2022-11-26 00:43:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2909 states, 2905 states have (on average 3.2922547332185887) internal successors, (9564), 2908 states have internal predecessors, (9564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:43:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 9564 transitions. [2022-11-26 00:43:55,017 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 9564 transitions. Word has length 18 [2022-11-26 00:43:55,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:43:55,018 INFO L495 AbstractCegarLoop]: Abstraction has 2909 states and 9564 transitions. [2022-11-26 00:43:55,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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) [2022-11-26 00:43:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 9564 transitions. [2022-11-26 00:43:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-26 00:43:55,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:43:55,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:43:55,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:43:55,026 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:43:55,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:43:55,027 INFO L85 PathProgramCache]: Analyzing trace with hash -531186711, now seen corresponding path program 2 times [2022-11-26 00:43:55,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:43:55,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959970281] [2022-11-26 00:43:55,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:43:55,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:43:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:43:55,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:43:55,900 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:43:55,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959970281] [2022-11-26 00:43:55,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959970281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:43:55,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:43:55,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 00:43:55,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614520722] [2022-11-26 00:43:55,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:43:55,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 00:43:55,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:43:55,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 00:43:55,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:43:55,902 INFO L87 Difference]: Start difference. First operand 2909 states and 9564 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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) [2022-11-26 00:43:56,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:43:56,434 INFO L93 Difference]: Finished difference Result 2879 states and 9435 transitions. [2022-11-26 00:43:56,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:43:56,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 [2022-11-26 00:43:56,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:43:56,453 INFO L225 Difference]: With dead ends: 2879 [2022-11-26 00:43:56,453 INFO L226 Difference]: Without dead ends: 2878 [2022-11-26 00:43:56,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:43:56,457 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 84 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:43:56,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 8 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 00:43:56,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2022-11-26 00:43:56,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 2829. [2022-11-26 00:43:56,574 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) [2022-11-26 00:43:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 9273 transitions. [2022-11-26 00:43:56,588 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 9273 transitions. Word has length 18 [2022-11-26 00:43:56,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:43:56,588 INFO L495 AbstractCegarLoop]: Abstraction has 2829 states and 9273 transitions. [2022-11-26 00:43:56,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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) [2022-11-26 00:43:56,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 9273 transitions. [2022-11-26 00:43:56,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:43:56,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:43:56,594 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:43:56,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:43:56,595 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:43:56,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:43:56,596 INFO L85 PathProgramCache]: Analyzing trace with hash -832907398, now seen corresponding path program 1 times [2022-11-26 00:43:56,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:43:56,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574246435] [2022-11-26 00:43:56,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:43:56,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:43:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:43:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:43:57,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:43:57,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574246435] [2022-11-26 00:43:57,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574246435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:43:57,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:43:57,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 00:43:57,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459429722] [2022-11-26 00:43:57,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:43:57,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:43:57,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:43:57,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:43:57,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:43:57,982 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) [2022-11-26 00:43:59,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:43:59,175 INFO L93 Difference]: Finished difference Result 2891 states and 9468 transitions. [2022-11-26 00:43:59,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 00:43:59,176 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 [2022-11-26 00:43:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:43:59,194 INFO L225 Difference]: With dead ends: 2891 [2022-11-26 00:43:59,194 INFO L226 Difference]: Without dead ends: 2891 [2022-11-26 00:43:59,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-11-26 00:43:59,196 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 199 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:43:59,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 8 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-26 00:43:59,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2022-11-26 00:43:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2885. [2022-11-26 00:43:59,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2885 states, 2881 states have (on average 3.281846581048247) internal successors, (9455), 2884 states have internal predecessors, (9455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:43:59,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 9455 transitions. [2022-11-26 00:43:59,319 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 9455 transitions. Word has length 25 [2022-11-26 00:43:59,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:43:59,321 INFO L495 AbstractCegarLoop]: Abstraction has 2885 states and 9455 transitions. [2022-11-26 00:43:59,321 INFO L496 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) [2022-11-26 00:43:59,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 9455 transitions. [2022-11-26 00:43:59,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:43:59,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:43:59,327 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:43:59,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:43:59,328 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:43:59,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:43:59,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1101389971, now seen corresponding path program 1 times [2022-11-26 00:43:59,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:43:59,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97377371] [2022-11-26 00:43:59,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:43:59,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:43:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:00,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:00,454 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:00,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97377371] [2022-11-26 00:44:00,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97377371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:00,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:00,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-26 00:44:00,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516742478] [2022-11-26 00:44:00,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:00,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:44:00,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:00,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:44:00,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:44:00,457 INFO L87 Difference]: Start difference. First operand 2885 states and 9455 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) [2022-11-26 00:44:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:01,569 INFO L93 Difference]: Finished difference Result 2940 states and 9622 transitions. [2022-11-26 00:44:01,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 00:44:01,570 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 [2022-11-26 00:44:01,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:01,592 INFO L225 Difference]: With dead ends: 2940 [2022-11-26 00:44:01,597 INFO L226 Difference]: Without dead ends: 2940 [2022-11-26 00:44:01,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:44:01,599 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 136 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:01,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 9 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-26 00:44:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2022-11-26 00:44:01,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2934. [2022-11-26 00:44:01,689 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) [2022-11-26 00:44:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 9609 transitions. [2022-11-26 00:44:01,701 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 9609 transitions. Word has length 25 [2022-11-26 00:44:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:01,701 INFO L495 AbstractCegarLoop]: Abstraction has 2934 states and 9609 transitions. [2022-11-26 00:44:01,702 INFO L496 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) [2022-11-26 00:44:01,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 9609 transitions. [2022-11-26 00:44:01,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:01,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:01,711 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:01,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:44:01,712 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:01,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:01,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1249916594, now seen corresponding path program 2 times [2022-11-26 00:44:01,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:01,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773970145] [2022-11-26 00:44:01,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:01,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:02,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:02,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773970145] [2022-11-26 00:44:02,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773970145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:02,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:02,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 00:44:02,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648119987] [2022-11-26 00:44:02,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:02,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:44:02,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:02,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:44:02,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:44:02,860 INFO L87 Difference]: Start difference. First operand 2934 states and 9609 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) [2022-11-26 00:44:04,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:04,763 INFO L93 Difference]: Finished difference Result 3589 states and 11731 transitions. [2022-11-26 00:44:04,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 00:44:04,771 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 [2022-11-26 00:44:04,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:04,801 INFO L225 Difference]: With dead ends: 3589 [2022-11-26 00:44:04,801 INFO L226 Difference]: Without dead ends: 3589 [2022-11-26 00:44:04,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2022-11-26 00:44:04,803 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 193 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:04,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 21 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-26 00:44:04,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3589 states. [2022-11-26 00:44:04,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3589 to 3027. [2022-11-26 00:44:04,899 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) [2022-11-26 00:44:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3027 states to 3027 states and 9914 transitions. [2022-11-26 00:44:04,912 INFO L78 Accepts]: Start accepts. Automaton has 3027 states and 9914 transitions. Word has length 25 [2022-11-26 00:44:04,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:04,915 INFO L495 AbstractCegarLoop]: Abstraction has 3027 states and 9914 transitions. [2022-11-26 00:44:04,915 INFO L496 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) [2022-11-26 00:44:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3027 states and 9914 transitions. [2022-11-26 00:44:04,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:04,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:04,923 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:04,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:44:04,924 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:04,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:04,924 INFO L85 PathProgramCache]: Analyzing trace with hash 655704070, now seen corresponding path program 3 times [2022-11-26 00:44:04,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:04,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859213586] [2022-11-26 00:44:04,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:04,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:05,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:05,972 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:05,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859213586] [2022-11-26 00:44:05,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859213586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:05,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:05,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 00:44:05,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138435785] [2022-11-26 00:44:05,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:05,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:44:05,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:05,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:44:05,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:44:05,974 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) [2022-11-26 00:44:07,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:07,684 INFO L93 Difference]: Finished difference Result 3589 states and 11739 transitions. [2022-11-26 00:44:07,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 00:44:07,685 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 [2022-11-26 00:44:07,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:07,701 INFO L225 Difference]: With dead ends: 3589 [2022-11-26 00:44:07,701 INFO L226 Difference]: Without dead ends: 3589 [2022-11-26 00:44:07,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2022-11-26 00:44:07,702 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 229 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:07,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 19 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-26 00:44:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3589 states. [2022-11-26 00:44:07,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3589 to 3090. [2022-11-26 00:44:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3090 states, 3086 states have (on average 3.2942320155541154) internal successors, (10166), 3089 states have internal predecessors, (10166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 10166 transitions. [2022-11-26 00:44:07,808 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 10166 transitions. Word has length 25 [2022-11-26 00:44:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:07,809 INFO L495 AbstractCegarLoop]: Abstraction has 3090 states and 10166 transitions. [2022-11-26 00:44:07,809 INFO L496 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) [2022-11-26 00:44:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 10166 transitions. [2022-11-26 00:44:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:07,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:07,816 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:07,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 00:44:07,817 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:07,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:07,818 INFO L85 PathProgramCache]: Analyzing trace with hash -781935672, now seen corresponding path program 4 times [2022-11-26 00:44:07,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:07,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452154543] [2022-11-26 00:44:07,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:07,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:08,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:08,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452154543] [2022-11-26 00:44:08,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452154543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:08,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:08,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 00:44:08,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833749267] [2022-11-26 00:44:08,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:08,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:44:08,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:08,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:44:08,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:44:08,928 INFO L87 Difference]: Start difference. First operand 3090 states and 10166 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) [2022-11-26 00:44:10,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:10,925 INFO L93 Difference]: Finished difference Result 3542 states and 11591 transitions. [2022-11-26 00:44:10,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-26 00:44:10,925 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 [2022-11-26 00:44:10,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:10,940 INFO L225 Difference]: With dead ends: 3542 [2022-11-26 00:44:10,940 INFO L226 Difference]: Without dead ends: 3542 [2022-11-26 00:44:10,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2022-11-26 00:44:10,942 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 208 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:10,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 27 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-26 00:44:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3542 states. [2022-11-26 00:44:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3542 to 3291. [2022-11-26 00:44:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3291 states, 3287 states have (on average 3.307879525403103) internal successors, (10873), 3290 states have internal predecessors, (10873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 10873 transitions. [2022-11-26 00:44:11,045 INFO L78 Accepts]: Start accepts. Automaton has 3291 states and 10873 transitions. Word has length 25 [2022-11-26 00:44:11,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:11,045 INFO L495 AbstractCegarLoop]: Abstraction has 3291 states and 10873 transitions. [2022-11-26 00:44:11,046 INFO L496 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) [2022-11-26 00:44:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 10873 transitions. [2022-11-26 00:44:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:11,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:11,053 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:11,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 00:44:11,054 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:11,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:11,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1901427616, now seen corresponding path program 5 times [2022-11-26 00:44:11,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:11,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670634279] [2022-11-26 00:44:11,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:11,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:12,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:12,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670634279] [2022-11-26 00:44:12,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670634279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:12,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:12,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 00:44:12,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544861391] [2022-11-26 00:44:12,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:12,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:44:12,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:12,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:44:12,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:44:12,056 INFO L87 Difference]: Start difference. First operand 3291 states and 10873 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) [2022-11-26 00:44:14,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:14,308 INFO L93 Difference]: Finished difference Result 3508 states and 11408 transitions. [2022-11-26 00:44:14,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-26 00:44:14,309 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 [2022-11-26 00:44:14,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:14,323 INFO L225 Difference]: With dead ends: 3508 [2022-11-26 00:44:14,323 INFO L226 Difference]: Without dead ends: 3508 [2022-11-26 00:44:14,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2022-11-26 00:44:14,324 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 206 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:14,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 37 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-26 00:44:14,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2022-11-26 00:44:14,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 3342. [2022-11-26 00:44:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3342 states, 3338 states have (on average 3.2828040742959854) internal successors, (10958), 3341 states have internal predecessors, (10958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:14,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3342 states to 3342 states and 10958 transitions. [2022-11-26 00:44:14,420 INFO L78 Accepts]: Start accepts. Automaton has 3342 states and 10958 transitions. Word has length 25 [2022-11-26 00:44:14,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:14,422 INFO L495 AbstractCegarLoop]: Abstraction has 3342 states and 10958 transitions. [2022-11-26 00:44:14,422 INFO L496 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) [2022-11-26 00:44:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3342 states and 10958 transitions. [2022-11-26 00:44:14,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:14,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:14,428 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:14,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 00:44:14,428 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:14,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:14,429 INFO L85 PathProgramCache]: Analyzing trace with hash -167623114, now seen corresponding path program 6 times [2022-11-26 00:44:14,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:14,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315671599] [2022-11-26 00:44:14,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:14,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:15,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:15,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315671599] [2022-11-26 00:44:15,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315671599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:15,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:15,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 00:44:15,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790385972] [2022-11-26 00:44:15,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:15,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:44:15,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:15,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:44:15,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:44:15,757 INFO L87 Difference]: Start difference. First operand 3342 states and 10958 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) [2022-11-26 00:44:17,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:17,675 INFO L93 Difference]: Finished difference Result 3547 states and 11538 transitions. [2022-11-26 00:44:17,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-26 00:44:17,676 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 [2022-11-26 00:44:17,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:17,690 INFO L225 Difference]: With dead ends: 3547 [2022-11-26 00:44:17,690 INFO L226 Difference]: Without dead ends: 3547 [2022-11-26 00:44:17,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=212, Invalid=438, Unknown=0, NotChecked=0, Total=650 [2022-11-26 00:44:17,691 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 224 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:17,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 33 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-26 00:44:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3547 states. [2022-11-26 00:44:17,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3547 to 3468. [2022-11-26 00:44:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3468 states, 3464 states have (on average 3.277713625866051) internal successors, (11354), 3467 states have internal predecessors, (11354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3468 states to 3468 states and 11354 transitions. [2022-11-26 00:44:17,786 INFO L78 Accepts]: Start accepts. Automaton has 3468 states and 11354 transitions. Word has length 25 [2022-11-26 00:44:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:17,786 INFO L495 AbstractCegarLoop]: Abstraction has 3468 states and 11354 transitions. [2022-11-26 00:44:17,786 INFO L496 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) [2022-11-26 00:44:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 11354 transitions. [2022-11-26 00:44:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:17,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:17,793 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:17,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 00:44:17,793 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:17,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:17,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2095322411, now seen corresponding path program 2 times [2022-11-26 00:44:17,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:17,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837889733] [2022-11-26 00:44:17,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:17,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:18,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:18,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:18,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837889733] [2022-11-26 00:44:18,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837889733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:18,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:18,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-26 00:44:18,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911774386] [2022-11-26 00:44:18,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:18,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:44:18,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:18,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:44:18,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:44:18,556 INFO L87 Difference]: Start difference. First operand 3468 states and 11354 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) [2022-11-26 00:44:19,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:19,998 INFO L93 Difference]: Finished difference Result 4005 states and 13093 transitions. [2022-11-26 00:44:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-26 00:44:19,998 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 [2022-11-26 00:44:19,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:20,013 INFO L225 Difference]: With dead ends: 4005 [2022-11-26 00:44:20,014 INFO L226 Difference]: Without dead ends: 4005 [2022-11-26 00:44:20,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2022-11-26 00:44:20,015 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 172 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:20,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 15 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-26 00:44:20,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4005 states. [2022-11-26 00:44:20,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4005 to 3525. [2022-11-26 00:44:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3525 states, 3521 states have (on average 3.2891224084067026) internal successors, (11581), 3524 states have internal predecessors, (11581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 11581 transitions. [2022-11-26 00:44:20,117 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 11581 transitions. Word has length 25 [2022-11-26 00:44:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:20,118 INFO L495 AbstractCegarLoop]: Abstraction has 3525 states and 11581 transitions. [2022-11-26 00:44:20,118 INFO L496 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) [2022-11-26 00:44:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 11581 transitions. [2022-11-26 00:44:20,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:20,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:20,125 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:20,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-26 00:44:20,125 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:20,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:20,126 INFO L85 PathProgramCache]: Analyzing trace with hash -757033655, now seen corresponding path program 3 times [2022-11-26 00:44:20,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:20,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985877420] [2022-11-26 00:44:20,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:20,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:20,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:20,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:20,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985877420] [2022-11-26 00:44:20,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985877420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:20,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:20,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-26 00:44:20,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454681945] [2022-11-26 00:44:20,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:20,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-26 00:44:20,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:20,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-26 00:44:20,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-26 00:44:20,971 INFO L87 Difference]: Start difference. First operand 3525 states and 11581 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 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) [2022-11-26 00:44:22,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:22,193 INFO L93 Difference]: Finished difference Result 3955 states and 12936 transitions. [2022-11-26 00:44:22,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 00:44:22,193 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 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 [2022-11-26 00:44:22,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:22,210 INFO L225 Difference]: With dead ends: 3955 [2022-11-26 00:44:22,210 INFO L226 Difference]: Without dead ends: 3955 [2022-11-26 00:44:22,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2022-11-26 00:44:22,211 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 166 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:22,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 19 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-26 00:44:22,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2022-11-26 00:44:22,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3776. [2022-11-26 00:44:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3776 states, 3772 states have (on average 3.2979851537645812) internal successors, (12440), 3775 states have internal predecessors, (12440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 12440 transitions. [2022-11-26 00:44:22,331 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 12440 transitions. Word has length 25 [2022-11-26 00:44:22,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:22,331 INFO L495 AbstractCegarLoop]: Abstraction has 3776 states and 12440 transitions. [2022-11-26 00:44:22,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 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) [2022-11-26 00:44:22,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 12440 transitions. [2022-11-26 00:44:22,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:22,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:22,340 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:22,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-26 00:44:22,340 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:22,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:22,341 INFO L85 PathProgramCache]: Analyzing trace with hash 941576157, now seen corresponding path program 4 times [2022-11-26 00:44:22,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:22,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696091492] [2022-11-26 00:44:22,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:22,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:23,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:23,383 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:23,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696091492] [2022-11-26 00:44:23,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696091492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:23,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:23,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-26 00:44:23,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513837741] [2022-11-26 00:44:23,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:23,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:44:23,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:23,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:44:23,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:44:23,385 INFO L87 Difference]: Start difference. First operand 3776 states and 12440 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) [2022-11-26 00:44:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:25,216 INFO L93 Difference]: Finished difference Result 3997 states and 12938 transitions. [2022-11-26 00:44:25,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-26 00:44:25,216 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 [2022-11-26 00:44:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:25,230 INFO L225 Difference]: With dead ends: 3997 [2022-11-26 00:44:25,230 INFO L226 Difference]: Without dead ends: 3997 [2022-11-26 00:44:25,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2022-11-26 00:44:25,231 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 166 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:25,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 32 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-26 00:44:25,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3997 states. [2022-11-26 00:44:25,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3997 to 3833. [2022-11-26 00:44:25,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3833 states, 3829 states have (on average 3.2616871245756074) internal successors, (12489), 3832 states have internal predecessors, (12489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3833 states and 12489 transitions. [2022-11-26 00:44:25,334 INFO L78 Accepts]: Start accepts. Automaton has 3833 states and 12489 transitions. Word has length 25 [2022-11-26 00:44:25,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:25,334 INFO L495 AbstractCegarLoop]: Abstraction has 3833 states and 12489 transitions. [2022-11-26 00:44:25,334 INFO L496 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) [2022-11-26 00:44:25,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3833 states and 12489 transitions. [2022-11-26 00:44:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:25,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:25,342 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:25,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-26 00:44:25,342 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:25,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:25,343 INFO L85 PathProgramCache]: Analyzing trace with hash 99351715, now seen corresponding path program 5 times [2022-11-26 00:44:25,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:25,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151546086] [2022-11-26 00:44:25,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:25,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:26,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:26,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151546086] [2022-11-26 00:44:26,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151546086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:26,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:26,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-26 00:44:26,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20106545] [2022-11-26 00:44:26,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:26,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:44:26,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:26,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:44:26,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:44:26,452 INFO L87 Difference]: Start difference. First operand 3833 states and 12489 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) [2022-11-26 00:44:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:27,873 INFO L93 Difference]: Finished difference Result 4096 states and 13249 transitions. [2022-11-26 00:44:27,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 00:44:27,874 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 [2022-11-26 00:44:27,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:27,884 INFO L225 Difference]: With dead ends: 4096 [2022-11-26 00:44:27,884 INFO L226 Difference]: Without dead ends: 4096 [2022-11-26 00:44:27,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2022-11-26 00:44:27,887 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 176 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:27,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 25 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-26 00:44:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4096 states. [2022-11-26 00:44:27,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4096 to 3879. [2022-11-26 00:44:27,978 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) [2022-11-26 00:44:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3879 states to 3879 states and 12633 transitions. [2022-11-26 00:44:27,991 INFO L78 Accepts]: Start accepts. Automaton has 3879 states and 12633 transitions. Word has length 25 [2022-11-26 00:44:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:27,992 INFO L495 AbstractCegarLoop]: Abstraction has 3879 states and 12633 transitions. [2022-11-26 00:44:27,992 INFO L496 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) [2022-11-26 00:44:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3879 states and 12633 transitions. [2022-11-26 00:44:27,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:27,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:28,000 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:28,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-26 00:44:28,000 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:28,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:28,001 INFO L85 PathProgramCache]: Analyzing trace with hash 6650944, now seen corresponding path program 7 times [2022-11-26 00:44:28,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:28,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093037974] [2022-11-26 00:44:28,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:28,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:28,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:28,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093037974] [2022-11-26 00:44:28,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093037974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:28,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:28,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 00:44:28,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690460007] [2022-11-26 00:44:28,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:28,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:44:28,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:28,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:44:28,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:44:28,883 INFO L87 Difference]: Start difference. First operand 3879 states and 12633 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) [2022-11-26 00:44:30,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:30,709 INFO L93 Difference]: Finished difference Result 4625 states and 15115 transitions. [2022-11-26 00:44:30,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 00:44:30,709 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 [2022-11-26 00:44:30,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:30,719 INFO L225 Difference]: With dead ends: 4625 [2022-11-26 00:44:30,719 INFO L226 Difference]: Without dead ends: 4625 [2022-11-26 00:44:30,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2022-11-26 00:44:30,720 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 238 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:30,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 43 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-26 00:44:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4625 states. [2022-11-26 00:44:30,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4625 to 4493. [2022-11-26 00:44:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4493 states, 4489 states have (on average 3.2740031187346847) internal successors, (14697), 4492 states have internal predecessors, (14697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4493 states to 4493 states and 14697 transitions. [2022-11-26 00:44:30,837 INFO L78 Accepts]: Start accepts. Automaton has 4493 states and 14697 transitions. Word has length 25 [2022-11-26 00:44:30,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:30,838 INFO L495 AbstractCegarLoop]: Abstraction has 4493 states and 14697 transitions. [2022-11-26 00:44:30,838 INFO L496 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) [2022-11-26 00:44:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 4493 states and 14697 transitions. [2022-11-26 00:44:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:30,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:30,850 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:30,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-26 00:44:30,850 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:30,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:30,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1740455446, now seen corresponding path program 8 times [2022-11-26 00:44:30,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:30,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789678446] [2022-11-26 00:44:30,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:30,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:31,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:31,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789678446] [2022-11-26 00:44:31,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789678446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:31,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:31,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 00:44:31,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050971994] [2022-11-26 00:44:31,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:31,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:44:31,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:31,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:44:31,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:44:31,889 INFO L87 Difference]: Start difference. First operand 4493 states and 14697 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) [2022-11-26 00:44:34,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:34,529 INFO L93 Difference]: Finished difference Result 5243 states and 16977 transitions. [2022-11-26 00:44:34,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:44:34,530 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 [2022-11-26 00:44:34,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:34,540 INFO L225 Difference]: With dead ends: 5243 [2022-11-26 00:44:34,540 INFO L226 Difference]: Without dead ends: 5243 [2022-11-26 00:44:34,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=293, Invalid=637, Unknown=0, NotChecked=0, Total=930 [2022-11-26 00:44:34,541 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 239 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:34,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 63 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1762 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-26 00:44:34,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5243 states. [2022-11-26 00:44:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5243 to 4199. [2022-11-26 00:44:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4199 states, 4195 states have (on average 3.292729439809297) internal successors, (13813), 4198 states have internal predecessors, (13813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4199 states to 4199 states and 13813 transitions. [2022-11-26 00:44:34,660 INFO L78 Accepts]: Start accepts. Automaton has 4199 states and 13813 transitions. Word has length 25 [2022-11-26 00:44:34,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:34,661 INFO L495 AbstractCegarLoop]: Abstraction has 4199 states and 13813 transitions. [2022-11-26 00:44:34,661 INFO L496 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) [2022-11-26 00:44:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 4199 states and 13813 transitions. [2022-11-26 00:44:34,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:34,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:34,669 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:34,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-26 00:44:34,669 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:34,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:34,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2035141466, now seen corresponding path program 9 times [2022-11-26 00:44:34,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:34,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700017346] [2022-11-26 00:44:34,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:34,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:35,594 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:35,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700017346] [2022-11-26 00:44:35,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700017346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:35,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:35,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 00:44:35,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508016379] [2022-11-26 00:44:35,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:35,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:44:35,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:35,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:44:35,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:44:35,596 INFO L87 Difference]: Start difference. First operand 4199 states and 13813 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) [2022-11-26 00:44:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:36,977 INFO L93 Difference]: Finished difference Result 4333 states and 13990 transitions. [2022-11-26 00:44:36,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 00:44:36,978 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 [2022-11-26 00:44:36,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:36,991 INFO L225 Difference]: With dead ends: 4333 [2022-11-26 00:44:36,991 INFO L226 Difference]: Without dead ends: 4333 [2022-11-26 00:44:36,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:44:36,992 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 221 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:36,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 45 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-26 00:44:37,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4333 states. [2022-11-26 00:44:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4333 to 4213. [2022-11-26 00:44:37,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4213 states, 4209 states have (on average 3.2335471608458066) internal successors, (13610), 4212 states have internal predecessors, (13610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4213 states to 4213 states and 13610 transitions. [2022-11-26 00:44:37,103 INFO L78 Accepts]: Start accepts. Automaton has 4213 states and 13610 transitions. Word has length 25 [2022-11-26 00:44:37,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:37,103 INFO L495 AbstractCegarLoop]: Abstraction has 4213 states and 13610 transitions. [2022-11-26 00:44:37,104 INFO L496 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) [2022-11-26 00:44:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand 4213 states and 13610 transitions. [2022-11-26 00:44:37,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:37,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:37,111 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:37,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-26 00:44:37,112 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:37,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:37,112 INFO L85 PathProgramCache]: Analyzing trace with hash -526021328, now seen corresponding path program 10 times [2022-11-26 00:44:37,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:37,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061834041] [2022-11-26 00:44:37,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:37,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:38,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:38,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061834041] [2022-11-26 00:44:38,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061834041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:38,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:38,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-26 00:44:38,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932477003] [2022-11-26 00:44:38,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:38,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:44:38,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:38,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:44:38,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:44:38,052 INFO L87 Difference]: Start difference. First operand 4213 states and 13610 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) [2022-11-26 00:44:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:41,036 INFO L93 Difference]: Finished difference Result 4997 states and 15994 transitions. [2022-11-26 00:44:41,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:44:41,037 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 [2022-11-26 00:44:41,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:41,046 INFO L225 Difference]: With dead ends: 4997 [2022-11-26 00:44:41,046 INFO L226 Difference]: Without dead ends: 4997 [2022-11-26 00:44:41,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=305, Invalid=687, Unknown=0, NotChecked=0, Total=992 [2022-11-26 00:44:41,047 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 189 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 2000 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:41,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 73 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2000 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-26 00:44:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4997 states. [2022-11-26 00:44:41,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4997 to 3473. [2022-11-26 00:44:41,134 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) [2022-11-26 00:44:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 11230 transitions. [2022-11-26 00:44:41,146 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 11230 transitions. Word has length 25 [2022-11-26 00:44:41,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:41,146 INFO L495 AbstractCegarLoop]: Abstraction has 3473 states and 11230 transitions. [2022-11-26 00:44:41,146 INFO L496 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) [2022-11-26 00:44:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 11230 transitions. [2022-11-26 00:44:41,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:41,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:41,152 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:41,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-26 00:44:41,152 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:41,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:41,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1280311155, now seen corresponding path program 6 times [2022-11-26 00:44:41,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:41,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372730519] [2022-11-26 00:44:41,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:41,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:42,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:42,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:42,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372730519] [2022-11-26 00:44:42,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372730519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:42,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:42,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-26 00:44:42,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991384559] [2022-11-26 00:44:42,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:42,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 00:44:42,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:42,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 00:44:42,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:44:42,170 INFO L87 Difference]: Start difference. First operand 3473 states and 11230 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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) [2022-11-26 00:44:43,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:43,291 INFO L93 Difference]: Finished difference Result 3603 states and 11566 transitions. [2022-11-26 00:44:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 00:44:43,291 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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 [2022-11-26 00:44:43,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:43,300 INFO L225 Difference]: With dead ends: 3603 [2022-11-26 00:44:43,300 INFO L226 Difference]: Without dead ends: 3603 [2022-11-26 00:44:43,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-11-26 00:44:43,301 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 113 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:43,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 21 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-26 00:44:43,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3603 states. [2022-11-26 00:44:43,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3603 to 3501. [2022-11-26 00:44:43,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3501 states, 3497 states have (on average 3.235344581069488) internal successors, (11314), 3500 states have internal predecessors, (11314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 11314 transitions. [2022-11-26 00:44:43,408 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 11314 transitions. Word has length 25 [2022-11-26 00:44:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:43,409 INFO L495 AbstractCegarLoop]: Abstraction has 3501 states and 11314 transitions. [2022-11-26 00:44:43,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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) [2022-11-26 00:44:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 11314 transitions. [2022-11-26 00:44:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:43,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:43,416 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:43,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-26 00:44:43,416 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:43,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:43,417 INFO L85 PathProgramCache]: Analyzing trace with hash 57977601, now seen corresponding path program 7 times [2022-11-26 00:44:43,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:43,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315211119] [2022-11-26 00:44:43,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:43,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:44,271 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:44,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315211119] [2022-11-26 00:44:44,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315211119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:44,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:44,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-26 00:44:44,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310969317] [2022-11-26 00:44:44,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:44,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:44:44,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:44,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:44:44,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:44:44,273 INFO L87 Difference]: Start difference. First operand 3501 states and 11314 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) [2022-11-26 00:44:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:45,633 INFO L93 Difference]: Finished difference Result 3869 states and 12430 transitions. [2022-11-26 00:44:45,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-26 00:44:45,634 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 [2022-11-26 00:44:45,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:45,641 INFO L225 Difference]: With dead ends: 3869 [2022-11-26 00:44:45,641 INFO L226 Difference]: Without dead ends: 3869 [2022-11-26 00:44:45,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:44:45,642 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 148 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:45,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 27 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-26 00:44:45,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3869 states. [2022-11-26 00:44:45,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3869 to 3739. [2022-11-26 00:44:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3739 states, 3735 states have (on average 3.2396251673360106) internal successors, (12100), 3738 states have internal predecessors, (12100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 12100 transitions. [2022-11-26 00:44:45,705 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 12100 transitions. Word has length 25 [2022-11-26 00:44:45,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:45,705 INFO L495 AbstractCegarLoop]: Abstraction has 3739 states and 12100 transitions. [2022-11-26 00:44:45,705 INFO L496 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) [2022-11-26 00:44:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 12100 transitions. [2022-11-26 00:44:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:45,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:45,711 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:45,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-26 00:44:45,712 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:45,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:45,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1756587413, now seen corresponding path program 8 times [2022-11-26 00:44:45,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:45,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829710271] [2022-11-26 00:44:45,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:45,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:46,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:46,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:46,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829710271] [2022-11-26 00:44:46,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829710271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:46,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:46,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-26 00:44:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014780073] [2022-11-26 00:44:46,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:46,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:44:46,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:46,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:44:46,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:44:46,510 INFO L87 Difference]: Start difference. First operand 3739 states and 12100 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) [2022-11-26 00:44:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:48,132 INFO L93 Difference]: Finished difference Result 3897 states and 12448 transitions. [2022-11-26 00:44:48,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 00:44:48,133 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 [2022-11-26 00:44:48,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:48,140 INFO L225 Difference]: With dead ends: 3897 [2022-11-26 00:44:48,140 INFO L226 Difference]: Without dead ends: 3897 [2022-11-26 00:44:48,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2022-11-26 00:44:48,141 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 193 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:48,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 41 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-26 00:44:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3897 states. [2022-11-26 00:44:48,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3897 to 3795. [2022-11-26 00:44:48,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3795 states, 3791 states have (on average 3.2176206805592193) internal successors, (12198), 3794 states have internal predecessors, (12198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3795 states to 3795 states and 12198 transitions. [2022-11-26 00:44:48,215 INFO L78 Accepts]: Start accepts. Automaton has 3795 states and 12198 transitions. Word has length 25 [2022-11-26 00:44:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:48,216 INFO L495 AbstractCegarLoop]: Abstraction has 3795 states and 12198 transitions. [2022-11-26 00:44:48,216 INFO L496 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) [2022-11-26 00:44:48,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3795 states and 12198 transitions. [2022-11-26 00:44:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:48,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:48,222 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:48,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-26 00:44:48,222 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:48,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:48,223 INFO L85 PathProgramCache]: Analyzing trace with hash 914362971, now seen corresponding path program 9 times [2022-11-26 00:44:48,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:48,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687963504] [2022-11-26 00:44:48,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:48,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:49,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:49,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687963504] [2022-11-26 00:44:49,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687963504] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:49,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:49,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-26 00:44:49,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953073396] [2022-11-26 00:44:49,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:49,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 00:44:49,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:49,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 00:44:49,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:44:49,048 INFO L87 Difference]: Start difference. First operand 3795 states and 12198 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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) [2022-11-26 00:44:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:50,705 INFO L93 Difference]: Finished difference Result 4513 states and 14306 transitions. [2022-11-26 00:44:50,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-26 00:44:50,706 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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 [2022-11-26 00:44:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:50,714 INFO L225 Difference]: With dead ends: 4513 [2022-11-26 00:44:50,715 INFO L226 Difference]: Without dead ends: 4513 [2022-11-26 00:44:50,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2022-11-26 00:44:50,716 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 247 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:50,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 36 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-26 00:44:50,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4513 states. [2022-11-26 00:44:50,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4513 to 3403. [2022-11-26 00:44:50,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3403 states, 3399 states have (on average 3.2244777875845836) internal successors, (10960), 3402 states have internal predecessors, (10960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 10960 transitions. [2022-11-26 00:44:50,785 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 10960 transitions. Word has length 25 [2022-11-26 00:44:50,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:50,785 INFO L495 AbstractCegarLoop]: Abstraction has 3403 states and 10960 transitions. [2022-11-26 00:44:50,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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) [2022-11-26 00:44:50,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 10960 transitions. [2022-11-26 00:44:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:50,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:50,791 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:50,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-26 00:44:50,791 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:50,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:50,792 INFO L85 PathProgramCache]: Analyzing trace with hash -316824037, now seen corresponding path program 10 times [2022-11-26 00:44:50,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:50,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515717626] [2022-11-26 00:44:50,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:50,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:51,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:51,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515717626] [2022-11-26 00:44:51,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515717626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:51,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:51,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-26 00:44:51,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61304772] [2022-11-26 00:44:51,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:51,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-26 00:44:51,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:51,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-26 00:44:51,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-26 00:44:51,499 INFO L87 Difference]: Start difference. First operand 3403 states and 10960 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 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) [2022-11-26 00:44:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:52,347 INFO L93 Difference]: Finished difference Result 3438 states and 11069 transitions. [2022-11-26 00:44:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:44:52,348 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 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 [2022-11-26 00:44:52,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:52,354 INFO L225 Difference]: With dead ends: 3438 [2022-11-26 00:44:52,354 INFO L226 Difference]: Without dead ends: 3438 [2022-11-26 00:44:52,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-11-26 00:44:52,355 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 124 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:52,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 19 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 00:44:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3438 states. [2022-11-26 00:44:52,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3438 to 3410. [2022-11-26 00:44:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3410 states, 3406 states have (on average 3.2240164415736934) internal successors, (10981), 3409 states have internal predecessors, (10981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 10981 transitions. [2022-11-26 00:44:52,407 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 10981 transitions. Word has length 25 [2022-11-26 00:44:52,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:52,407 INFO L495 AbstractCegarLoop]: Abstraction has 3410 states and 10981 transitions. [2022-11-26 00:44:52,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 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) [2022-11-26 00:44:52,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 10981 transitions. [2022-11-26 00:44:52,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:52,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:52,410 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:52,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-26 00:44:52,411 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:52,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:52,411 INFO L85 PathProgramCache]: Analyzing trace with hash -803450171, now seen corresponding path program 11 times [2022-11-26 00:44:52,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:52,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705310617] [2022-11-26 00:44:52,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:52,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:53,196 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:53,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705310617] [2022-11-26 00:44:53,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705310617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:53,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:53,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-26 00:44:53,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897385581] [2022-11-26 00:44:53,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:53,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:44:53,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:53,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:44:53,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:44:53,198 INFO L87 Difference]: Start difference. First operand 3410 states and 10981 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) [2022-11-26 00:44:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:54,765 INFO L93 Difference]: Finished difference Result 3508 states and 11202 transitions. [2022-11-26 00:44:54,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 00:44:54,766 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 [2022-11-26 00:44:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:54,773 INFO L225 Difference]: With dead ends: 3508 [2022-11-26 00:44:54,773 INFO L226 Difference]: Without dead ends: 3508 [2022-11-26 00:44:54,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2022-11-26 00:44:54,773 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 193 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:54,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 42 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-26 00:44:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2022-11-26 00:44:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 3494. [2022-11-26 00:44:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3494 states, 3490 states have (on average 3.197134670487106) internal successors, (11158), 3493 states have internal predecessors, (11158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 11158 transitions. [2022-11-26 00:44:54,833 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 11158 transitions. Word has length 25 [2022-11-26 00:44:54,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:54,834 INFO L495 AbstractCegarLoop]: Abstraction has 3494 states and 11158 transitions. [2022-11-26 00:44:54,834 INFO L496 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) [2022-11-26 00:44:54,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 11158 transitions. [2022-11-26 00:44:54,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:54,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:54,839 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:54,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-26 00:44:54,840 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1645674613, now seen corresponding path program 12 times [2022-11-26 00:44:54,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:54,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719085709] [2022-11-26 00:44:54,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:54,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:55,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:55,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719085709] [2022-11-26 00:44:55,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719085709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:55,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:55,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-26 00:44:55,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380818411] [2022-11-26 00:44:55,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:55,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:44:55,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:55,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:44:55,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:44:55,787 INFO L87 Difference]: Start difference. First operand 3494 states and 11158 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) [2022-11-26 00:44:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:58,177 INFO L93 Difference]: Finished difference Result 4152 states and 13146 transitions. [2022-11-26 00:44:58,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:44:58,177 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 [2022-11-26 00:44:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:58,185 INFO L225 Difference]: With dead ends: 4152 [2022-11-26 00:44:58,185 INFO L226 Difference]: Without dead ends: 4152 [2022-11-26 00:44:58,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=269, Invalid=601, Unknown=0, NotChecked=0, Total=870 [2022-11-26 00:44:58,185 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 179 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:58,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 49 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-26 00:44:58,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4152 states. [2022-11-26 00:44:58,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4152 to 3193. [2022-11-26 00:44:58,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 3189 states have (on average 3.2151144559423015) internal successors, (10253), 3192 states have internal predecessors, (10253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:58,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 10253 transitions. [2022-11-26 00:44:58,241 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 10253 transitions. Word has length 25 [2022-11-26 00:44:58,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:58,241 INFO L495 AbstractCegarLoop]: Abstraction has 3193 states and 10253 transitions. [2022-11-26 00:44:58,241 INFO L496 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) [2022-11-26 00:44:58,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 10253 transitions. [2022-11-26 00:44:58,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:44:58,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:58,244 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:44:58,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-26 00:44:58,244 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:44:58,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:58,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1527233341, now seen corresponding path program 13 times [2022-11-26 00:44:58,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:58,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704337795] [2022-11-26 00:44:58,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:58,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:59,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:59,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704337795] [2022-11-26 00:44:59,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704337795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:59,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:59,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-26 00:44:59,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065884455] [2022-11-26 00:44:59,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:59,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:44:59,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:59,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:44:59,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:44:59,051 INFO L87 Difference]: Start difference. First operand 3193 states and 10253 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) [2022-11-26 00:45:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:00,751 INFO L93 Difference]: Finished difference Result 3977 states and 12637 transitions. [2022-11-26 00:45:00,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-26 00:45:00,752 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 [2022-11-26 00:45:00,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:00,759 INFO L225 Difference]: With dead ends: 3977 [2022-11-26 00:45:00,759 INFO L226 Difference]: Without dead ends: 3977 [2022-11-26 00:45:00,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2022-11-26 00:45:00,760 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 230 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:00,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 41 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-26 00:45:00,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3977 states. [2022-11-26 00:45:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3977 to 3137. [2022-11-26 00:45:00,809 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) [2022-11-26 00:45:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 10087 transitions. [2022-11-26 00:45:00,815 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 10087 transitions. Word has length 25 [2022-11-26 00:45:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:00,816 INFO L495 AbstractCegarLoop]: Abstraction has 3137 states and 10087 transitions. [2022-11-26 00:45:00,816 INFO L496 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) [2022-11-26 00:45:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 10087 transitions. [2022-11-26 00:45:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:45:00,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:00,818 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:45:00,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-26 00:45:00,819 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:45:00,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:00,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2121425760, now seen corresponding path program 1 times [2022-11-26 00:45:00,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:00,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261626878] [2022-11-26 00:45:00,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:00,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:01,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:01,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261626878] [2022-11-26 00:45:01,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261626878] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:45:01,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:45:01,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-26 00:45:01,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022736965] [2022-11-26 00:45:01,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:45:01,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 00:45:01,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:45:01,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 00:45:01,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:45:01,776 INFO L87 Difference]: Start difference. First operand 3137 states and 10087 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) [2022-11-26 00:45:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:04,020 INFO L93 Difference]: Finished difference Result 4673 states and 15238 transitions. [2022-11-26 00:45:04,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:45:04,021 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 [2022-11-26 00:45:04,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:04,030 INFO L225 Difference]: With dead ends: 4673 [2022-11-26 00:45:04,031 INFO L226 Difference]: Without dead ends: 4673 [2022-11-26 00:45:04,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2022-11-26 00:45:04,031 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 299 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 2098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:04,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 30 Invalid, 2098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-26 00:45:04,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4673 states. [2022-11-26 00:45:04,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4673 to 3627. [2022-11-26 00:45:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3627 states, 3623 states have (on average 3.2299199558377034) internal successors, (11702), 3626 states have internal predecessors, (11702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:45:04,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3627 states to 3627 states and 11702 transitions. [2022-11-26 00:45:04,099 INFO L78 Accepts]: Start accepts. Automaton has 3627 states and 11702 transitions. Word has length 27 [2022-11-26 00:45:04,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:04,099 INFO L495 AbstractCegarLoop]: Abstraction has 3627 states and 11702 transitions. [2022-11-26 00:45:04,099 INFO L496 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) [2022-11-26 00:45:04,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3627 states and 11702 transitions. [2022-11-26 00:45:04,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:45:04,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:04,102 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:45:04,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-26 00:45:04,102 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:45:04,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:04,103 INFO L85 PathProgramCache]: Analyzing trace with hash -189874740, now seen corresponding path program 1 times [2022-11-26 00:45:04,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:04,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631089040] [2022-11-26 00:45:04,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:04,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:05,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:05,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:05,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631089040] [2022-11-26 00:45:05,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631089040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:45:05,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:45:05,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-26 00:45:05,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2242188] [2022-11-26 00:45:05,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:45:05,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-26 00:45:05,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:45:05,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-26 00:45:05,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-11-26 00:45:05,266 INFO L87 Difference]: Start difference. First operand 3627 states and 11702 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) [2022-11-26 00:45:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:07,372 INFO L93 Difference]: Finished difference Result 5135 states and 16771 transitions. [2022-11-26 00:45:07,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 00:45:07,372 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 [2022-11-26 00:45:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:07,382 INFO L225 Difference]: With dead ends: 5135 [2022-11-26 00:45:07,382 INFO L226 Difference]: Without dead ends: 5135 [2022-11-26 00:45:07,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2022-11-26 00:45:07,383 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 272 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 2015 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 2034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:07,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 28 Invalid, 2034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2015 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-26 00:45:07,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2022-11-26 00:45:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 3790. [2022-11-26 00:45:07,478 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) [2022-11-26 00:45:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 12218 transitions. [2022-11-26 00:45:07,486 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 12218 transitions. Word has length 27 [2022-11-26 00:45:07,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:07,486 INFO L495 AbstractCegarLoop]: Abstraction has 3790 states and 12218 transitions. [2022-11-26 00:45:07,486 INFO L496 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) [2022-11-26 00:45:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 12218 transitions. [2022-11-26 00:45:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:45:07,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:07,490 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:45:07,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-26 00:45:07,490 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:45:07,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:07,491 INFO L85 PathProgramCache]: Analyzing trace with hash 807546932, now seen corresponding path program 2 times [2022-11-26 00:45:07,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:07,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619495334] [2022-11-26 00:45:07,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:07,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:08,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:08,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619495334] [2022-11-26 00:45:08,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619495334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:45:08,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:45:08,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-26 00:45:08,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229691209] [2022-11-26 00:45:08,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:45:08,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 00:45:08,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:45:08,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 00:45:08,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:45:08,414 INFO L87 Difference]: Start difference. First operand 3790 states and 12218 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) [2022-11-26 00:45:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:10,951 INFO L93 Difference]: Finished difference Result 6544 states and 21200 transitions. [2022-11-26 00:45:10,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:45:10,952 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 [2022-11-26 00:45:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:10,965 INFO L225 Difference]: With dead ends: 6544 [2022-11-26 00:45:10,965 INFO L226 Difference]: Without dead ends: 6544 [2022-11-26 00:45:10,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2022-11-26 00:45:10,966 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 331 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 2433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:10,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 42 Invalid, 2433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2411 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-26 00:45:10,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6544 states. [2022-11-26 00:45:11,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6544 to 3925. [2022-11-26 00:45:11,046 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) [2022-11-26 00:45:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 12623 transitions. [2022-11-26 00:45:11,055 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 12623 transitions. Word has length 27 [2022-11-26 00:45:11,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:11,055 INFO L495 AbstractCegarLoop]: Abstraction has 3925 states and 12623 transitions. [2022-11-26 00:45:11,055 INFO L496 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) [2022-11-26 00:45:11,055 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 12623 transitions. [2022-11-26 00:45:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:45:11,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:11,060 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:45:11,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-26 00:45:11,060 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:45:11,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:11,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1842030356, now seen corresponding path program 3 times [2022-11-26 00:45:11,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:11,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839020096] [2022-11-26 00:45:11,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:11,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:12,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:12,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839020096] [2022-11-26 00:45:12,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839020096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:45:12,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:45:12,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-26 00:45:12,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078064328] [2022-11-26 00:45:12,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:45:12,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 00:45:12,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:45:12,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 00:45:12,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:45:12,142 INFO L87 Difference]: Start difference. First operand 3925 states and 12623 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) [2022-11-26 00:45:14,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:14,702 INFO L93 Difference]: Finished difference Result 6576 states and 21296 transitions. [2022-11-26 00:45:14,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:45:14,702 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 [2022-11-26 00:45:14,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:14,717 INFO L225 Difference]: With dead ends: 6576 [2022-11-26 00:45:14,718 INFO L226 Difference]: Without dead ends: 6576 [2022-11-26 00:45:14,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2022-11-26 00:45:14,719 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 311 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 2439 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 2457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:14,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 49 Invalid, 2457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2439 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-26 00:45:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6576 states. [2022-11-26 00:45:14,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6576 to 3988. [2022-11-26 00:45:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3988 states, 3984 states have (on average 3.215863453815261) internal successors, (12812), 3987 states have internal predecessors, (12812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:45:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3988 states to 3988 states and 12812 transitions. [2022-11-26 00:45:14,801 INFO L78 Accepts]: Start accepts. Automaton has 3988 states and 12812 transitions. Word has length 27 [2022-11-26 00:45:14,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:14,801 INFO L495 AbstractCegarLoop]: Abstraction has 3988 states and 12812 transitions. [2022-11-26 00:45:14,802 INFO L496 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) [2022-11-26 00:45:14,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3988 states and 12812 transitions. [2022-11-26 00:45:14,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:45:14,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:14,805 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:45:14,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-26 00:45:14,806 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:45:14,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:14,806 INFO L85 PathProgramCache]: Analyzing trace with hash -434353106, now seen corresponding path program 4 times [2022-11-26 00:45:14,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:14,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819367242] [2022-11-26 00:45:14,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:14,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:16,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:16,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819367242] [2022-11-26 00:45:16,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819367242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:45:16,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:45:16,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-26 00:45:16,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723591472] [2022-11-26 00:45:16,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:45:16,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 00:45:16,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:45:16,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 00:45:16,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:45:16,037 INFO L87 Difference]: Start difference. First operand 3988 states and 12812 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) [2022-11-26 00:45:18,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:18,558 INFO L93 Difference]: Finished difference Result 6432 states and 20864 transitions. [2022-11-26 00:45:18,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:45:18,559 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 [2022-11-26 00:45:18,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:18,573 INFO L225 Difference]: With dead ends: 6432 [2022-11-26 00:45:18,573 INFO L226 Difference]: Without dead ends: 6432 [2022-11-26 00:45:18,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2022-11-26 00:45:18,574 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 340 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 2462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:18,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 55 Invalid, 2462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2443 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-26 00:45:18,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6432 states. [2022-11-26 00:45:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6432 to 4177. [2022-11-26 00:45:18,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4177 states, 4173 states have (on average 3.206086748142823) internal successors, (13379), 4176 states have internal predecessors, (13379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:45:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4177 states to 4177 states and 13379 transitions. [2022-11-26 00:45:18,671 INFO L78 Accepts]: Start accepts. Automaton has 4177 states and 13379 transitions. Word has length 27 [2022-11-26 00:45:18,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:18,672 INFO L495 AbstractCegarLoop]: Abstraction has 4177 states and 13379 transitions. [2022-11-26 00:45:18,672 INFO L496 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) [2022-11-26 00:45:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4177 states and 13379 transitions. [2022-11-26 00:45:18,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:45:18,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:18,676 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:45:18,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-26 00:45:18,676 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:45:18,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:18,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1770680006, now seen corresponding path program 5 times [2022-11-26 00:45:18,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:18,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035515108] [2022-11-26 00:45:18,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:18,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:19,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:19,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035515108] [2022-11-26 00:45:19,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035515108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:45:19,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:45:19,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-26 00:45:19,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67864871] [2022-11-26 00:45:19,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:45:19,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-26 00:45:19,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:45:19,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-26 00:45:19,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-11-26 00:45:19,658 INFO L87 Difference]: Start difference. First operand 4177 states and 13379 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) [2022-11-26 00:45:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:21,933 INFO L93 Difference]: Finished difference Result 6568 states and 21373 transitions. [2022-11-26 00:45:21,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 00:45:21,934 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 [2022-11-26 00:45:21,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:21,950 INFO L225 Difference]: With dead ends: 6568 [2022-11-26 00:45:21,950 INFO L226 Difference]: Without dead ends: 6568 [2022-11-26 00:45:21,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2022-11-26 00:45:21,951 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 411 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:21,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 77 Invalid, 2249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2235 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-26 00:45:21,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6568 states. [2022-11-26 00:45:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6568 to 4708. [2022-11-26 00:45:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4708 states, 4704 states have (on average 3.2100340136054424) internal successors, (15100), 4707 states have internal predecessors, (15100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:45:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4708 states to 4708 states and 15100 transitions. [2022-11-26 00:45:22,053 INFO L78 Accepts]: Start accepts. Automaton has 4708 states and 15100 transitions. Word has length 27 [2022-11-26 00:45:22,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:22,053 INFO L495 AbstractCegarLoop]: Abstraction has 4708 states and 15100 transitions. [2022-11-26 00:45:22,053 INFO L496 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) [2022-11-26 00:45:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4708 states and 15100 transitions. [2022-11-26 00:45:22,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:45:22,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:22,059 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:45:22,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-26 00:45:22,059 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:45:22,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:22,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1876209868, now seen corresponding path program 2 times [2022-11-26 00:45:22,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:22,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487730319] [2022-11-26 00:45:22,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:22,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:23,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:23,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487730319] [2022-11-26 00:45:23,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487730319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:45:23,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:45:23,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-26 00:45:23,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743755751] [2022-11-26 00:45:23,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:45:23,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-26 00:45:23,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:45:23,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-26 00:45:23,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-11-26 00:45:23,197 INFO L87 Difference]: Start difference. First operand 4708 states and 15100 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) [2022-11-26 00:45:25,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:25,568 INFO L93 Difference]: Finished difference Result 7305 states and 23611 transitions. [2022-11-26 00:45:25,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 00:45:25,569 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 [2022-11-26 00:45:25,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:25,583 INFO L225 Difference]: With dead ends: 7305 [2022-11-26 00:45:25,583 INFO L226 Difference]: Without dead ends: 7305 [2022-11-26 00:45:25,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2022-11-26 00:45:25,584 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 257 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:25,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 40 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2304 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-26 00:45:25,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7305 states. [2022-11-26 00:45:25,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7305 to 4705. [2022-11-26 00:45:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4705 states, 4701 states have (on average 3.2101680493512017) internal successors, (15091), 4704 states have internal predecessors, (15091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:45:25,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4705 states to 4705 states and 15091 transitions. [2022-11-26 00:45:25,674 INFO L78 Accepts]: Start accepts. Automaton has 4705 states and 15091 transitions. Word has length 27 [2022-11-26 00:45:25,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:25,674 INFO L495 AbstractCegarLoop]: Abstraction has 4705 states and 15091 transitions. [2022-11-26 00:45:25,674 INFO L496 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) [2022-11-26 00:45:25,674 INFO L276 IsEmpty]: Start isEmpty. Operand 4705 states and 15091 transitions. [2022-11-26 00:45:25,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:45:25,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:25,679 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:45:25,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-26 00:45:25,679 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:45:25,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:25,680 INFO L85 PathProgramCache]: Analyzing trace with hash 24063144, now seen corresponding path program 3 times [2022-11-26 00:45:25,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:25,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490028616] [2022-11-26 00:45:25,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:25,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:26,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:26,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:26,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490028616] [2022-11-26 00:45:26,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490028616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:45:26,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:45:26,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-26 00:45:26,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056502385] [2022-11-26 00:45:26,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:45:26,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-26 00:45:26,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:45:26,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-26 00:45:26,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-26 00:45:26,968 INFO L87 Difference]: Start difference. First operand 4705 states and 15091 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) [2022-11-26 00:45:29,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:29,375 INFO L93 Difference]: Finished difference Result 7239 states and 23481 transitions. [2022-11-26 00:45:29,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 00:45:29,375 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 [2022-11-26 00:45:29,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:29,390 INFO L225 Difference]: With dead ends: 7239 [2022-11-26 00:45:29,390 INFO L226 Difference]: Without dead ends: 7239 [2022-11-26 00:45:29,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2022-11-26 00:45:29,390 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 264 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 2374 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 2385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:29,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 48 Invalid, 2385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2374 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-26 00:45:29,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7239 states. [2022-11-26 00:45:29,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7239 to 5384. [2022-11-26 00:45:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5384 states, 5380 states have (on average 3.2276951672862455) internal successors, (17365), 5383 states have internal predecessors, (17365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:45:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 17365 transitions. [2022-11-26 00:45:29,486 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 17365 transitions. Word has length 27 [2022-11-26 00:45:29,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:29,487 INFO L495 AbstractCegarLoop]: Abstraction has 5384 states and 17365 transitions. [2022-11-26 00:45:29,487 INFO L496 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) [2022-11-26 00:45:29,487 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 17365 transitions. [2022-11-26 00:45:29,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:45:29,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:29,491 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:45:29,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-26 00:45:29,492 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:45:29,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:29,492 INFO L85 PathProgramCache]: Analyzing trace with hash 24063145, now seen corresponding path program 1 times [2022-11-26 00:45:29,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:29,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949070254] [2022-11-26 00:45:29,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:29,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:30,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:30,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949070254] [2022-11-26 00:45:30,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949070254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:45:30,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:45:30,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-26 00:45:30,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098925371] [2022-11-26 00:45:30,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:45:30,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-26 00:45:30,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:45:30,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-26 00:45:30,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-26 00:45:30,776 INFO L87 Difference]: Start difference. First operand 5384 states and 17365 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) [2022-11-26 00:45:33,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:33,054 INFO L93 Difference]: Finished difference Result 7149 states and 23143 transitions. [2022-11-26 00:45:33,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 00:45:33,055 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 [2022-11-26 00:45:33,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:33,071 INFO L225 Difference]: With dead ends: 7149 [2022-11-26 00:45:33,071 INFO L226 Difference]: Without dead ends: 7149 [2022-11-26 00:45:33,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2022-11-26 00:45:33,073 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 297 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 2214 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:33,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 45 Invalid, 2230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2214 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-26 00:45:33,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7149 states. [2022-11-26 00:45:33,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7149 to 4876. [2022-11-26 00:45:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 4872 states have (on average 3.202791461412151) internal successors, (15604), 4875 states have internal predecessors, (15604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:45:33,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 15604 transitions. [2022-11-26 00:45:33,181 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 15604 transitions. Word has length 27 [2022-11-26 00:45:33,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:33,181 INFO L495 AbstractCegarLoop]: Abstraction has 4876 states and 15604 transitions. [2022-11-26 00:45:33,182 INFO L496 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) [2022-11-26 00:45:33,182 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 15604 transitions. [2022-11-26 00:45:33,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:45:33,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:33,187 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:45:33,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-26 00:45:33,187 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:45:33,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:33,187 INFO L85 PathProgramCache]: Analyzing trace with hash 300519996, now seen corresponding path program 4 times [2022-11-26 00:45:33,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:33,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530421276] [2022-11-26 00:45:33,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:33,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:34,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:34,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530421276] [2022-11-26 00:45:34,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530421276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:45:34,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:45:34,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 00:45:34,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415961493] [2022-11-26 00:45:34,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:45:34,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 00:45:34,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:45:34,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 00:45:34,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:45:34,276 INFO L87 Difference]: Start difference. First operand 4876 states and 15604 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) [2022-11-26 00:45:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:36,461 INFO L93 Difference]: Finished difference Result 7256 states and 23565 transitions. [2022-11-26 00:45:36,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-26 00:45:36,462 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 [2022-11-26 00:45:36,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:36,479 INFO L225 Difference]: With dead ends: 7256 [2022-11-26 00:45:36,479 INFO L226 Difference]: Without dead ends: 7256 [2022-11-26 00:45:36,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2022-11-26 00:45:36,480 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 294 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 2419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:36,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 74 Invalid, 2419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2409 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-26 00:45:36,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7256 states. [2022-11-26 00:45:36,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7256 to 5069. [2022-11-26 00:45:36,563 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) [2022-11-26 00:45:36,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5069 states to 5069 states and 16217 transitions. [2022-11-26 00:45:36,575 INFO L78 Accepts]: Start accepts. Automaton has 5069 states and 16217 transitions. Word has length 27 [2022-11-26 00:45:36,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:36,575 INFO L495 AbstractCegarLoop]: Abstraction has 5069 states and 16217 transitions. [2022-11-26 00:45:36,575 INFO L496 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) [2022-11-26 00:45:36,575 INFO L276 IsEmpty]: Start isEmpty. Operand 5069 states and 16217 transitions. [2022-11-26 00:45:36,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:45:36,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:36,581 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:45:36,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-26 00:45:36,582 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:45:36,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:36,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1483140774, now seen corresponding path program 6 times [2022-11-26 00:45:36,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:36,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256355511] [2022-11-26 00:45:36,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:36,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:37,471 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:37,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256355511] [2022-11-26 00:45:37,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256355511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:45:37,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:45:37,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-26 00:45:37,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715584820] [2022-11-26 00:45:37,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:45:37,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-26 00:45:37,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:45:37,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-26 00:45:37,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-11-26 00:45:37,473 INFO L87 Difference]: Start difference. First operand 5069 states and 16217 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) [2022-11-26 00:45:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:40,021 INFO L93 Difference]: Finished difference Result 7579 states and 24420 transitions. [2022-11-26 00:45:40,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 00:45:40,023 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 [2022-11-26 00:45:40,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:40,039 INFO L225 Difference]: With dead ends: 7579 [2022-11-26 00:45:40,039 INFO L226 Difference]: Without dead ends: 7579 [2022-11-26 00:45:40,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2022-11-26 00:45:40,040 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 360 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:40,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 98 Invalid, 2743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2729 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-26 00:45:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7579 states. [2022-11-26 00:45:40,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7579 to 5193. [2022-11-26 00:45:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5193 states, 5189 states have (on average 3.1969550973212564) internal successors, (16589), 5192 states have internal predecessors, (16589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:45:40,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 16589 transitions. [2022-11-26 00:45:40,147 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 16589 transitions. Word has length 27 [2022-11-26 00:45:40,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:40,148 INFO L495 AbstractCegarLoop]: Abstraction has 5193 states and 16589 transitions. [2022-11-26 00:45:40,148 INFO L496 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) [2022-11-26 00:45:40,148 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 16589 transitions. [2022-11-26 00:45:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:45:40,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:40,153 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:45:40,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-26 00:45:40,153 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:45:40,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:40,154 INFO L85 PathProgramCache]: Analyzing trace with hash 947380032, now seen corresponding path program 7 times [2022-11-26 00:45:40,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:40,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417385659] [2022-11-26 00:45:40,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:40,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:41,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:41,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:41,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417385659] [2022-11-26 00:45:41,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417385659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:45:41,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:45:41,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-26 00:45:41,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670441915] [2022-11-26 00:45:41,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:45:41,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 00:45:41,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:45:41,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 00:45:41,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:45:41,233 INFO L87 Difference]: Start difference. First operand 5193 states and 16589 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) [2022-11-26 00:45:43,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:43,683 INFO L93 Difference]: Finished difference Result 6727 states and 21736 transitions. [2022-11-26 00:45:43,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:45:43,684 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 [2022-11-26 00:45:43,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:43,699 INFO L225 Difference]: With dead ends: 6727 [2022-11-26 00:45:43,699 INFO L226 Difference]: Without dead ends: 6727 [2022-11-26 00:45:43,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=763, Unknown=0, NotChecked=0, Total=930 [2022-11-26 00:45:43,699 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 358 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:43,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 73 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-26 00:45:43,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6727 states. [2022-11-26 00:45:43,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6727 to 5301. [2022-11-26 00:45:43,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5301 states, 5297 states have (on average 3.192939399660185) internal successors, (16913), 5300 states have internal predecessors, (16913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:45:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5301 states to 5301 states and 16913 transitions. [2022-11-26 00:45:43,828 INFO L78 Accepts]: Start accepts. Automaton has 5301 states and 16913 transitions. Word has length 27 [2022-11-26 00:45:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:43,828 INFO L495 AbstractCegarLoop]: Abstraction has 5301 states and 16913 transitions. [2022-11-26 00:45:43,828 INFO L496 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) [2022-11-26 00:45:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 5301 states and 16913 transitions. [2022-11-26 00:45:43,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:45:43,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:43,833 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:45:43,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-26 00:45:43,834 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:45:43,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:43,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1179231368, now seen corresponding path program 8 times [2022-11-26 00:45:43,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:43,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331566783] [2022-11-26 00:45:43,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:43,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:44,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:44,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331566783] [2022-11-26 00:45:44,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331566783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:45:44,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:45:44,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-26 00:45:44,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017199504] [2022-11-26 00:45:44,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:45:44,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 00:45:44,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:45:44,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 00:45:44,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:45:44,907 INFO L87 Difference]: Start difference. First operand 5301 states and 16913 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) [2022-11-26 00:45:48,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:48,252 INFO L93 Difference]: Finished difference Result 7810 states and 25292 transitions. [2022-11-26 00:45:48,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-26 00:45:48,253 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 [2022-11-26 00:45:48,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:48,269 INFO L225 Difference]: With dead ends: 7810 [2022-11-26 00:45:48,269 INFO L226 Difference]: Without dead ends: 7810 [2022-11-26 00:45:48,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=203, Invalid=1057, Unknown=0, NotChecked=0, Total=1260 [2022-11-26 00:45:48,270 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 369 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 3405 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 3420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:48,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 94 Invalid, 3420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3405 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-26 00:45:48,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7810 states. [2022-11-26 00:45:48,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7810 to 5553. [2022-11-26 00:45:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5553 states, 5549 states have (on average 3.2020183816903947) internal successors, (17768), 5552 states have internal predecessors, (17768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:45:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5553 states to 5553 states and 17768 transitions. [2022-11-26 00:45:48,383 INFO L78 Accepts]: Start accepts. Automaton has 5553 states and 17768 transitions. Word has length 27 [2022-11-26 00:45:48,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:48,384 INFO L495 AbstractCegarLoop]: Abstraction has 5553 states and 17768 transitions. [2022-11-26 00:45:48,384 INFO L496 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) [2022-11-26 00:45:48,384 INFO L276 IsEmpty]: Start isEmpty. Operand 5553 states and 17768 transitions. [2022-11-26 00:45:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:45:48,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:48,391 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:45:48,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-26 00:45:48,391 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:45:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:48,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1017838528, now seen corresponding path program 9 times [2022-11-26 00:45:48,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:48,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594670419] [2022-11-26 00:45:48,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:48,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:49,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:49,308 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:49,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594670419] [2022-11-26 00:45:49,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594670419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:45:49,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:45:49,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-26 00:45:49,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468548190] [2022-11-26 00:45:49,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:45:49,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 00:45:49,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:45:49,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 00:45:49,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:45:49,310 INFO L87 Difference]: Start difference. First operand 5553 states and 17768 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) [2022-11-26 00:45:52,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:52,195 INFO L93 Difference]: Finished difference Result 7771 states and 25162 transitions. [2022-11-26 00:45:52,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:45:52,195 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 [2022-11-26 00:45:52,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:52,211 INFO L225 Difference]: With dead ends: 7771 [2022-11-26 00:45:52,211 INFO L226 Difference]: Without dead ends: 7771 [2022-11-26 00:45:52,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 00:45:52,212 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 405 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:52,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 98 Invalid, 2898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-26 00:45:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7771 states. [2022-11-26 00:45:52,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7771 to 5574. [2022-11-26 00:45:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5574 states, 5570 states have (on average 3.201795332136445) internal successors, (17834), 5573 states have internal predecessors, (17834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:45:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5574 states to 5574 states and 17834 transitions. [2022-11-26 00:45:52,324 INFO L78 Accepts]: Start accepts. Automaton has 5574 states and 17834 transitions. Word has length 27 [2022-11-26 00:45:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:52,324 INFO L495 AbstractCegarLoop]: Abstraction has 5574 states and 17834 transitions. [2022-11-26 00:45:52,324 INFO L496 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) [2022-11-26 00:45:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 5574 states and 17834 transitions. [2022-11-26 00:45:52,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:45:52,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:52,330 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:45:52,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-26 00:45:52,330 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:45:52,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:52,330 INFO L85 PathProgramCache]: Analyzing trace with hash -2003527104, now seen corresponding path program 10 times [2022-11-26 00:45:52,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:52,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136802058] [2022-11-26 00:45:52,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:52,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:53,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:53,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:53,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136802058] [2022-11-26 00:45:53,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136802058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:45:53,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:45:53,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-26 00:45:53,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967149007] [2022-11-26 00:45:53,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:45:53,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 00:45:53,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:45:53,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 00:45:53,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:45:53,609 INFO L87 Difference]: Start difference. First operand 5574 states and 17834 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) [2022-11-26 00:45:56,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:56,517 INFO L93 Difference]: Finished difference Result 7980 states and 25617 transitions. [2022-11-26 00:45:56,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:45:56,518 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 [2022-11-26 00:45:56,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:56,539 INFO L225 Difference]: With dead ends: 7980 [2022-11-26 00:45:56,539 INFO L226 Difference]: Without dead ends: 7980 [2022-11-26 00:45:56,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2022-11-26 00:45:56,540 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 339 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 3014 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:56,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 93 Invalid, 3030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3014 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-26 00:45:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7980 states. [2022-11-26 00:45:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7980 to 6174. [2022-11-26 00:45:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6174 states, 6170 states have (on average 3.182171799027553) internal successors, (19634), 6173 states have internal predecessors, (19634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:45:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6174 states to 6174 states and 19634 transitions. [2022-11-26 00:45:56,743 INFO L78 Accepts]: Start accepts. Automaton has 6174 states and 19634 transitions. Word has length 27 [2022-11-26 00:45:56,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:56,744 INFO L495 AbstractCegarLoop]: Abstraction has 6174 states and 19634 transitions. [2022-11-26 00:45:56,744 INFO L496 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) [2022-11-26 00:45:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 6174 states and 19634 transitions. [2022-11-26 00:45:56,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:45:56,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:56,754 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:45:56,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-26 00:45:56,754 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:45:56,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:56,755 INFO L85 PathProgramCache]: Analyzing trace with hash 164828792, now seen corresponding path program 11 times [2022-11-26 00:45:56,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:56,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056046296] [2022-11-26 00:45:56,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:56,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:57,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:57,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056046296] [2022-11-26 00:45:57,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056046296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:45:57,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:45:57,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-26 00:45:57,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773416524] [2022-11-26 00:45:57,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:45:57,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 00:45:57,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:45:57,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 00:45:57,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:45:57,654 INFO L87 Difference]: Start difference. First operand 6174 states and 19634 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) [2022-11-26 00:46:01,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:46:01,119 INFO L93 Difference]: Finished difference Result 9154 states and 29508 transitions. [2022-11-26 00:46:01,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-26 00:46:01,120 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 [2022-11-26 00:46:01,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:46:01,138 INFO L225 Difference]: With dead ends: 9154 [2022-11-26 00:46:01,138 INFO L226 Difference]: Without dead ends: 9154 [2022-11-26 00:46:01,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=209, Invalid=1051, Unknown=0, NotChecked=0, Total=1260 [2022-11-26 00:46:01,139 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 345 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 3570 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 3585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:46:01,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 96 Invalid, 3585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3570 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-26 00:46:01,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9154 states. [2022-11-26 00:46:01,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9154 to 6094. [2022-11-26 00:46:01,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6094 states, 6090 states have (on average 3.1886699507389165) internal successors, (19419), 6093 states have internal predecessors, (19419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:46:01,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6094 states to 6094 states and 19419 transitions. [2022-11-26 00:46:01,256 INFO L78 Accepts]: Start accepts. Automaton has 6094 states and 19419 transitions. Word has length 27 [2022-11-26 00:46:01,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:46:01,256 INFO L495 AbstractCegarLoop]: Abstraction has 6094 states and 19419 transitions. [2022-11-26 00:46:01,257 INFO L496 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) [2022-11-26 00:46:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 6094 states and 19419 transitions. [2022-11-26 00:46:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:46:01,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:46:01,264 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:46:01,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-26 00:46:01,264 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:46:01,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:46:01,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1410838618, now seen corresponding path program 12 times [2022-11-26 00:46:01,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:46:01,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692130901] [2022-11-26 00:46:01,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:46:01,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:46:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:46:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:46:02,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:46:02,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692130901] [2022-11-26 00:46:02,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692130901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:46:02,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:46:02,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-26 00:46:02,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381010742] [2022-11-26 00:46:02,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:46:02,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 00:46:02,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:46:02,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 00:46:02,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:46:02,444 INFO L87 Difference]: Start difference. First operand 6094 states and 19419 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) [2022-11-26 00:46:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:46:05,954 INFO L93 Difference]: Finished difference Result 7748 states and 25065 transitions. [2022-11-26 00:46:05,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-26 00:46:05,955 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 [2022-11-26 00:46:05,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:46:05,971 INFO L225 Difference]: With dead ends: 7748 [2022-11-26 00:46:05,971 INFO L226 Difference]: Without dead ends: 7748 [2022-11-26 00:46:05,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=253, Invalid=1007, Unknown=0, NotChecked=0, Total=1260 [2022-11-26 00:46:05,972 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 373 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 2957 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:46:05,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 80 Invalid, 2974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2957 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-26 00:46:05,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7748 states. [2022-11-26 00:46:06,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7748 to 6482. [2022-11-26 00:46:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6482 states, 6478 states have (on average 3.212256869404137) internal successors, (20809), 6481 states have internal predecessors, (20809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:46:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6482 states to 6482 states and 20809 transitions. [2022-11-26 00:46:06,102 INFO L78 Accepts]: Start accepts. Automaton has 6482 states and 20809 transitions. Word has length 27 [2022-11-26 00:46:06,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:46:06,102 INFO L495 AbstractCegarLoop]: Abstraction has 6482 states and 20809 transitions. [2022-11-26 00:46:06,102 INFO L496 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) [2022-11-26 00:46:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 6482 states and 20809 transitions. [2022-11-26 00:46:06,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:46:06,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:46:06,111 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:46:06,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-26 00:46:06,112 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:46:06,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:46:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1410838617, now seen corresponding path program 1 times [2022-11-26 00:46:06,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:46:06,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055840234] [2022-11-26 00:46:06,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:46:06,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:46:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:46:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:46:06,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:46:06,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055840234] [2022-11-26 00:46:06,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055840234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:46:06,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:46:06,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-26 00:46:06,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649183121] [2022-11-26 00:46:06,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:46:06,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-26 00:46:06,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:46:06,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-26 00:46:06,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-11-26 00:46:06,963 INFO L87 Difference]: Start difference. First operand 6482 states and 20809 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) [2022-11-26 00:46:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:46:09,397 INFO L93 Difference]: Finished difference Result 8586 states and 27712 transitions. [2022-11-26 00:46:09,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 00:46:09,398 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 [2022-11-26 00:46:09,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:46:09,418 INFO L225 Difference]: With dead ends: 8586 [2022-11-26 00:46:09,418 INFO L226 Difference]: Without dead ends: 8586 [2022-11-26 00:46:09,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2022-11-26 00:46:09,419 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 349 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 2574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:46:09,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 88 Invalid, 2574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2564 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-26 00:46:09,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8586 states. [2022-11-26 00:46:09,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8586 to 5354. [2022-11-26 00:46:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5354 states, 5350 states have (on average 3.2110280373831777) internal successors, (17179), 5353 states have internal predecessors, (17179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:46:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5354 states to 5354 states and 17179 transitions. [2022-11-26 00:46:09,539 INFO L78 Accepts]: Start accepts. Automaton has 5354 states and 17179 transitions. Word has length 27 [2022-11-26 00:46:09,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:46:09,540 INFO L495 AbstractCegarLoop]: Abstraction has 5354 states and 17179 transitions. [2022-11-26 00:46:09,540 INFO L496 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) [2022-11-26 00:46:09,540 INFO L276 IsEmpty]: Start isEmpty. Operand 5354 states and 17179 transitions. [2022-11-26 00:46:09,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:46:09,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:46:09,548 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:46:09,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-26 00:46:09,548 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:46:09,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:46:09,548 INFO L85 PathProgramCache]: Analyzing trace with hash -334440724, now seen corresponding path program 5 times [2022-11-26 00:46:09,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:46:09,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531021577] [2022-11-26 00:46:09,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:46:09,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:46:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:46:10,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:46:10,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:46:10,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531021577] [2022-11-26 00:46:10,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531021577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:46:10,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:46:10,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-26 00:46:10,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192746343] [2022-11-26 00:46:10,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:46:10,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-26 00:46:10,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:46:10,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-26 00:46:10,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-11-26 00:46:10,581 INFO L87 Difference]: Start difference. First operand 5354 states and 17179 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) [2022-11-26 00:46:12,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:46:12,601 INFO L93 Difference]: Finished difference Result 6783 states and 22011 transitions. [2022-11-26 00:46:12,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 00:46:12,601 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 [2022-11-26 00:46:12,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:46:12,620 INFO L225 Difference]: With dead ends: 6783 [2022-11-26 00:46:12,620 INFO L226 Difference]: Without dead ends: 6783 [2022-11-26 00:46:12,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2022-11-26 00:46:12,621 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 295 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 2003 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:46:12,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 43 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2003 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-26 00:46:12,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6783 states. [2022-11-26 00:46:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6783 to 5227. [2022-11-26 00:46:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5227 states, 5223 states have (on average 3.216159295424086) internal successors, (16798), 5226 states have internal predecessors, (16798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:46:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 16798 transitions. [2022-11-26 00:46:12,738 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 16798 transitions. Word has length 27 [2022-11-26 00:46:12,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:46:12,738 INFO L495 AbstractCegarLoop]: Abstraction has 5227 states and 16798 transitions. [2022-11-26 00:46:12,738 INFO L496 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) [2022-11-26 00:46:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 16798 transitions. [2022-11-26 00:46:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:46:12,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:46:12,744 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:46:12,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-26 00:46:12,744 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:46:12,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:46:12,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1565832288, now seen corresponding path program 6 times [2022-11-26 00:46:12,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:46:12,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223183441] [2022-11-26 00:46:12,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:46:12,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:46:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:46:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:46:13,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:46:13,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223183441] [2022-11-26 00:46:13,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223183441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:46:13,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:46:13,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-26 00:46:13,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765535203] [2022-11-26 00:46:13,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:46:13,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-26 00:46:13,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:46:13,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-26 00:46:13,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-11-26 00:46:13,774 INFO L87 Difference]: Start difference. First operand 5227 states and 16798 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) [2022-11-26 00:46:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:46:15,988 INFO L93 Difference]: Finished difference Result 7901 states and 25540 transitions. [2022-11-26 00:46:15,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 00:46:15,989 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 [2022-11-26 00:46:15,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:46:16,006 INFO L225 Difference]: With dead ends: 7901 [2022-11-26 00:46:16,006 INFO L226 Difference]: Without dead ends: 7901 [2022-11-26 00:46:16,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2022-11-26 00:46:16,007 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 255 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 2346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:46:16,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 56 Invalid, 2346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2332 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-26 00:46:16,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7901 states. [2022-11-26 00:46:16,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7901 to 5524. [2022-11-26 00:46:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5520 states have (on average 3.2045289855072463) internal successors, (17689), 5523 states have internal predecessors, (17689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:46:16,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 17689 transitions. [2022-11-26 00:46:16,110 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 17689 transitions. Word has length 27 [2022-11-26 00:46:16,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:46:16,110 INFO L495 AbstractCegarLoop]: Abstraction has 5524 states and 17689 transitions. [2022-11-26 00:46:16,110 INFO L496 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) [2022-11-26 00:46:16,110 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 17689 transitions. [2022-11-26 00:46:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:46:16,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:46:16,116 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:46:16,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-26 00:46:16,116 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:46:16,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:46:16,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1842289140, now seen corresponding path program 7 times [2022-11-26 00:46:16,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:46:16,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128177124] [2022-11-26 00:46:16,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:46:16,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:46:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:46:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:46:17,008 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:46:17,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128177124] [2022-11-26 00:46:17,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128177124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:46:17,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:46:17,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 00:46:17,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664860014] [2022-11-26 00:46:17,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:46:17,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 00:46:17,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:46:17,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 00:46:17,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:46:17,010 INFO L87 Difference]: Start difference. First operand 5524 states and 17689 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) [2022-11-26 00:46:19,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:46:19,204 INFO L93 Difference]: Finished difference Result 8152 states and 26421 transitions. [2022-11-26 00:46:19,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-26 00:46:19,204 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 [2022-11-26 00:46:19,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:46:19,232 INFO L225 Difference]: With dead ends: 8152 [2022-11-26 00:46:19,232 INFO L226 Difference]: Without dead ends: 8152 [2022-11-26 00:46:19,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2022-11-26 00:46:19,233 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 326 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 2422 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:46:19,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 80 Invalid, 2431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2422 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-26 00:46:19,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8152 states. [2022-11-26 00:46:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8152 to 5128. [2022-11-26 00:46:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5128 states, 5124 states have (on average 3.220335675253708) internal successors, (16501), 5127 states have internal predecessors, (16501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:46:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5128 states to 5128 states and 16501 transitions. [2022-11-26 00:46:19,357 INFO L78 Accepts]: Start accepts. Automaton has 5128 states and 16501 transitions. Word has length 27 [2022-11-26 00:46:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:46:19,357 INFO L495 AbstractCegarLoop]: Abstraction has 5128 states and 16501 transitions. [2022-11-26 00:46:19,357 INFO L496 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) [2022-11-26 00:46:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 5128 states and 16501 transitions. [2022-11-26 00:46:19,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:46:19,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:46:19,362 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:46:19,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-26 00:46:19,362 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:46:19,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:46:19,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2136256262, now seen corresponding path program 8 times [2022-11-26 00:46:19,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:46:19,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414869510] [2022-11-26 00:46:19,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:46:19,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:46:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:46:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:46:20,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:46:20,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414869510] [2022-11-26 00:46:20,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414869510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:46:20,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:46:20,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-26 00:46:20,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115427432] [2022-11-26 00:46:20,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:46:20,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 00:46:20,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:46:20,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 00:46:20,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:46:20,557 INFO L87 Difference]: Start difference. First operand 5128 states and 16501 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) [2022-11-26 00:46:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:46:23,419 INFO L93 Difference]: Finished difference Result 6596 states and 21450 transitions. [2022-11-26 00:46:23,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-26 00:46:23,420 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 [2022-11-26 00:46:23,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:46:23,438 INFO L225 Difference]: With dead ends: 6596 [2022-11-26 00:46:23,438 INFO L226 Difference]: Without dead ends: 6596 [2022-11-26 00:46:23,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2022-11-26 00:46:23,440 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 292 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 2983 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:46:23,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 81 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2983 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-26 00:46:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6596 states. [2022-11-26 00:46:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6596 to 5095. [2022-11-26 00:46:23,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5095 states, 5091 states have (on average 3.2217638970732665) internal successors, (16402), 5094 states have internal predecessors, (16402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:46:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 16402 transitions. [2022-11-26 00:46:23,572 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 16402 transitions. Word has length 27 [2022-11-26 00:46:23,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:46:23,572 INFO L495 AbstractCegarLoop]: Abstraction has 5095 states and 16402 transitions. [2022-11-26 00:46:23,573 INFO L496 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) [2022-11-26 00:46:23,573 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 16402 transitions. [2022-11-26 00:46:23,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:46:23,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:46:23,582 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:46:23,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-26 00:46:23,582 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:46:23,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:46:23,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1632535772, now seen corresponding path program 9 times [2022-11-26 00:46:23,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:46:23,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294111738] [2022-11-26 00:46:23,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:46:23,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:46:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:46:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:46:24,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:46:24,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294111738] [2022-11-26 00:46:24,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294111738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:46:24,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:46:24,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-26 00:46:24,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707657136] [2022-11-26 00:46:24,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:46:24,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-26 00:46:24,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:46:24,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-26 00:46:24,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-11-26 00:46:24,748 INFO L87 Difference]: Start difference. First operand 5095 states and 16402 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) [2022-11-26 00:46:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:46:27,393 INFO L93 Difference]: Finished difference Result 7701 states and 25068 transitions. [2022-11-26 00:46:27,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 00:46:27,394 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 [2022-11-26 00:46:27,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:46:27,415 INFO L225 Difference]: With dead ends: 7701 [2022-11-26 00:46:27,415 INFO L226 Difference]: Without dead ends: 7701 [2022-11-26 00:46:27,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2022-11-26 00:46:27,416 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 347 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2787 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 2801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:46:27,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 100 Invalid, 2801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2787 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-26 00:46:27,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7701 states. [2022-11-26 00:46:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7701 to 4798. [2022-11-26 00:46:27,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4798 states, 4794 states have (on average 3.235502711722987) internal successors, (15511), 4797 states have internal predecessors, (15511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:46:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4798 states to 4798 states and 15511 transitions. [2022-11-26 00:46:27,552 INFO L78 Accepts]: Start accepts. Automaton has 4798 states and 15511 transitions. Word has length 27 [2022-11-26 00:46:27,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:46:27,552 INFO L495 AbstractCegarLoop]: Abstraction has 4798 states and 15511 transitions. [2022-11-26 00:46:27,552 INFO L496 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) [2022-11-26 00:46:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 4798 states and 15511 transitions. [2022-11-26 00:46:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:46:27,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:46:27,559 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:46:27,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-26 00:46:27,559 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:46:27,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:46:27,559 INFO L85 PathProgramCache]: Analyzing trace with hash -61124388, now seen corresponding path program 10 times [2022-11-26 00:46:27,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:46:27,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129897498] [2022-11-26 00:46:27,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:46:27,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:46:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:46:28,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:46:28,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:46:28,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129897498] [2022-11-26 00:46:28,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129897498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:46:28,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:46:28,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 00:46:28,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817937155] [2022-11-26 00:46:28,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:46:28,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 00:46:28,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:46:28,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 00:46:28,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:46:28,318 INFO L87 Difference]: Start difference. First operand 4798 states and 15511 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) [2022-11-26 00:46:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:46:30,607 INFO L93 Difference]: Finished difference Result 7969 states and 26262 transitions. [2022-11-26 00:46:30,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:46:30,608 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 [2022-11-26 00:46:30,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:46:30,626 INFO L225 Difference]: With dead ends: 7969 [2022-11-26 00:46:30,626 INFO L226 Difference]: Without dead ends: 7969 [2022-11-26 00:46:30,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2022-11-26 00:46:30,627 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 365 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:46:30,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 84 Invalid, 2453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2441 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-26 00:46:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7969 states. [2022-11-26 00:46:30,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7969 to 4841. [2022-11-26 00:46:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4841 states, 4837 states have (on average 3.2373371924746746) internal successors, (15659), 4840 states have internal predecessors, (15659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:46:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 15659 transitions. [2022-11-26 00:46:30,730 INFO L78 Accepts]: Start accepts. Automaton has 4841 states and 15659 transitions. Word has length 27 [2022-11-26 00:46:30,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:46:30,730 INFO L495 AbstractCegarLoop]: Abstraction has 4841 states and 15659 transitions. [2022-11-26 00:46:30,730 INFO L496 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) [2022-11-26 00:46:30,730 INFO L276 IsEmpty]: Start isEmpty. Operand 4841 states and 15659 transitions. [2022-11-26 00:46:30,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:46:30,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:46:30,735 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:46:30,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-26 00:46:30,735 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:46:30,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:46:30,736 INFO L85 PathProgramCache]: Analyzing trace with hash -101159494, now seen corresponding path program 11 times [2022-11-26 00:46:30,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:46:30,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895658461] [2022-11-26 00:46:30,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:46:30,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:46:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:46:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:46:31,696 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:46:31,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895658461] [2022-11-26 00:46:31,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895658461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:46:31,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:46:31,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 00:46:31,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704121135] [2022-11-26 00:46:31,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:46:31,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 00:46:31,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:46:31,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 00:46:31,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:46:31,697 INFO L87 Difference]: Start difference. First operand 4841 states and 15659 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) [2022-11-26 00:46:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:46:33,957 INFO L93 Difference]: Finished difference Result 6607 states and 21610 transitions. [2022-11-26 00:46:33,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-26 00:46:33,958 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 [2022-11-26 00:46:33,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:46:33,972 INFO L225 Difference]: With dead ends: 6607 [2022-11-26 00:46:33,972 INFO L226 Difference]: Without dead ends: 6607 [2022-11-26 00:46:33,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2022-11-26 00:46:33,973 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 328 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2433 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:46:33,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 83 Invalid, 2444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2433 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-26 00:46:33,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6607 states. [2022-11-26 00:46:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6607 to 4591. [2022-11-26 00:46:34,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4591 states, 4587 states have (on average 3.2459123610202747) internal successors, (14889), 4590 states have internal predecessors, (14889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:46:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4591 states to 4591 states and 14889 transitions. [2022-11-26 00:46:34,097 INFO L78 Accepts]: Start accepts. Automaton has 4591 states and 14889 transitions. Word has length 27 [2022-11-26 00:46:34,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:46:34,098 INFO L495 AbstractCegarLoop]: Abstraction has 4591 states and 14889 transitions. [2022-11-26 00:46:34,098 INFO L496 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) [2022-11-26 00:46:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 4591 states and 14889 transitions. [2022-11-26 00:46:34,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-26 00:46:34,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:46:34,105 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:46:34,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-26 00:46:34,105 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:46:34,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:46:34,106 INFO L85 PathProgramCache]: Analyzing trace with hash 392542502, now seen corresponding path program 1 times [2022-11-26 00:46:34,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:46:34,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283181850] [2022-11-26 00:46:34,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:46:34,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:46:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:46:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:46:35,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:46:35,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283181850] [2022-11-26 00:46:35,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283181850] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:46:35,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666287526] [2022-11-26 00:46:35,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:46:35,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:46:35,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:46:35,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:46:35,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:46:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:46:35,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-26 00:46:35,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:46:35,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:46:35,643 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-26 00:46:35,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:46:35,651 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 23 [2022-11-26 00:46:35,665 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 12 [2022-11-26 00:46:35,736 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 21 [2022-11-26 00:46:36,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:46:36,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:46:36,228 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-11-26 00:46:36,228 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 38 [2022-11-26 00:46:36,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:46:36,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 33 treesize of output 31 [2022-11-26 00:46:36,477 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-26 00:46:36,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2022-11-26 00:46:36,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:46:36,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:46:38,164 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1507 Int) (v_ArrVal_1509 Int) (v_ArrVal_1506 (Array Int Int))) (or (< 0 (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1506))) (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 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse2 .cse3) 4)) v_ArrVal_1507)) .cse3 v_ArrVal_1509)))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 4 (* 4 (select .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|)))))) (< v_ArrVal_1507 1))) is different from false [2022-11-26 00:46:38,183 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1507 Int) (v_ArrVal_1509 Int) (v_ArrVal_1506 (Array Int Int))) (or (< v_ArrVal_1507 1) (< 0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (let ((.cse0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1506) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse2 .cse1) 4)) v_ArrVal_1507)))) (select (store .cse0 .cse1 v_ArrVal_1509) (+ (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4))))))) is different from false [2022-11-26 00:46:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:46:38,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666287526] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:46:38,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1693526333] [2022-11-26 00:46:38,195 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-26 00:46:38,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:46:38,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 36 [2022-11-26 00:46:38,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138208903] [2022-11-26 00:46:38,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:46:38,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-26 00:46:38,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:46:38,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-26 00:46:38,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1152, Unknown=2, NotChecked=138, Total=1406 [2022-11-26 00:46:38,200 INFO L87 Difference]: Start difference. First operand 4591 states and 14889 transitions. Second operand has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:46:43,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:46:43,533 INFO L93 Difference]: Finished difference Result 6939 states and 22749 transitions. [2022-11-26 00:46:43,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-26 00:46:43,534 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 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 [2022-11-26 00:46:43,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:46:43,549 INFO L225 Difference]: With dead ends: 6939 [2022-11-26 00:46:43,549 INFO L226 Difference]: Without dead ends: 6939 [2022-11-26 00:46:43,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=370, Invalid=2392, Unknown=2, NotChecked=206, Total=2970 [2022-11-26 00:46:43,550 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 688 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 4030 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 4030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:46:43,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 148 Invalid, 4314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 4030 Invalid, 0 Unknown, 272 Unchecked, 3.8s Time] [2022-11-26 00:46:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6939 states. [2022-11-26 00:46:43,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6939 to 4591. [2022-11-26 00:46:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4591 states, 4587 states have (on average 3.2459123610202747) internal successors, (14889), 4590 states have internal predecessors, (14889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:46:43,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4591 states to 4591 states and 14889 transitions. [2022-11-26 00:46:43,640 INFO L78 Accepts]: Start accepts. Automaton has 4591 states and 14889 transitions. Word has length 29 [2022-11-26 00:46:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:46:43,640 INFO L495 AbstractCegarLoop]: Abstraction has 4591 states and 14889 transitions. [2022-11-26 00:46:43,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:46:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4591 states and 14889 transitions. [2022-11-26 00:46:43,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-26 00:46:43,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:46:43,645 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:46:43,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:46:43,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:46:43,846 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:46:43,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:46:43,846 INFO L85 PathProgramCache]: Analyzing trace with hash 872239086, now seen corresponding path program 2 times [2022-11-26 00:46:43,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:46:43,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117067220] [2022-11-26 00:46:43,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:46:43,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:46:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:46:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:46:44,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:46:44,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117067220] [2022-11-26 00:46:44,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117067220] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:46:44,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105439223] [2022-11-26 00:46:44,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:46:44,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:46:44,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:46:44,999 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:46:45,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:46:45,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:46:45,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:46:45,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-26 00:46:45,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:46:45,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:46:45,253 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-26 00:46:45,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:46:45,258 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 23 [2022-11-26 00:46:45,266 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 12 [2022-11-26 00:46:45,296 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 21 [2022-11-26 00:46:45,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:46:45,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:46:45,540 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-11-26 00:46:45,540 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 38 [2022-11-26 00:46:45,835 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-26 00:46:45,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 38 [2022-11-26 00:46:45,991 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-26 00:46:45,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2022-11-26 00:46:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:46:46,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:46:47,190 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1589 Int) (v_ArrVal_1588 Int)) (or (< 0 (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1586))) (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 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse2 .cse3)) 4) v_ArrVal_1588)) .cse3 v_ArrVal_1589)))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (select .cse0 (+ (* 4 (select .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|)) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 4)))) (< v_ArrVal_1588 1))) is different from false [2022-11-26 00:46:47,208 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1589 Int) (v_ArrVal_1588 Int)) (or (< 0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (let ((.cse0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1586) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse2 .cse1)) 4) v_ArrVal_1588)))) (select (store .cse0 .cse1 v_ArrVal_1589) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4)))))) (< v_ArrVal_1588 1))) is different from false [2022-11-26 00:46:47,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:46:47,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105439223] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:46:47,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1755966688] [2022-11-26 00:46:47,211 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-26 00:46:47,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:46:47,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 36 [2022-11-26 00:46:47,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275599570] [2022-11-26 00:46:47,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:46:47,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-26 00:46:47,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:46:47,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-26 00:46:47,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1152, Unknown=2, NotChecked=138, Total=1406 [2022-11-26 00:46:47,215 INFO L87 Difference]: Start difference. First operand 4591 states and 14889 transitions. Second operand has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:46:57,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:46:57,386 INFO L93 Difference]: Finished difference Result 9088 states and 30123 transitions. [2022-11-26 00:46:57,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-26 00:46:57,387 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 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 [2022-11-26 00:46:57,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:46:57,406 INFO L225 Difference]: With dead ends: 9088 [2022-11-26 00:46:57,406 INFO L226 Difference]: Without dead ends: 9088 [2022-11-26 00:46:57,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=479, Invalid=3187, Unknown=2, NotChecked=238, Total=3906 [2022-11-26 00:46:57,407 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 784 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5563 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 5563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 764 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:46:57,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 192 Invalid, 6340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 5563 Invalid, 0 Unknown, 764 Unchecked, 5.7s Time] [2022-11-26 00:46:57,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2022-11-26 00:46:57,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 5170. [2022-11-26 00:46:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5170 states, 5166 states have (on average 3.2880371660859464) internal successors, (16986), 5169 states have internal predecessors, (16986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:46:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5170 states to 5170 states and 16986 transitions. [2022-11-26 00:46:57,515 INFO L78 Accepts]: Start accepts. Automaton has 5170 states and 16986 transitions. Word has length 29 [2022-11-26 00:46:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:46:57,515 INFO L495 AbstractCegarLoop]: Abstraction has 5170 states and 16986 transitions. [2022-11-26 00:46:57,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:46:57,515 INFO L276 IsEmpty]: Start isEmpty. Operand 5170 states and 16986 transitions. [2022-11-26 00:46:57,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-26 00:46:57,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:46:57,520 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:46:57,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:46:57,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-11-26 00:46:57,721 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:46:57,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:46:57,721 INFO L85 PathProgramCache]: Analyzing trace with hash -116662444, now seen corresponding path program 3 times [2022-11-26 00:46:57,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:46:57,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870152510] [2022-11-26 00:46:57,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:46:57,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:46:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:46:58,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:46:58,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:46:58,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870152510] [2022-11-26 00:46:58,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870152510] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:46:58,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185301417] [2022-11-26 00:46:58,624 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:46:58,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:46:58,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:46:58,631 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:46:58,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:46:58,851 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:46:58,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:46:58,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-26 00:46:58,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:46:58,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:46:58,876 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-26 00:46:58,882 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 12 [2022-11-26 00:46:58,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-26 00:46:58,927 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 21 [2022-11-26 00:46:59,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:46:59,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:46:59,193 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-11-26 00:46:59,194 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 38 [2022-11-26 00:46:59,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:46:59,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 33 treesize of output 31 [2022-11-26 00:46:59,504 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-26 00:46:59,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2022-11-26 00:46:59,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:46:59,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:47:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:00,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185301417] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:47:00,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1926238608] [2022-11-26 00:47:00,901 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-26 00:47:00,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:47:00,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 36 [2022-11-26 00:47:00,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006676388] [2022-11-26 00:47:00,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:47:00,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-26 00:47:00,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:47:00,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-26 00:47:00,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1266, Unknown=22, NotChecked=0, Total=1406 [2022-11-26 00:47:00,906 INFO L87 Difference]: Start difference. First operand 5170 states and 16986 transitions. Second operand has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:07,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:47:07,217 INFO L93 Difference]: Finished difference Result 8660 states and 28733 transitions. [2022-11-26 00:47:07,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-26 00:47:07,218 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 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 [2022-11-26 00:47:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:47:07,236 INFO L225 Difference]: With dead ends: 8660 [2022-11-26 00:47:07,236 INFO L226 Difference]: Without dead ends: 8660 [2022-11-26 00:47:07,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=474, Invalid=2810, Unknown=22, NotChecked=0, Total=3306 [2022-11-26 00:47:07,237 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1050 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 4196 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 4217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:47:07,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 147 Invalid, 4217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4196 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-26 00:47:07,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8660 states. [2022-11-26 00:47:07,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8660 to 4589. [2022-11-26 00:47:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4589 states, 4585 states have (on average 3.244711014176663) internal successors, (14877), 4588 states have internal predecessors, (14877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4589 states to 4589 states and 14877 transitions. [2022-11-26 00:47:07,338 INFO L78 Accepts]: Start accepts. Automaton has 4589 states and 14877 transitions. Word has length 29 [2022-11-26 00:47:07,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:47:07,339 INFO L495 AbstractCegarLoop]: Abstraction has 4589 states and 14877 transitions. [2022-11-26 00:47:07,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 4589 states and 14877 transitions. [2022-11-26 00:47:07,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-26 00:47:07,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:47:07,344 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:47:07,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:47:07,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-11-26 00:47:07,544 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:47:07,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:47:07,545 INFO L85 PathProgramCache]: Analyzing trace with hash -750799834, now seen corresponding path program 4 times [2022-11-26 00:47:07,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:47:07,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595144836] [2022-11-26 00:47:07,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:47:07,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:47:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:47:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:08,495 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:47:08,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595144836] [2022-11-26 00:47:08,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595144836] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:47:08,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424818853] [2022-11-26 00:47:08,495 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:47:08,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:47:08,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:47:08,496 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:47:08,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:47:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:47:08,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-26 00:47:08,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:47:08,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:47:08,737 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-26 00:47:08,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:47:08,742 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 23 [2022-11-26 00:47:08,750 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 12 [2022-11-26 00:47:08,784 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 21 [2022-11-26 00:47:09,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:47:09,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:47:09,218 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-11-26 00:47:09,218 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 38 [2022-11-26 00:47:09,299 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-26 00:47:09,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 38 [2022-11-26 00:47:09,508 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-26 00:47:09,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2022-11-26 00:47:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:09,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:47:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:13,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424818853] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:47:13,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1641256795] [2022-11-26 00:47:13,076 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-26 00:47:13,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:47:13,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 37 [2022-11-26 00:47:13,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233217245] [2022-11-26 00:47:13,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:47:13,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-26 00:47:13,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:47:13,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-26 00:47:13,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1340, Unknown=21, NotChecked=0, Total=1482 [2022-11-26 00:47:13,079 INFO L87 Difference]: Start difference. First operand 4589 states and 14877 transitions. Second operand has 39 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 38 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:19,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:47:19,095 INFO L93 Difference]: Finished difference Result 6871 states and 22440 transitions. [2022-11-26 00:47:19,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-26 00:47:19,096 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 38 states have internal predecessors, (82), 0 states have call successors, (0), 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 [2022-11-26 00:47:19,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:47:19,110 INFO L225 Difference]: With dead ends: 6871 [2022-11-26 00:47:19,110 INFO L226 Difference]: Without dead ends: 6871 [2022-11-26 00:47:19,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=402, Invalid=2657, Unknown=21, NotChecked=0, Total=3080 [2022-11-26 00:47:19,111 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 861 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4361 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 4380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:47:19,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 153 Invalid, 4380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4361 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-26 00:47:19,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6871 states. [2022-11-26 00:47:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6871 to 4009. [2022-11-26 00:47:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4009 states, 4005 states have (on average 3.2491885143570536) internal successors, (13013), 4008 states have internal predecessors, (13013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 13013 transitions. [2022-11-26 00:47:19,190 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 13013 transitions. Word has length 29 [2022-11-26 00:47:19,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:47:19,191 INFO L495 AbstractCegarLoop]: Abstraction has 4009 states and 13013 transitions. [2022-11-26 00:47:19,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 38 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:19,191 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 13013 transitions. [2022-11-26 00:47:19,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:47:19,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:47:19,196 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:47:19,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-26 00:47:19,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:47:19,403 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:47:19,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:47:19,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1049117738, now seen corresponding path program 1 times [2022-11-26 00:47:19,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:47:19,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332416272] [2022-11-26 00:47:19,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:47:19,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:47:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:47:20,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:20,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:47:20,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332416272] [2022-11-26 00:47:20,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332416272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:47:20,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:47:20,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 00:47:20,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984837040] [2022-11-26 00:47:20,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:47:20,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 00:47:20,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:47:20,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 00:47:20,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:47:20,096 INFO L87 Difference]: Start difference. First operand 4009 states and 13013 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 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) [2022-11-26 00:47:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:47:21,861 INFO L93 Difference]: Finished difference Result 10277 states and 33818 transitions. [2022-11-26 00:47:21,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 00:47:21,861 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 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 [2022-11-26 00:47:21,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:47:21,884 INFO L225 Difference]: With dead ends: 10277 [2022-11-26 00:47:21,884 INFO L226 Difference]: Without dead ends: 10277 [2022-11-26 00:47:21,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2022-11-26 00:47:21,885 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 442 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:47:21,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 33 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-26 00:47:21,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10277 states. [2022-11-26 00:47:22,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10277 to 8572. [2022-11-26 00:47:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8572 states, 8568 states have (on average 3.3368347338935576) internal successors, (28590), 8571 states have internal predecessors, (28590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8572 states to 8572 states and 28590 transitions. [2022-11-26 00:47:22,078 INFO L78 Accepts]: Start accepts. Automaton has 8572 states and 28590 transitions. Word has length 30 [2022-11-26 00:47:22,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:47:22,079 INFO L495 AbstractCegarLoop]: Abstraction has 8572 states and 28590 transitions. [2022-11-26 00:47:22,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 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) [2022-11-26 00:47:22,079 INFO L276 IsEmpty]: Start isEmpty. Operand 8572 states and 28590 transitions. [2022-11-26 00:47:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:47:22,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:47:22,088 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:47:22,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-26 00:47:22,089 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:47:22,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:47:22,089 INFO L85 PathProgramCache]: Analyzing trace with hash -86623766, now seen corresponding path program 1 times [2022-11-26 00:47:22,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:47:22,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412105390] [2022-11-26 00:47:22,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:47:22,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:47:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:47:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:22,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:47:22,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412105390] [2022-11-26 00:47:22,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412105390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:47:22,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:47:22,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-26 00:47:22,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681885787] [2022-11-26 00:47:22,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:47:22,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:47:22,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:47:22,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:47:22,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:47:22,735 INFO L87 Difference]: Start difference. First operand 8572 states and 28590 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) [2022-11-26 00:47:24,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:47:24,876 INFO L93 Difference]: Finished difference Result 14704 states and 48698 transitions. [2022-11-26 00:47:24,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 00:47:24,876 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 [2022-11-26 00:47:24,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:47:24,910 INFO L225 Difference]: With dead ends: 14704 [2022-11-26 00:47:24,910 INFO L226 Difference]: Without dead ends: 14704 [2022-11-26 00:47:24,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2022-11-26 00:47:24,910 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 399 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:47:24,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 29 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-26 00:47:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14704 states. [2022-11-26 00:47:25,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14704 to 11134. [2022-11-26 00:47:25,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11134 states, 11130 states have (on average 3.3564240790655884) internal successors, (37357), 11133 states have internal predecessors, (37357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11134 states to 11134 states and 37357 transitions. [2022-11-26 00:47:25,153 INFO L78 Accepts]: Start accepts. Automaton has 11134 states and 37357 transitions. Word has length 30 [2022-11-26 00:47:25,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:47:25,153 INFO L495 AbstractCegarLoop]: Abstraction has 11134 states and 37357 transitions. [2022-11-26 00:47:25,153 INFO L496 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) [2022-11-26 00:47:25,153 INFO L276 IsEmpty]: Start isEmpty. Operand 11134 states and 37357 transitions. [2022-11-26 00:47:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:47:25,165 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:47:25,166 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:47:25,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-26 00:47:25,166 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:47:25,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:47:25,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1918051024, now seen corresponding path program 2 times [2022-11-26 00:47:25,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:47:25,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341036689] [2022-11-26 00:47:25,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:47:25,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:47:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:47:25,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:25,572 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:47:25,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341036689] [2022-11-26 00:47:25,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341036689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:47:25,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:47:25,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-26 00:47:25,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648086473] [2022-11-26 00:47:25,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:47:25,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:47:25,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:47:25,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:47:25,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:47:25,573 INFO L87 Difference]: Start difference. First operand 11134 states and 37357 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) [2022-11-26 00:47:28,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:47:28,595 INFO L93 Difference]: Finished difference Result 19986 states and 66696 transitions. [2022-11-26 00:47:28,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-26 00:47:28,596 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 [2022-11-26 00:47:28,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:47:28,736 INFO L225 Difference]: With dead ends: 19986 [2022-11-26 00:47:28,737 INFO L226 Difference]: Without dead ends: 19986 [2022-11-26 00:47:28,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=344, Invalid=916, Unknown=0, NotChecked=0, Total=1260 [2022-11-26 00:47:28,737 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 531 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1976 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 2018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:47:28,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 116 Invalid, 2018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1976 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-26 00:47:28,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19986 states. [2022-11-26 00:47:28,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19986 to 12411. [2022-11-26 00:47:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12411 states, 12407 states have (on average 3.3906665592004512) internal successors, (42068), 12410 states have internal predecessors, (42068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12411 states to 12411 states and 42068 transitions. [2022-11-26 00:47:28,992 INFO L78 Accepts]: Start accepts. Automaton has 12411 states and 42068 transitions. Word has length 30 [2022-11-26 00:47:28,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:47:28,992 INFO L495 AbstractCegarLoop]: Abstraction has 12411 states and 42068 transitions. [2022-11-26 00:47:28,992 INFO L496 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) [2022-11-26 00:47:28,992 INFO L276 IsEmpty]: Start isEmpty. Operand 12411 states and 42068 transitions. [2022-11-26 00:47:29,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:47:29,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:47:29,004 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:47:29,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-26 00:47:29,005 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:47:29,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:47:29,005 INFO L85 PathProgramCache]: Analyzing trace with hash 84383990, now seen corresponding path program 3 times [2022-11-26 00:47:29,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:47:29,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85834312] [2022-11-26 00:47:29,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:47:29,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:47:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:47:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:29,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:47:29,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85834312] [2022-11-26 00:47:29,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85834312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:47:29,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:47:29,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-26 00:47:29,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258666982] [2022-11-26 00:47:29,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:47:29,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:47:29,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:47:29,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:47:29,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:47:29,442 INFO L87 Difference]: Start difference. First operand 12411 states and 42068 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) [2022-11-26 00:47:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:47:32,251 INFO L93 Difference]: Finished difference Result 24079 states and 80775 transitions. [2022-11-26 00:47:32,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:47:32,252 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 [2022-11-26 00:47:32,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:47:32,418 INFO L225 Difference]: With dead ends: 24079 [2022-11-26 00:47:32,418 INFO L226 Difference]: Without dead ends: 24079 [2022-11-26 00:47:32,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=300, Invalid=756, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 00:47:32,418 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 509 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:47:32,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 83 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-26 00:47:32,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24079 states. [2022-11-26 00:47:32,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24079 to 12478. [2022-11-26 00:47:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12478 states, 12474 states have (on average 3.38985088985089) internal successors, (42285), 12477 states have internal predecessors, (42285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12478 states to 12478 states and 42285 transitions. [2022-11-26 00:47:32,768 INFO L78 Accepts]: Start accepts. Automaton has 12478 states and 42285 transitions. Word has length 30 [2022-11-26 00:47:32,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:47:32,768 INFO L495 AbstractCegarLoop]: Abstraction has 12478 states and 42285 transitions. [2022-11-26 00:47:32,768 INFO L496 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) [2022-11-26 00:47:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 12478 states and 42285 transitions. [2022-11-26 00:47:32,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:47:32,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:47:32,780 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:47:32,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-26 00:47:32,781 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:47:32,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:47:32,781 INFO L85 PathProgramCache]: Analyzing trace with hash 256516560, now seen corresponding path program 4 times [2022-11-26 00:47:32,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:47:32,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426654086] [2022-11-26 00:47:32,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:47:32,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:47:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:47:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:33,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:47:33,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426654086] [2022-11-26 00:47:33,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426654086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:47:33,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:47:33,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-26 00:47:33,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034206098] [2022-11-26 00:47:33,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:47:33,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:47:33,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:47:33,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:47:33,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:47:33,215 INFO L87 Difference]: Start difference. First operand 12478 states and 42285 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) [2022-11-26 00:47:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:47:35,693 INFO L93 Difference]: Finished difference Result 19325 states and 64401 transitions. [2022-11-26 00:47:35,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-26 00:47:35,693 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 [2022-11-26 00:47:35,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:47:35,830 INFO L225 Difference]: With dead ends: 19325 [2022-11-26 00:47:35,830 INFO L226 Difference]: Without dead ends: 19325 [2022-11-26 00:47:35,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2022-11-26 00:47:35,831 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 366 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 2160 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:47:35,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 61 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2160 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-26 00:47:35,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19325 states. [2022-11-26 00:47:36,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19325 to 10481. [2022-11-26 00:47:36,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10481 states, 10477 states have (on average 3.3719576214565237) internal successors, (35328), 10480 states have internal predecessors, (35328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10481 states to 10481 states and 35328 transitions. [2022-11-26 00:47:36,069 INFO L78 Accepts]: Start accepts. Automaton has 10481 states and 35328 transitions. Word has length 30 [2022-11-26 00:47:36,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:47:36,069 INFO L495 AbstractCegarLoop]: Abstraction has 10481 states and 35328 transitions. [2022-11-26 00:47:36,069 INFO L496 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) [2022-11-26 00:47:36,069 INFO L276 IsEmpty]: Start isEmpty. Operand 10481 states and 35328 transitions. [2022-11-26 00:47:36,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:47:36,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:47:36,079 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:47:36,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-11-26 00:47:36,079 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:47:36,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:47:36,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1000344778, now seen corresponding path program 2 times [2022-11-26 00:47:36,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:47:36,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169661471] [2022-11-26 00:47:36,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:47:36,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:47:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:47:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:36,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:47:36,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169661471] [2022-11-26 00:47:36,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169661471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:47:36,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:47:36,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-26 00:47:36,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548074639] [2022-11-26 00:47:36,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:47:36,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:47:36,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:47:36,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:47:36,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:47:36,581 INFO L87 Difference]: Start difference. First operand 10481 states and 35328 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) [2022-11-26 00:47:39,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:47:39,179 INFO L93 Difference]: Finished difference Result 18585 states and 61855 transitions. [2022-11-26 00:47:39,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:47:39,179 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 [2022-11-26 00:47:39,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:47:39,231 INFO L225 Difference]: With dead ends: 18585 [2022-11-26 00:47:39,232 INFO L226 Difference]: Without dead ends: 18585 [2022-11-26 00:47:39,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=240, Invalid=630, Unknown=0, NotChecked=0, Total=870 [2022-11-26 00:47:39,232 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 418 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1923 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:47:39,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 56 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1923 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-26 00:47:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18585 states. [2022-11-26 00:47:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18585 to 10667. [2022-11-26 00:47:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10667 states, 10663 states have (on average 3.3764419019037795) internal successors, (36003), 10666 states have internal predecessors, (36003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10667 states to 10667 states and 36003 transitions. [2022-11-26 00:47:39,601 INFO L78 Accepts]: Start accepts. Automaton has 10667 states and 36003 transitions. Word has length 30 [2022-11-26 00:47:39,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:47:39,601 INFO L495 AbstractCegarLoop]: Abstraction has 10667 states and 36003 transitions. [2022-11-26 00:47:39,601 INFO L496 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) [2022-11-26 00:47:39,601 INFO L276 IsEmpty]: Start isEmpty. Operand 10667 states and 36003 transitions. [2022-11-26 00:47:39,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:47:39,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:47:39,612 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:47:39,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-11-26 00:47:39,612 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:47:39,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:47:39,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1614917628, now seen corresponding path program 3 times [2022-11-26 00:47:39,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:47:39,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208894980] [2022-11-26 00:47:39,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:47:39,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:47:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:47:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:40,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:47:40,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208894980] [2022-11-26 00:47:40,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208894980] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:47:40,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:47:40,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-26 00:47:40,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954725038] [2022-11-26 00:47:40,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:47:40,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:47:40,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:47:40,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:47:40,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:47:40,160 INFO L87 Difference]: Start difference. First operand 10667 states and 36003 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) [2022-11-26 00:47:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:47:42,968 INFO L93 Difference]: Finished difference Result 19346 states and 64956 transitions. [2022-11-26 00:47:42,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-26 00:47:42,969 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 [2022-11-26 00:47:42,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:47:43,035 INFO L225 Difference]: With dead ends: 19346 [2022-11-26 00:47:43,035 INFO L226 Difference]: Without dead ends: 19346 [2022-11-26 00:47:43,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=278, Invalid=778, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 00:47:43,036 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 490 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 2050 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:47:43,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 83 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2050 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-26 00:47:43,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19346 states. [2022-11-26 00:47:43,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19346 to 9754. [2022-11-26 00:47:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9754 states, 9750 states have (on average 3.3932307692307693) internal successors, (33084), 9753 states have internal predecessors, (33084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:43,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9754 states to 9754 states and 33084 transitions. [2022-11-26 00:47:43,489 INFO L78 Accepts]: Start accepts. Automaton has 9754 states and 33084 transitions. Word has length 30 [2022-11-26 00:47:43,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:47:43,490 INFO L495 AbstractCegarLoop]: Abstraction has 9754 states and 33084 transitions. [2022-11-26 00:47:43,490 INFO L496 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) [2022-11-26 00:47:43,490 INFO L276 IsEmpty]: Start isEmpty. Operand 9754 states and 33084 transitions. [2022-11-26 00:47:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:47:43,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:47:43,501 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:47:43,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-26 00:47:43,501 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:47:43,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:47:43,502 INFO L85 PathProgramCache]: Analyzing trace with hash -486472177, now seen corresponding path program 1 times [2022-11-26 00:47:43,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:47:43,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604524722] [2022-11-26 00:47:43,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:47:43,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:47:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:47:43,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:43,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:47:43,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604524722] [2022-11-26 00:47:43,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604524722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:47:43,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:47:43,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:47:43,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783350368] [2022-11-26 00:47:43,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:47:43,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:47:43,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:47:43,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:47:43,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:47:43,573 INFO L87 Difference]: Start difference. First operand 9754 states and 33084 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) [2022-11-26 00:47:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:47:43,688 INFO L93 Difference]: Finished difference Result 4436 states and 13386 transitions. [2022-11-26 00:47:43,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:47:43,689 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 [2022-11-26 00:47:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:47:43,698 INFO L225 Difference]: With dead ends: 4436 [2022-11-26 00:47:43,698 INFO L226 Difference]: Without dead ends: 4436 [2022-11-26 00:47:43,698 INFO L412 NwaCegarLoop]: 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 [2022-11-26 00:47:43,699 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:47:43,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 28 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:47:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4436 states. [2022-11-26 00:47:43,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4436 to 3748. [2022-11-26 00:47:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3748 states, 3744 states have (on average 2.968482905982906) internal successors, (11114), 3747 states have internal predecessors, (11114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3748 states to 3748 states and 11114 transitions. [2022-11-26 00:47:43,781 INFO L78 Accepts]: Start accepts. Automaton has 3748 states and 11114 transitions. Word has length 31 [2022-11-26 00:47:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:47:43,782 INFO L495 AbstractCegarLoop]: Abstraction has 3748 states and 11114 transitions. [2022-11-26 00:47:43,782 INFO L496 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) [2022-11-26 00:47:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3748 states and 11114 transitions. [2022-11-26 00:47:43,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:47:43,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:47:43,786 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:47:43,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-11-26 00:47:43,786 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:47:43,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:47:43,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1837090976, now seen corresponding path program 1 times [2022-11-26 00:47:43,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:47:43,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36732257] [2022-11-26 00:47:43,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:47:43,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:47:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:47:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:45,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:47:45,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36732257] [2022-11-26 00:47:45,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36732257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:47:45,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:47:45,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-26 00:47:45,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471215942] [2022-11-26 00:47:45,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:47:45,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 00:47:45,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:47:45,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 00:47:45,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:47:45,516 INFO L87 Difference]: Start difference. First operand 3748 states and 11114 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) [2022-11-26 00:47:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:47:50,117 INFO L93 Difference]: Finished difference Result 4261 states and 12569 transitions. [2022-11-26 00:47:50,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-26 00:47:50,117 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 [2022-11-26 00:47:50,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:47:50,125 INFO L225 Difference]: With dead ends: 4261 [2022-11-26 00:47:50,125 INFO L226 Difference]: Without dead ends: 4261 [2022-11-26 00:47:50,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2022-11-26 00:47:50,125 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 323 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3470 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 3494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:47:50,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 24 Invalid, 3494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3470 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-26 00:47:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4261 states. [2022-11-26 00:47:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4261 to 4164. [2022-11-26 00:47:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4164 states, 4160 states have (on average 2.9663461538461537) internal successors, (12340), 4163 states have internal predecessors, (12340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:50,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 12340 transitions. [2022-11-26 00:47:50,204 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 12340 transitions. Word has length 31 [2022-11-26 00:47:50,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:47:50,204 INFO L495 AbstractCegarLoop]: Abstraction has 4164 states and 12340 transitions. [2022-11-26 00:47:50,204 INFO L496 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) [2022-11-26 00:47:50,204 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 12340 transitions. [2022-11-26 00:47:50,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:47:50,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:47:50,208 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:47:50,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-11-26 00:47:50,208 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:47:50,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:47:50,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1609633036, now seen corresponding path program 1 times [2022-11-26 00:47:50,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:47:50,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562912723] [2022-11-26 00:47:50,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:47:50,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:47:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:47:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:52,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:47:52,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562912723] [2022-11-26 00:47:52,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562912723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:47:52,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:47:52,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-26 00:47:52,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979510163] [2022-11-26 00:47:52,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:47:52,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:47:52,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:47:52,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:47:52,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:47:52,080 INFO L87 Difference]: Start difference. First operand 4164 states and 12340 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) [2022-11-26 00:47:56,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:47:56,519 INFO L93 Difference]: Finished difference Result 4663 states and 13755 transitions. [2022-11-26 00:47:56,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:47:56,520 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 [2022-11-26 00:47:56,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:47:56,528 INFO L225 Difference]: With dead ends: 4663 [2022-11-26 00:47:56,528 INFO L226 Difference]: Without dead ends: 4663 [2022-11-26 00:47:56,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2022-11-26 00:47:56,528 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 284 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 3553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:47:56,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 24 Invalid, 3553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3531 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-26 00:47:56,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2022-11-26 00:47:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 4452. [2022-11-26 00:47:56,591 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) [2022-11-26 00:47:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4452 states to 4452 states and 13201 transitions. [2022-11-26 00:47:56,600 INFO L78 Accepts]: Start accepts. Automaton has 4452 states and 13201 transitions. Word has length 31 [2022-11-26 00:47:56,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:47:56,600 INFO L495 AbstractCegarLoop]: Abstraction has 4452 states and 13201 transitions. [2022-11-26 00:47:56,600 INFO L496 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) [2022-11-26 00:47:56,600 INFO L276 IsEmpty]: Start isEmpty. Operand 4452 states and 13201 transitions. [2022-11-26 00:47:56,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:47:56,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:47:56,604 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:47:56,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-11-26 00:47:56,604 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:47:56,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:47:56,605 INFO L85 PathProgramCache]: Analyzing trace with hash -166392972, now seen corresponding path program 2 times [2022-11-26 00:47:56,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:47:56,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144269997] [2022-11-26 00:47:56,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:47:56,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:47:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:47:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:58,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:47:58,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144269997] [2022-11-26 00:47:58,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144269997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:47:58,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:47:58,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-26 00:47:58,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010463039] [2022-11-26 00:47:58,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:47:58,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 00:47:58,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:47:58,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 00:47:58,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:47:58,397 INFO L87 Difference]: Start difference. First operand 4452 states and 13201 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) [2022-11-26 00:48:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:48:03,047 INFO L93 Difference]: Finished difference Result 5660 states and 16607 transitions. [2022-11-26 00:48:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-26 00:48:03,048 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 [2022-11-26 00:48:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:48:03,059 INFO L225 Difference]: With dead ends: 5660 [2022-11-26 00:48:03,059 INFO L226 Difference]: Without dead ends: 5660 [2022-11-26 00:48:03,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2022-11-26 00:48:03,060 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 329 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 3633 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:48:03,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 36 Invalid, 3652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3633 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-26 00:48:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5660 states. [2022-11-26 00:48:03,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5660 to 4474. [2022-11-26 00:48:03,130 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) [2022-11-26 00:48:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 13267 transitions. [2022-11-26 00:48:03,139 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 13267 transitions. Word has length 31 [2022-11-26 00:48:03,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:48:03,140 INFO L495 AbstractCegarLoop]: Abstraction has 4474 states and 13267 transitions. [2022-11-26 00:48:03,140 INFO L496 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) [2022-11-26 00:48:03,140 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 13267 transitions. [2022-11-26 00:48:03,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:48:03,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:48:03,143 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:48:03,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-11-26 00:48:03,144 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:48:03,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:48:03,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1219794988, now seen corresponding path program 3 times [2022-11-26 00:48:03,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:48:03,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260491737] [2022-11-26 00:48:03,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:48:03,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:48:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:48:04,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:48:04,934 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:48:04,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260491737] [2022-11-26 00:48:04,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260491737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:48:04,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:48:04,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-26 00:48:04,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120305944] [2022-11-26 00:48:04,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:48:04,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 00:48:04,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:48:04,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 00:48:04,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:48:04,936 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) [2022-11-26 00:48:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:48:09,852 INFO L93 Difference]: Finished difference Result 5622 states and 16505 transitions. [2022-11-26 00:48:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-26 00:48:09,852 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 [2022-11-26 00:48:09,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:48:09,863 INFO L225 Difference]: With dead ends: 5622 [2022-11-26 00:48:09,863 INFO L226 Difference]: Without dead ends: 5622 [2022-11-26 00:48:09,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2022-11-26 00:48:09,864 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 341 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 3928 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 3946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:48:09,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 51 Invalid, 3946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3928 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-26 00:48:09,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5622 states. [2022-11-26 00:48:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5622 to 4492. [2022-11-26 00:48:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4492 states, 4488 states have (on average 2.968137254901961) internal successors, (13321), 4491 states have internal predecessors, (13321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:48:09,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4492 states to 4492 states and 13321 transitions. [2022-11-26 00:48:09,941 INFO L78 Accepts]: Start accepts. Automaton has 4492 states and 13321 transitions. Word has length 31 [2022-11-26 00:48:09,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:48:09,942 INFO L495 AbstractCegarLoop]: Abstraction has 4492 states and 13321 transitions. [2022-11-26 00:48:09,942 INFO L496 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) [2022-11-26 00:48:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 4492 states and 13321 transitions. [2022-11-26 00:48:09,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:48:09,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:48:09,945 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:48:09,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-11-26 00:48:09,946 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:48:09,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:48:09,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1454597522, now seen corresponding path program 4 times [2022-11-26 00:48:09,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:48:09,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000998889] [2022-11-26 00:48:09,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:48:09,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:48:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:48:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:48:11,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:48:11,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000998889] [2022-11-26 00:48:11,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000998889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:48:11,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:48:11,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-26 00:48:11,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104504403] [2022-11-26 00:48:11,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:48:11,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 00:48:11,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:48:11,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 00:48:11,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:48:11,796 INFO L87 Difference]: Start difference. First operand 4492 states and 13321 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) [2022-11-26 00:48:16,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:48:16,487 INFO L93 Difference]: Finished difference Result 5578 states and 16397 transitions. [2022-11-26 00:48:16,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-26 00:48:16,488 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 [2022-11-26 00:48:16,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:48:16,498 INFO L225 Difference]: With dead ends: 5578 [2022-11-26 00:48:16,498 INFO L226 Difference]: Without dead ends: 5578 [2022-11-26 00:48:16,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=193, Invalid=1139, Unknown=0, NotChecked=0, Total=1332 [2022-11-26 00:48:16,499 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 343 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 3702 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 3719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:48:16,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 59 Invalid, 3719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3702 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-26 00:48:16,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5578 states. [2022-11-26 00:48:16,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5578 to 4546. [2022-11-26 00:48:16,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4546 states, 4542 states have (on average 2.96257155438133) internal successors, (13456), 4545 states have internal predecessors, (13456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:48:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4546 states to 4546 states and 13456 transitions. [2022-11-26 00:48:16,606 INFO L78 Accepts]: Start accepts. Automaton has 4546 states and 13456 transitions. Word has length 31 [2022-11-26 00:48:16,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:48:16,606 INFO L495 AbstractCegarLoop]: Abstraction has 4546 states and 13456 transitions. [2022-11-26 00:48:16,606 INFO L496 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) [2022-11-26 00:48:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 4546 states and 13456 transitions. [2022-11-26 00:48:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:48:16,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:48:16,610 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:48:16,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-11-26 00:48:16,610 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:48:16,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:48:16,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1388859130, now seen corresponding path program 5 times [2022-11-26 00:48:16,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:48:16,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73080195] [2022-11-26 00:48:16,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:48:16,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:48:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:48:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:48:18,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:48:18,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73080195] [2022-11-26 00:48:18,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73080195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:48:18,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:48:18,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-26 00:48:18,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638418138] [2022-11-26 00:48:18,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:48:18,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 00:48:18,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:48:18,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 00:48:18,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:48:18,363 INFO L87 Difference]: Start difference. First operand 4546 states and 13456 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) [2022-11-26 00:48:23,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:48:23,169 INFO L93 Difference]: Finished difference Result 5598 states and 16457 transitions. [2022-11-26 00:48:23,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-26 00:48:23,170 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 [2022-11-26 00:48:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:48:23,180 INFO L225 Difference]: With dead ends: 5598 [2022-11-26 00:48:23,180 INFO L226 Difference]: Without dead ends: 5598 [2022-11-26 00:48:23,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2022-11-26 00:48:23,181 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 354 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4092 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 4110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:48:23,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 85 Invalid, 4110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4092 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-26 00:48:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5598 states. [2022-11-26 00:48:23,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5598 to 4564. [2022-11-26 00:48:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4564 states, 4560 states have (on average 2.960745614035088) internal successors, (13501), 4563 states have internal predecessors, (13501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:48:23,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4564 states to 4564 states and 13501 transitions. [2022-11-26 00:48:23,256 INFO L78 Accepts]: Start accepts. Automaton has 4564 states and 13501 transitions. Word has length 31 [2022-11-26 00:48:23,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:48:23,256 INFO L495 AbstractCegarLoop]: Abstraction has 4564 states and 13501 transitions. [2022-11-26 00:48:23,257 INFO L496 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) [2022-11-26 00:48:23,257 INFO L276 IsEmpty]: Start isEmpty. Operand 4564 states and 13501 transitions. [2022-11-26 00:48:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:48:23,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:48:23,261 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:48:23,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-11-26 00:48:23,261 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:48:23,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:48:23,261 INFO L85 PathProgramCache]: Analyzing trace with hash 904745278, now seen corresponding path program 6 times [2022-11-26 00:48:23,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:48:23,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169029186] [2022-11-26 00:48:23,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:48:23,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:48:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:48:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:48:24,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:48:24,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169029186] [2022-11-26 00:48:24,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169029186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:48:24,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:48:24,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-26 00:48:24,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474293024] [2022-11-26 00:48:24,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:48:24,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 00:48:24,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:48:24,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 00:48:24,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:48:24,887 INFO L87 Difference]: Start difference. First operand 4564 states and 13501 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) [2022-11-26 00:48:30,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:48:30,349 INFO L93 Difference]: Finished difference Result 5775 states and 16953 transitions. [2022-11-26 00:48:30,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-26 00:48:30,349 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 [2022-11-26 00:48:30,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:48:30,358 INFO L225 Difference]: With dead ends: 5775 [2022-11-26 00:48:30,358 INFO L226 Difference]: Without dead ends: 5775 [2022-11-26 00:48:30,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=226, Invalid=1496, Unknown=0, NotChecked=0, Total=1722 [2022-11-26 00:48:30,359 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 411 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4541 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 4560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:48:30,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 97 Invalid, 4560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4541 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-26 00:48:30,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2022-11-26 00:48:30,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 4760. [2022-11-26 00:48:30,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4760 states, 4756 states have (on average 2.9539529015979813) internal successors, (14049), 4759 states have internal predecessors, (14049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:48:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 14049 transitions. [2022-11-26 00:48:30,440 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 14049 transitions. Word has length 31 [2022-11-26 00:48:30,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:48:30,440 INFO L495 AbstractCegarLoop]: Abstraction has 4760 states and 14049 transitions. [2022-11-26 00:48:30,440 INFO L496 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) [2022-11-26 00:48:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 14049 transitions. [2022-11-26 00:48:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:48:30,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:48:30,444 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:48:30,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-11-26 00:48:30,444 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:48:30,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:48:30,445 INFO L85 PathProgramCache]: Analyzing trace with hash -562648460, now seen corresponding path program 2 times [2022-11-26 00:48:30,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:48:30,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997505926] [2022-11-26 00:48:30,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:48:30,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:48:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:48:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:48:31,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:48:31,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997505926] [2022-11-26 00:48:31,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997505926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:48:31,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:48:31,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-26 00:48:31,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19457974] [2022-11-26 00:48:31,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:48:31,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:48:31,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:48:31,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:48:31,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:48:31,987 INFO L87 Difference]: Start difference. First operand 4760 states and 14049 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) [2022-11-26 00:48:35,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:48:35,829 INFO L93 Difference]: Finished difference Result 5852 states and 17127 transitions. [2022-11-26 00:48:35,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:48:35,829 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 [2022-11-26 00:48:35,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:48:35,840 INFO L225 Difference]: With dead ends: 5852 [2022-11-26 00:48:35,840 INFO L226 Difference]: Without dead ends: 5852 [2022-11-26 00:48:35,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2022-11-26 00:48:35,841 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 308 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3157 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 3174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:48:35,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 32 Invalid, 3174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3157 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-26 00:48:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5852 states. [2022-11-26 00:48:35,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5852 to 4774. [2022-11-26 00:48:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4774 states, 4770 states have (on average 2.9540880503144655) internal successors, (14091), 4773 states have internal predecessors, (14091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:48:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4774 states to 4774 states and 14091 transitions. [2022-11-26 00:48:35,925 INFO L78 Accepts]: Start accepts. Automaton has 4774 states and 14091 transitions. Word has length 31 [2022-11-26 00:48:35,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:48:35,925 INFO L495 AbstractCegarLoop]: Abstraction has 4774 states and 14091 transitions. [2022-11-26 00:48:35,925 INFO L496 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) [2022-11-26 00:48:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 4774 states and 14091 transitions. [2022-11-26 00:48:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:48:35,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:48:35,929 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:48:35,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-11-26 00:48:35,930 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:48:35,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:48:35,930 INFO L85 PathProgramCache]: Analyzing trace with hash 652652008, now seen corresponding path program 3 times [2022-11-26 00:48:35,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:48:35,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025888173] [2022-11-26 00:48:35,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:48:35,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:48:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:48:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:48:37,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:48:37,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025888173] [2022-11-26 00:48:37,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025888173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:48:37,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:48:37,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-26 00:48:37,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771739205] [2022-11-26 00:48:37,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:48:37,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:48:37,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:48:37,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:48:37,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:48:37,874 INFO L87 Difference]: Start difference. First operand 4774 states and 14091 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) [2022-11-26 00:48:41,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:48:41,587 INFO L93 Difference]: Finished difference Result 5804 states and 17007 transitions. [2022-11-26 00:48:41,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:48:41,588 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 [2022-11-26 00:48:41,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:48:41,598 INFO L225 Difference]: With dead ends: 5804 [2022-11-26 00:48:41,598 INFO L226 Difference]: Without dead ends: 5804 [2022-11-26 00:48:41,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2022-11-26 00:48:41,599 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 349 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 2981 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:48:41,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 41 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2981 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-26 00:48:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5804 states. [2022-11-26 00:48:41,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5804 to 4828. [2022-11-26 00:48:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4828 states, 4824 states have (on average 2.949004975124378) internal successors, (14226), 4827 states have internal predecessors, (14226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:48:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4828 states to 4828 states and 14226 transitions. [2022-11-26 00:48:41,677 INFO L78 Accepts]: Start accepts. Automaton has 4828 states and 14226 transitions. Word has length 31 [2022-11-26 00:48:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:48:41,677 INFO L495 AbstractCegarLoop]: Abstraction has 4828 states and 14226 transitions. [2022-11-26 00:48:41,677 INFO L496 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) [2022-11-26 00:48:41,677 INFO L276 IsEmpty]: Start isEmpty. Operand 4828 states and 14226 transitions. [2022-11-26 00:48:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:48:41,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:48:41,681 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:48:41,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-11-26 00:48:41,681 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:48:41,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:48:41,682 INFO L85 PathProgramCache]: Analyzing trace with hash 30157180, now seen corresponding path program 4 times [2022-11-26 00:48:41,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:48:41,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441036187] [2022-11-26 00:48:41,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:48:41,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:48:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:48:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:48:43,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:48:43,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441036187] [2022-11-26 00:48:43,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441036187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:48:43,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:48:43,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-26 00:48:43,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517758931] [2022-11-26 00:48:43,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:48:43,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:48:43,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:48:43,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:48:43,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:48:43,536 INFO L87 Difference]: Start difference. First operand 4828 states and 14226 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) [2022-11-26 00:48:47,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:48:47,597 INFO L93 Difference]: Finished difference Result 5824 states and 17067 transitions. [2022-11-26 00:48:47,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:48:47,597 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 [2022-11-26 00:48:47,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:48:47,608 INFO L225 Difference]: With dead ends: 5824 [2022-11-26 00:48:47,608 INFO L226 Difference]: Without dead ends: 5824 [2022-11-26 00:48:47,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2022-11-26 00:48:47,609 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 302 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 3507 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 3522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:48:47,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 69 Invalid, 3522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3507 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-26 00:48:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2022-11-26 00:48:47,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 4846. [2022-11-26 00:48:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4846 states, 4842 states have (on average 2.9473358116480792) internal successors, (14271), 4845 states have internal predecessors, (14271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:48:47,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4846 states to 4846 states and 14271 transitions. [2022-11-26 00:48:47,713 INFO L78 Accepts]: Start accepts. Automaton has 4846 states and 14271 transitions. Word has length 31 [2022-11-26 00:48:47,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:48:47,714 INFO L495 AbstractCegarLoop]: Abstraction has 4846 states and 14271 transitions. [2022-11-26 00:48:47,714 INFO L496 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) [2022-11-26 00:48:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 4846 states and 14271 transitions. [2022-11-26 00:48:47,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:48:47,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:48:47,720 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:48:47,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-11-26 00:48:47,720 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:48:47,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:48:47,721 INFO L85 PathProgramCache]: Analyzing trace with hash -866334300, now seen corresponding path program 5 times [2022-11-26 00:48:47,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:48:47,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759453040] [2022-11-26 00:48:47,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:48:47,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:48:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:48:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:48:49,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:48:49,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759453040] [2022-11-26 00:48:49,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759453040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:48:49,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:48:49,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-26 00:48:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053078160] [2022-11-26 00:48:49,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:48:49,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-26 00:48:49,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:48:49,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-26 00:48:49,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-11-26 00:48:49,189 INFO L87 Difference]: Start difference. First operand 4846 states and 14271 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) [2022-11-26 00:48:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:48:52,744 INFO L93 Difference]: Finished difference Result 5770 states and 16876 transitions. [2022-11-26 00:48:52,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-26 00:48:52,745 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 [2022-11-26 00:48:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:48:52,755 INFO L225 Difference]: With dead ends: 5770 [2022-11-26 00:48:52,755 INFO L226 Difference]: Without dead ends: 5770 [2022-11-26 00:48:52,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 00:48:52,756 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 401 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 3128 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 3143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:48:52,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 73 Invalid, 3143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3128 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-26 00:48:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2022-11-26 00:48:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5106. [2022-11-26 00:48:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5106 states, 5102 states have (on average 2.94453155625245) internal successors, (15023), 5105 states have internal predecessors, (15023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:48:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5106 states to 5106 states and 15023 transitions. [2022-11-26 00:48:52,835 INFO L78 Accepts]: Start accepts. Automaton has 5106 states and 15023 transitions. Word has length 31 [2022-11-26 00:48:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:48:52,835 INFO L495 AbstractCegarLoop]: Abstraction has 5106 states and 15023 transitions. [2022-11-26 00:48:52,836 INFO L496 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) [2022-11-26 00:48:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 5106 states and 15023 transitions. [2022-11-26 00:48:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:48:52,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:48:52,840 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:48:52,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-11-26 00:48:52,840 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:48:52,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:48:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash -669957914, now seen corresponding path program 7 times [2022-11-26 00:48:52,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:48:52,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016248588] [2022-11-26 00:48:52,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:48:52,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:48:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:48:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:48:54,438 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:48:54,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016248588] [2022-11-26 00:48:54,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016248588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:48:54,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:48:54,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-26 00:48:54,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270324120] [2022-11-26 00:48:54,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:48:54,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 00:48:54,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:48:54,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 00:48:54,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:48:54,440 INFO L87 Difference]: Start difference. First operand 5106 states and 15023 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) [2022-11-26 00:48:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:48:58,917 INFO L93 Difference]: Finished difference Result 5741 states and 16788 transitions. [2022-11-26 00:48:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-26 00:48:58,917 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 [2022-11-26 00:48:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:48:58,927 INFO L225 Difference]: With dead ends: 5741 [2022-11-26 00:48:58,927 INFO L226 Difference]: Without dead ends: 5741 [2022-11-26 00:48:58,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2022-11-26 00:48:58,927 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 357 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 3894 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 3918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:48:58,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 96 Invalid, 3918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3894 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-26 00:48:58,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5741 states. [2022-11-26 00:48:58,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5741 to 5186. [2022-11-26 00:48:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5182 states have (on average 2.9376688537244307) internal successors, (15223), 5185 states have internal predecessors, (15223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:48:59,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 15223 transitions. [2022-11-26 00:48:59,014 INFO L78 Accepts]: Start accepts. Automaton has 5186 states and 15223 transitions. Word has length 31 [2022-11-26 00:48:59,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:48:59,014 INFO L495 AbstractCegarLoop]: Abstraction has 5186 states and 15223 transitions. [2022-11-26 00:48:59,014 INFO L496 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) [2022-11-26 00:48:59,014 INFO L276 IsEmpty]: Start isEmpty. Operand 5186 states and 15223 transitions. [2022-11-26 00:48:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:48:59,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:48:59,019 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:48:59,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-11-26 00:48:59,019 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:48:59,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:48:59,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1623646494, now seen corresponding path program 8 times [2022-11-26 00:48:59,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:48:59,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992069133] [2022-11-26 00:48:59,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:48:59,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:48:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:49:00,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:49:00,537 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:49:00,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992069133] [2022-11-26 00:49:00,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992069133] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:49:00,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:49:00,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-26 00:49:00,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830075105] [2022-11-26 00:49:00,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:49:00,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 00:49:00,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:49:00,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 00:49:00,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:49:00,539 INFO L87 Difference]: Start difference. First operand 5186 states and 15223 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) [2022-11-26 00:49:06,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:49:06,062 INFO L93 Difference]: Finished difference Result 6608 states and 19335 transitions. [2022-11-26 00:49:06,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-26 00:49:06,062 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 [2022-11-26 00:49:06,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:49:06,074 INFO L225 Difference]: With dead ends: 6608 [2022-11-26 00:49:06,074 INFO L226 Difference]: Without dead ends: 6608 [2022-11-26 00:49:06,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=226, Invalid=1496, Unknown=0, NotChecked=0, Total=1722 [2022-11-26 00:49:06,074 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 409 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4886 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 4908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:49:06,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 109 Invalid, 4908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4886 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-26 00:49:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6608 states. [2022-11-26 00:49:06,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6608 to 5180. [2022-11-26 00:49:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5180 states, 5176 states have (on average 2.9404945904173108) internal successors, (15220), 5179 states have internal predecessors, (15220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:49:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 15220 transitions. [2022-11-26 00:49:06,157 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 15220 transitions. Word has length 31 [2022-11-26 00:49:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:49:06,158 INFO L495 AbstractCegarLoop]: Abstraction has 5180 states and 15220 transitions. [2022-11-26 00:49:06,158 INFO L496 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) [2022-11-26 00:49:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 15220 transitions. [2022-11-26 00:49:06,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:49:06,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:49:06,162 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:49:06,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-11-26 00:49:06,163 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:49:06,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:49:06,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1856263296, now seen corresponding path program 9 times [2022-11-26 00:49:06,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:49:06,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824251376] [2022-11-26 00:49:06,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:49:06,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:49:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:49:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:49:07,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:49:07,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824251376] [2022-11-26 00:49:07,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824251376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:49:07,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:49:07,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-26 00:49:07,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591225562] [2022-11-26 00:49:07,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:49:07,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:49:07,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:49:07,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:49:07,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:49:07,641 INFO L87 Difference]: Start difference. First operand 5180 states and 15220 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) [2022-11-26 00:49:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:49:11,667 INFO L93 Difference]: Finished difference Result 5931 states and 17357 transitions. [2022-11-26 00:49:11,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:49:11,668 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 [2022-11-26 00:49:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:49:11,678 INFO L225 Difference]: With dead ends: 5931 [2022-11-26 00:49:11,678 INFO L226 Difference]: Without dead ends: 5931 [2022-11-26 00:49:11,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2022-11-26 00:49:11,679 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 336 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 3890 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 3907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:49:11,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 113 Invalid, 3907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3890 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-26 00:49:11,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5931 states. [2022-11-26 00:49:11,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5931 to 5388. [2022-11-26 00:49:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5388 states, 5384 states have (on average 2.9398216939078754) internal successors, (15828), 5387 states have internal predecessors, (15828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:49:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5388 states to 5388 states and 15828 transitions. [2022-11-26 00:49:11,763 INFO L78 Accepts]: Start accepts. Automaton has 5388 states and 15828 transitions. Word has length 31 [2022-11-26 00:49:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:49:11,763 INFO L495 AbstractCegarLoop]: Abstraction has 5388 states and 15828 transitions. [2022-11-26 00:49:11,763 INFO L496 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) [2022-11-26 00:49:11,763 INFO L276 IsEmpty]: Start isEmpty. Operand 5388 states and 15828 transitions. [2022-11-26 00:49:11,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:49:11,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:49:11,769 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:49:11,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-11-26 00:49:11,769 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:49:11,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:49:11,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1281816960, now seen corresponding path program 10 times [2022-11-26 00:49:11,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:49:11,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205877036] [2022-11-26 00:49:11,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:49:11,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:49:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:49:13,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:49:13,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:49:13,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205877036] [2022-11-26 00:49:13,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205877036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:49:13,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:49:13,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-26 00:49:13,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633766419] [2022-11-26 00:49:13,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:49:13,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 00:49:13,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:49:13,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 00:49:13,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:49:13,103 INFO L87 Difference]: Start difference. First operand 5388 states and 15828 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) [2022-11-26 00:49:18,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:49:18,158 INFO L93 Difference]: Finished difference Result 6343 states and 18535 transitions. [2022-11-26 00:49:18,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-26 00:49:18,158 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 [2022-11-26 00:49:18,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:49:18,169 INFO L225 Difference]: With dead ends: 6343 [2022-11-26 00:49:18,169 INFO L226 Difference]: Without dead ends: 6343 [2022-11-26 00:49:18,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2022-11-26 00:49:18,170 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 368 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4461 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 4481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:49:18,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 116 Invalid, 4481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4461 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-11-26 00:49:18,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6343 states. [2022-11-26 00:49:18,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6343 to 5428. [2022-11-26 00:49:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5428 states, 5424 states have (on average 2.946533923303835) internal successors, (15982), 5427 states have internal predecessors, (15982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:49:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5428 states to 5428 states and 15982 transitions. [2022-11-26 00:49:18,261 INFO L78 Accepts]: Start accepts. Automaton has 5428 states and 15982 transitions. Word has length 31 [2022-11-26 00:49:18,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:49:18,261 INFO L495 AbstractCegarLoop]: Abstraction has 5428 states and 15982 transitions. [2022-11-26 00:49:18,261 INFO L496 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) [2022-11-26 00:49:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 5428 states and 15982 transitions. [2022-11-26 00:49:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:49:18,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:49:18,267 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:49:18,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-11-26 00:49:18,267 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:49:18,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:49:18,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1679061120, now seen corresponding path program 11 times [2022-11-26 00:49:18,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:49:18,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900609823] [2022-11-26 00:49:18,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:49:18,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:49:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:49:19,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:49:19,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:49:19,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900609823] [2022-11-26 00:49:19,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900609823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:49:19,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:49:19,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-26 00:49:19,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945669317] [2022-11-26 00:49:19,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:49:19,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:49:19,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:49:19,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:49:19,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:49:19,747 INFO L87 Difference]: Start difference. First operand 5428 states and 15982 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) [2022-11-26 00:49:23,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:49:23,851 INFO L93 Difference]: Finished difference Result 6371 states and 18574 transitions. [2022-11-26 00:49:23,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:49:23,851 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 [2022-11-26 00:49:23,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:49:23,862 INFO L225 Difference]: With dead ends: 6371 [2022-11-26 00:49:23,862 INFO L226 Difference]: Without dead ends: 6371 [2022-11-26 00:49:23,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2022-11-26 00:49:23,863 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 422 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 3759 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:49:23,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 102 Invalid, 3777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3759 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-26 00:49:23,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6371 states. [2022-11-26 00:49:23,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6371 to 5502. [2022-11-26 00:49:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5502 states, 5498 states have (on average 2.9428883230265552) internal successors, (16180), 5501 states have internal predecessors, (16180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:49:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5502 states to 5502 states and 16180 transitions. [2022-11-26 00:49:23,956 INFO L78 Accepts]: Start accepts. Automaton has 5502 states and 16180 transitions. Word has length 31 [2022-11-26 00:49:23,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:49:23,956 INFO L495 AbstractCegarLoop]: Abstraction has 5502 states and 16180 transitions. [2022-11-26 00:49:23,956 INFO L496 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) [2022-11-26 00:49:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 5502 states and 16180 transitions. [2022-11-26 00:49:23,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:49:23,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:49:23,962 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:49:23,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-11-26 00:49:23,962 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:49:23,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:49:23,962 INFO L85 PathProgramCache]: Analyzing trace with hash -637918746, now seen corresponding path program 12 times [2022-11-26 00:49:23,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:49:23,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453614825] [2022-11-26 00:49:23,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:49:23,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:49:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:49:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:49:25,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:49:25,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453614825] [2022-11-26 00:49:25,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453614825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:49:25,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:49:25,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-26 00:49:25,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996537570] [2022-11-26 00:49:25,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:49:25,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 00:49:25,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:49:25,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 00:49:25,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:49:25,474 INFO L87 Difference]: Start difference. First operand 5502 states and 16180 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) [2022-11-26 00:49:30,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:49:30,161 INFO L93 Difference]: Finished difference Result 6309 states and 18368 transitions. [2022-11-26 00:49:30,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-26 00:49:30,161 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 [2022-11-26 00:49:30,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:49:30,172 INFO L225 Difference]: With dead ends: 6309 [2022-11-26 00:49:30,172 INFO L226 Difference]: Without dead ends: 6309 [2022-11-26 00:49:30,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=203, Invalid=1203, Unknown=0, NotChecked=0, Total=1406 [2022-11-26 00:49:30,172 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 400 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4047 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 4065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:49:30,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 103 Invalid, 4065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4047 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-26 00:49:30,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6309 states. [2022-11-26 00:49:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6309 to 5148. [2022-11-26 00:49:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5148 states, 5144 states have (on average 2.9500388802488335) internal successors, (15175), 5147 states have internal predecessors, (15175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:49:30,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 15175 transitions. [2022-11-26 00:49:30,264 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 15175 transitions. Word has length 31 [2022-11-26 00:49:30,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:49:30,264 INFO L495 AbstractCegarLoop]: Abstraction has 5148 states and 15175 transitions. [2022-11-26 00:49:30,264 INFO L496 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) [2022-11-26 00:49:30,264 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 15175 transitions. [2022-11-26 00:49:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:49:30,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:49:30,268 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:49:30,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-11-26 00:49:30,269 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:49:30,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:49:30,269 INFO L85 PathProgramCache]: Analyzing trace with hash 945919532, now seen corresponding path program 6 times [2022-11-26 00:49:30,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:49:30,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518918073] [2022-11-26 00:49:30,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:49:30,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:49:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:49:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:49:31,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:49:31,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518918073] [2022-11-26 00:49:31,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518918073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:49:31,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:49:31,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-26 00:49:31,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486210549] [2022-11-26 00:49:31,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:49:31,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:49:31,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:49:31,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:49:31,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:49:31,777 INFO L87 Difference]: Start difference. First operand 5148 states and 15175 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) [2022-11-26 00:49:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:49:35,992 INFO L93 Difference]: Finished difference Result 5713 states and 16712 transitions. [2022-11-26 00:49:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:49:35,992 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 [2022-11-26 00:49:35,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:49:36,002 INFO L225 Difference]: With dead ends: 5713 [2022-11-26 00:49:36,002 INFO L226 Difference]: Without dead ends: 5713 [2022-11-26 00:49:36,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2022-11-26 00:49:36,003 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 283 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 3861 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 3880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:49:36,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 53 Invalid, 3880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3861 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-26 00:49:36,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5713 states. [2022-11-26 00:49:36,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5713 to 5146. [2022-11-26 00:49:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5146 states, 5142 states have (on average 2.9500194476857255) internal successors, (15169), 5145 states have internal predecessors, (15169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:49:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5146 states to 5146 states and 15169 transitions. [2022-11-26 00:49:36,079 INFO L78 Accepts]: Start accepts. Automaton has 5146 states and 15169 transitions. Word has length 31 [2022-11-26 00:49:36,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:49:36,080 INFO L495 AbstractCegarLoop]: Abstraction has 5146 states and 15169 transitions. [2022-11-26 00:49:36,080 INFO L496 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) [2022-11-26 00:49:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 5146 states and 15169 transitions. [2022-11-26 00:49:36,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:49:36,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:49:36,084 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:49:36,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-11-26 00:49:36,084 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:49:36,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:49:36,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2133747296, now seen corresponding path program 7 times [2022-11-26 00:49:36,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:49:36,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254245407] [2022-11-26 00:49:36,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:49:36,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:49:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:49:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:49:37,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:49:37,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254245407] [2022-11-26 00:49:37,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254245407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:49:37,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:49:37,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-26 00:49:37,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494844249] [2022-11-26 00:49:37,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:49:37,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:49:37,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:49:37,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:49:37,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:49:37,593 INFO L87 Difference]: Start difference. First operand 5146 states and 15169 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) [2022-11-26 00:49:41,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:49:41,647 INFO L93 Difference]: Finished difference Result 6236 states and 18217 transitions. [2022-11-26 00:49:41,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:49:41,647 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 [2022-11-26 00:49:41,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:49:41,662 INFO L225 Difference]: With dead ends: 6236 [2022-11-26 00:49:41,663 INFO L226 Difference]: Without dead ends: 6236 [2022-11-26 00:49:41,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2022-11-26 00:49:41,663 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 313 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 3659 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:49:41,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 63 Invalid, 3680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3659 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-26 00:49:41,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6236 states. [2022-11-26 00:49:41,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6236 to 5200. [2022-11-26 00:49:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5200 states, 5196 states have (on average 2.945342571208622) internal successors, (15304), 5199 states have internal predecessors, (15304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:49:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 15304 transitions. [2022-11-26 00:49:41,748 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 15304 transitions. Word has length 31 [2022-11-26 00:49:41,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:49:41,748 INFO L495 AbstractCegarLoop]: Abstraction has 5200 states and 15304 transitions. [2022-11-26 00:49:41,749 INFO L496 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) [2022-11-26 00:49:41,749 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 15304 transitions. [2022-11-26 00:49:41,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:49:41,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:49:41,754 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:49:41,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-11-26 00:49:41,754 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:49:41,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:49:41,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1538725172, now seen corresponding path program 8 times [2022-11-26 00:49:41,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:49:41,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895132105] [2022-11-26 00:49:41,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:49:41,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:49:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:49:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:49:43,091 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:49:43,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895132105] [2022-11-26 00:49:43,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895132105] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:49:43,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:49:43,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-26 00:49:43,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418959374] [2022-11-26 00:49:43,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:49:43,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-26 00:49:43,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:49:43,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-26 00:49:43,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-11-26 00:49:43,092 INFO L87 Difference]: Start difference. First operand 5200 states and 15304 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) [2022-11-26 00:49:46,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:49:46,775 INFO L93 Difference]: Finished difference Result 6470 states and 18894 transitions. [2022-11-26 00:49:46,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-26 00:49:46,775 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 [2022-11-26 00:49:46,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:49:46,786 INFO L225 Difference]: With dead ends: 6470 [2022-11-26 00:49:46,786 INFO L226 Difference]: Without dead ends: 6470 [2022-11-26 00:49:46,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 00:49:46,787 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 357 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 3377 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 3388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:49:46,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 86 Invalid, 3388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3377 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-26 00:49:46,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6470 states. [2022-11-26 00:49:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6470 to 5128. [2022-11-26 00:49:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5128 states, 5124 states have (on average 2.9498438719750197) internal successors, (15115), 5127 states have internal predecessors, (15115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:49:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5128 states to 5128 states and 15115 transitions. [2022-11-26 00:49:46,865 INFO L78 Accepts]: Start accepts. Automaton has 5128 states and 15115 transitions. Word has length 31 [2022-11-26 00:49:46,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:49:46,865 INFO L495 AbstractCegarLoop]: Abstraction has 5128 states and 15115 transitions. [2022-11-26 00:49:46,865 INFO L496 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) [2022-11-26 00:49:46,865 INFO L276 IsEmpty]: Start isEmpty. Operand 5128 states and 15115 transitions. [2022-11-26 00:49:46,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:49:46,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:49:46,869 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:49:46,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-11-26 00:49:46,870 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:49:46,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:49:46,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1477158598, now seen corresponding path program 9 times [2022-11-26 00:49:46,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:49:46,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452988554] [2022-11-26 00:49:46,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:49:46,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:49:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:49:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:49:48,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:49:48,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452988554] [2022-11-26 00:49:48,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452988554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:49:48,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:49:48,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-26 00:49:48,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756056927] [2022-11-26 00:49:48,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:49:48,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:49:48,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:49:48,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:49:48,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:49:48,196 INFO L87 Difference]: Start difference. First operand 5128 states and 15115 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) [2022-11-26 00:49:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:49:52,221 INFO L93 Difference]: Finished difference Result 5879 states and 17252 transitions. [2022-11-26 00:49:52,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:49:52,222 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 [2022-11-26 00:49:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:49:52,232 INFO L225 Difference]: With dead ends: 5879 [2022-11-26 00:49:52,232 INFO L226 Difference]: Without dead ends: 5879 [2022-11-26 00:49:52,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2022-11-26 00:49:52,233 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 387 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 3551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:49:52,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 106 Invalid, 3551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3531 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-26 00:49:52,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5879 states. [2022-11-26 00:49:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5879 to 5068. [2022-11-26 00:49:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5068 states, 5064 states have (on average 2.955173775671406) internal successors, (14965), 5067 states have internal predecessors, (14965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:49:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5068 states to 5068 states and 14965 transitions. [2022-11-26 00:49:52,329 INFO L78 Accepts]: Start accepts. Automaton has 5068 states and 14965 transitions. Word has length 31 [2022-11-26 00:49:52,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:49:52,330 INFO L495 AbstractCegarLoop]: Abstraction has 5068 states and 14965 transitions. [2022-11-26 00:49:52,330 INFO L496 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) [2022-11-26 00:49:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 5068 states and 14965 transitions. [2022-11-26 00:49:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:49:52,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:49:52,337 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:49:52,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-11-26 00:49:52,337 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:49:52,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:49:52,338 INFO L85 PathProgramCache]: Analyzing trace with hash -906127332, now seen corresponding path program 10 times [2022-11-26 00:49:52,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:49:52,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757569173] [2022-11-26 00:49:52,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:49:52,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:49:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:49:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:49:53,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:49:53,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757569173] [2022-11-26 00:49:53,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757569173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:49:53,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:49:53,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-26 00:49:53,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460248320] [2022-11-26 00:49:53,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:49:53,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-26 00:49:53,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:49:53,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-26 00:49:53,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-11-26 00:49:53,485 INFO L87 Difference]: Start difference. First operand 5068 states and 14965 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) [2022-11-26 00:49:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:49:57,537 INFO L93 Difference]: Finished difference Result 6178 states and 18105 transitions. [2022-11-26 00:49:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-26 00:49:57,538 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 [2022-11-26 00:49:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:49:57,550 INFO L225 Difference]: With dead ends: 6178 [2022-11-26 00:49:57,550 INFO L226 Difference]: Without dead ends: 6178 [2022-11-26 00:49:57,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2022-11-26 00:49:57,550 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 337 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3737 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:49:57,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 97 Invalid, 3754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3737 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-26 00:49:57,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6178 states. [2022-11-26 00:49:57,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6178 to 5056. [2022-11-26 00:49:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5056 states, 5052 states have (on average 2.9526920031670625) internal successors, (14917), 5055 states have internal predecessors, (14917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:49:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5056 states to 5056 states and 14917 transitions. [2022-11-26 00:49:57,640 INFO L78 Accepts]: Start accepts. Automaton has 5056 states and 14917 transitions. Word has length 31 [2022-11-26 00:49:57,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:49:57,641 INFO L495 AbstractCegarLoop]: Abstraction has 5056 states and 14917 transitions. [2022-11-26 00:49:57,641 INFO L496 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) [2022-11-26 00:49:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 5056 states and 14917 transitions. [2022-11-26 00:49:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:49:57,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:49:57,646 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:49:57,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-11-26 00:49:57,646 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:49:57,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:49:57,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1206195706, now seen corresponding path program 11 times [2022-11-26 00:49:57,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:49:57,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318368550] [2022-11-26 00:49:57,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:49:57,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:49:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:49:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:49:59,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:49:59,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318368550] [2022-11-26 00:49:59,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318368550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:49:59,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:49:59,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-26 00:49:59,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480249320] [2022-11-26 00:49:59,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:49:59,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-26 00:49:59,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:49:59,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-26 00:49:59,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-11-26 00:49:59,119 INFO L87 Difference]: Start difference. First operand 5056 states and 14917 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) [2022-11-26 00:50:03,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:50:03,010 INFO L93 Difference]: Finished difference Result 5379 states and 15819 transitions. [2022-11-26 00:50:03,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-26 00:50:03,010 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 [2022-11-26 00:50:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:50:03,021 INFO L225 Difference]: With dead ends: 5379 [2022-11-26 00:50:03,021 INFO L226 Difference]: Without dead ends: 5379 [2022-11-26 00:50:03,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 00:50:03,022 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 336 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3558 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:50:03,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 97 Invalid, 3576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3558 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-26 00:50:03,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2022-11-26 00:50:03,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 4628. [2022-11-26 00:50:03,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4628 states, 4624 states have (on average 2.9589100346020762) internal successors, (13682), 4627 states have internal predecessors, (13682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4628 states to 4628 states and 13682 transitions. [2022-11-26 00:50:03,109 INFO L78 Accepts]: Start accepts. Automaton has 4628 states and 13682 transitions. Word has length 31 [2022-11-26 00:50:03,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:50:03,109 INFO L495 AbstractCegarLoop]: Abstraction has 4628 states and 13682 transitions. [2022-11-26 00:50:03,109 INFO L496 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) [2022-11-26 00:50:03,109 INFO L276 IsEmpty]: Start isEmpty. Operand 4628 states and 13682 transitions. [2022-11-26 00:50:03,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:50:03,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:50:03,114 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:50:03,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-11-26 00:50:03,114 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:50:03,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:50:03,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1115249222, now seen corresponding path program 1 times [2022-11-26 00:50:03,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:50:03,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577666410] [2022-11-26 00:50:03,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:50:03,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:50:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:50:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:50:03,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:50:03,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577666410] [2022-11-26 00:50:03,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577666410] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:50:03,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797626752] [2022-11-26 00:50:03,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:50:03,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:50:03,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:50:03,731 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:50:03,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 00:50:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:50:03,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-26 00:50:03,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:50:04,012 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-26 00:50:04,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 27 [2022-11-26 00:50:04,116 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-26 00:50:04,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:50:04,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-26 00:50:04,495 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:50:04,520 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:50:04,674 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:50:04,733 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:50:04,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-11-26 00:50:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:50:04,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:50:05,105 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:50:05,389 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-11-26 00:50:06,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 371 treesize of output 365 [2022-11-26 00:50:06,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:50:06,182 INFO L350 Elim1Store]: Elim1 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 330 treesize of output 322 [2022-11-26 00:50:06,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:50:06,192 INFO L350 Elim1Store]: Elim1 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 308 treesize of output 304 [2022-11-26 00:50:06,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:50:06,208 INFO L350 Elim1Store]: Elim1 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 297 treesize of output 291 [2022-11-26 00:50:06,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:50:06,217 INFO L350 Elim1Store]: Elim1 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 230 treesize of output 214 [2022-11-26 00:50:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:50:06,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797626752] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 00:50:06,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:50:06,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15, 13] total 41 [2022-11-26 00:50:06,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733003692] [2022-11-26 00:50:06,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:50:06,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 00:50:06,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:50:06,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 00:50:06,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1462, Unknown=35, NotChecked=158, Total=1806 [2022-11-26 00:50:06,371 INFO L87 Difference]: Start difference. First operand 4628 states and 13682 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:07,421 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2784 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2780 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2780) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-26 00:50:07,853 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2784 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-26 00:50:08,056 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2784 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-26 00:50:09,202 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2780 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2780) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:50:10,208 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:50:10,720 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:50:10,942 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2784 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2780 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2780) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:50:11,233 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:50:11,275 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2784 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:50:11,328 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:50:11,600 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-26 00:50:13,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:50:14,249 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-26 00:50:14,347 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2780 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2780) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:50:14,931 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2784 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:50:17,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:50:17,256 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2784 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2780 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2780) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:50:19,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:50:20,618 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2784 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:50:22,439 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2784 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-26 00:50:24,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:50:25,023 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2784 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2780 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2780) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-11-26 00:50:25,304 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:50:25,540 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2784 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:50:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:50:26,249 INFO L93 Difference]: Finished difference Result 9228 states and 26823 transitions. [2022-11-26 00:50:26,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-26 00:50:26,250 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-26 00:50:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:50:26,266 INFO L225 Difference]: With dead ends: 9228 [2022-11-26 00:50:26,266 INFO L226 Difference]: Without dead ends: 9228 [2022-11-26 00:50:26,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=291, Invalid=2439, Unknown=328, NotChecked=2794, Total=5852 [2022-11-26 00:50:26,267 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 367 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 39 mSolverCounterUnsat, 653 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 2958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 653 IncrementalHoareTripleChecker+Unknown, 935 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:50:26,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 66 Invalid, 2958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1331 Invalid, 653 Unknown, 935 Unchecked, 15.1s Time] [2022-11-26 00:50:26,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9228 states. [2022-11-26 00:50:26,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9228 to 5799. [2022-11-26 00:50:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5799 states, 5795 states have (on average 3.0182916307161345) internal successors, (17491), 5798 states have internal predecessors, (17491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:26,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5799 states to 5799 states and 17491 transitions. [2022-11-26 00:50:26,374 INFO L78 Accepts]: Start accepts. Automaton has 5799 states and 17491 transitions. Word has length 32 [2022-11-26 00:50:26,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:50:26,374 INFO L495 AbstractCegarLoop]: Abstraction has 5799 states and 17491 transitions. [2022-11-26 00:50:26,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 5799 states and 17491 transitions. [2022-11-26 00:50:26,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:50:26,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:50:26,380 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:50:26,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 00:50:26,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:50:26,581 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:50:26,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:50:26,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1640979622, now seen corresponding path program 1 times [2022-11-26 00:50:26,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:50:26,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62403612] [2022-11-26 00:50:26,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:50:26,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:50:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:50:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:50:27,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:50:27,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62403612] [2022-11-26 00:50:27,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62403612] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:50:27,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635840182] [2022-11-26 00:50:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:50:27,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:50:27,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:50:27,355 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:50:27,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:50:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:50:27,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-26 00:50:27,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:50:27,653 INFO L321 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2022-11-26 00:50:27,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 23 [2022-11-26 00:50:27,747 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-26 00:50:27,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2022-11-26 00:50:27,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-26 00:50:28,097 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:50:28,124 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:50:28,294 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:50:28,369 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:50:28,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-11-26 00:50:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:50:28,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:50:29,010 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:50:29,217 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:50:29,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 743 treesize of output 733 [2022-11-26 00:50:29,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:50:29,636 INFO L350 Elim1Store]: Elim1 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 670 treesize of output 654 [2022-11-26 00:50:29,650 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:50:29,652 INFO L350 Elim1Store]: Elim1 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 626 treesize of output 618 [2022-11-26 00:50:29,663 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:50:29,665 INFO L350 Elim1Store]: Elim1 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 506 treesize of output 474 [2022-11-26 00:50:29,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:50:29,676 INFO L350 Elim1Store]: Elim1 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 453 treesize of output 443 [2022-11-26 00:50:29,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:50:29,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635840182] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 00:50:29,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:50:29,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14, 12] total 38 [2022-11-26 00:50:29,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061647532] [2022-11-26 00:50:29,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:50:29,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:50:29,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:50:29,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:50:29,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1237, Unknown=46, NotChecked=146, Total=1560 [2022-11-26 00:50:29,834 INFO L87 Difference]: Start difference. First operand 5799 states and 17491 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:30,543 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_2856 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-26 00:50:30,693 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_2856 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2851) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-26 00:50:31,797 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_2856 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:50:35,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:50:37,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:50:40,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:50:44,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:50:44,649 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_2856 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-11-26 00:50:44,723 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:50:47,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:50:47,829 INFO L93 Difference]: Finished difference Result 15313 states and 45151 transitions. [2022-11-26 00:50:47,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-26 00:50:47,829 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-26 00:50:47,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:50:47,864 INFO L225 Difference]: With dead ends: 15313 [2022-11-26 00:50:47,864 INFO L226 Difference]: Without dead ends: 15313 [2022-11-26 00:50:47,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=196, Invalid=1863, Unknown=131, NotChecked=672, Total=2862 [2022-11-26 00:50:47,865 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 370 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 40 mSolverCounterUnsat, 676 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 3882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 676 IncrementalHoareTripleChecker+Unknown, 1379 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:50:47,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 80 Invalid, 3882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1787 Invalid, 676 Unknown, 1379 Unchecked, 16.1s Time] [2022-11-26 00:50:47,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15313 states. [2022-11-26 00:50:48,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15313 to 6165. [2022-11-26 00:50:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6165 states, 6161 states have (on average 3.0236974517123842) internal successors, (18629), 6164 states have internal predecessors, (18629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:48,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6165 states to 6165 states and 18629 transitions. [2022-11-26 00:50:48,070 INFO L78 Accepts]: Start accepts. Automaton has 6165 states and 18629 transitions. Word has length 32 [2022-11-26 00:50:48,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:50:48,070 INFO L495 AbstractCegarLoop]: Abstraction has 6165 states and 18629 transitions. [2022-11-26 00:50:48,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:48,070 INFO L276 IsEmpty]: Start isEmpty. Operand 6165 states and 18629 transitions. [2022-11-26 00:50:48,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:50:48,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:50:48,076 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:50:48,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 00:50:48,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2022-11-26 00:50:48,278 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:50:48,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:50:48,278 INFO L85 PathProgramCache]: Analyzing trace with hash -841057222, now seen corresponding path program 2 times [2022-11-26 00:50:48,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:50:48,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869742857] [2022-11-26 00:50:48,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:50:48,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:50:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:50:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:50:49,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:50:49,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869742857] [2022-11-26 00:50:49,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869742857] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:50:49,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540559434] [2022-11-26 00:50:49,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:50:49,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:50:49,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:50:49,207 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:50:49,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 00:50:49,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:50:49,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:50:49,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-26 00:50:49,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:50:49,543 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-26 00:50:49,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2022-11-26 00:50:49,646 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-26 00:50:49,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2022-11-26 00:50:49,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-26 00:50:50,028 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:50:50,050 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:50:50,204 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:50:50,273 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:50:50,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-11-26 00:50:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:50:50,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:50:50,755 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:50:50,767 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-11-26 00:50:57,435 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2927) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:50:57,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 743 treesize of output 733 [2022-11-26 00:50:57,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:50:57,751 INFO L350 Elim1Store]: Elim1 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 614 treesize of output 582 [2022-11-26 00:50:57,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:50:57,763 INFO L350 Elim1Store]: Elim1 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 554 treesize of output 546 [2022-11-26 00:50:57,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:50:57,775 INFO L350 Elim1Store]: Elim1 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 525 treesize of output 515 [2022-11-26 00:50:57,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:50:57,788 INFO L350 Elim1Store]: Elim1 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 454 treesize of output 438 [2022-11-26 00:50:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:50:57,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540559434] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 00:50:57,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:50:57,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15, 13] total 41 [2022-11-26 00:50:57,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885895764] [2022-11-26 00:50:57,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:50:57,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 00:50:57,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:50:57,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 00:50:57,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1380, Unknown=51, NotChecked=234, Total=1806 [2022-11-26 00:50:57,996 INFO L87 Difference]: Start difference. First operand 6165 states and 18629 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:00,418 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2927) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-26 00:51:00,841 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2927) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2927) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:51:01,696 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2927) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2929 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-26 00:51:04,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:51:06,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:51:07,089 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2929 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2927) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:51:07,329 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2929 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-26 00:51:08,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:08,442 INFO L93 Difference]: Finished difference Result 9217 states and 27118 transitions. [2022-11-26 00:51:08,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 00:51:08,443 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-26 00:51:08,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:08,459 INFO L225 Difference]: With dead ends: 9217 [2022-11-26 00:51:08,460 INFO L226 Difference]: Without dead ends: 9217 [2022-11-26 00:51:08,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=157, Invalid=1455, Unknown=60, NotChecked=680, Total=2352 [2022-11-26 00:51:08,460 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 185 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 10 mSolverCounterUnsat, 256 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 256 IncrementalHoareTripleChecker+Unknown, 927 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:08,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 69 Invalid, 2610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1417 Invalid, 256 Unknown, 927 Unchecked, 8.1s Time] [2022-11-26 00:51:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9217 states. [2022-11-26 00:51:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9217 to 6373. [2022-11-26 00:51:08,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6373 states, 6369 states have (on average 3.018370230805464) internal successors, (19224), 6372 states have internal predecessors, (19224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6373 states to 6373 states and 19224 transitions. [2022-11-26 00:51:08,582 INFO L78 Accepts]: Start accepts. Automaton has 6373 states and 19224 transitions. Word has length 32 [2022-11-26 00:51:08,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:08,582 INFO L495 AbstractCegarLoop]: Abstraction has 6373 states and 19224 transitions. [2022-11-26 00:51:08,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 6373 states and 19224 transitions. [2022-11-26 00:51:08,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:51:08,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:08,587 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:51:08,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-26 00:51:08,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:08,788 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:51:08,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:08,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2142846408, now seen corresponding path program 3 times [2022-11-26 00:51:08,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:08,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123367768] [2022-11-26 00:51:08,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:08,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:09,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:09,371 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:09,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123367768] [2022-11-26 00:51:09,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123367768] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:51:09,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87293738] [2022-11-26 00:51:09,371 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:51:09,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:09,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:51:09,372 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:51:09,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 00:51:09,634 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:51:09,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:51:09,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-26 00:51:09,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:51:09,668 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-26 00:51:09,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2022-11-26 00:51:09,764 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-26 00:51:09,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2022-11-26 00:51:09,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-26 00:51:10,150 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:51:10,174 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:51:10,357 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:51:10,437 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:51:10,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-11-26 00:51:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:10,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:51:18,954 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:51:19,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 371 treesize of output 365 [2022-11-26 00:51:19,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:51:19,481 INFO L350 Elim1Store]: Elim1 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 302 treesize of output 286 [2022-11-26 00:51:19,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:51:19,490 INFO L350 Elim1Store]: Elim1 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 258 treesize of output 250 [2022-11-26 00:51:19,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:51:19,499 INFO L350 Elim1Store]: Elim1 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 236 treesize of output 232 [2022-11-26 00:51:19,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:51:19,508 INFO L350 Elim1Store]: Elim1 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 225 treesize of output 219 [2022-11-26 00:51:19,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:19,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87293738] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 00:51:19,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:51:19,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 13] total 40 [2022-11-26 00:51:19,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116697165] [2022-11-26 00:51:19,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:19,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 00:51:19,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:19,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 00:51:19,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1370, Unknown=68, NotChecked=78, Total=1722 [2022-11-26 00:51:19,682 INFO L87 Difference]: Start difference. First operand 6373 states and 19224 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:22,581 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-26 00:51:22,643 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((v_ArrVal_2998 (Array Int Int)) (v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2998) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-26 00:51:24,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:51:25,025 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:51:25,477 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2998 (Array Int Int)) (v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2998) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-11-26 00:51:27,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:51:30,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:51:34,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:51:36,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:51:38,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:51:39,567 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3002 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-26 00:51:39,647 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:51:40,000 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3002 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-26 00:51:40,834 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:51:43,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:51:45,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:51:47,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:51:49,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:51:51,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:51:51,641 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:51:53,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:51:54,262 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2998 (Array Int Int)) (v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2998) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-11-26 00:51:54,629 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3002 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-26 00:51:54,940 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-26 00:51:55,052 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3002 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3002 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3002) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-26 00:51:57,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:51:58,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:58,301 INFO L93 Difference]: Finished difference Result 11799 states and 34987 transitions. [2022-11-26 00:51:58,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-26 00:51:58,301 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-26 00:51:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:58,326 INFO L225 Difference]: With dead ends: 11799 [2022-11-26 00:51:58,326 INFO L226 Difference]: Without dead ends: 11799 [2022-11-26 00:51:58,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=275, Invalid=1752, Unknown=191, NotChecked=1442, Total=3660 [2022-11-26 00:51:58,327 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 433 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 38 mSolverCounterUnsat, 526 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 3199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 526 IncrementalHoareTripleChecker+Unknown, 1330 IncrementalHoareTripleChecker+Unchecked, 32.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:58,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 47 Invalid, 3199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1305 Invalid, 526 Unknown, 1330 Unchecked, 32.6s Time] [2022-11-26 00:51:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11799 states. [2022-11-26 00:51:58,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11799 to 8066. [2022-11-26 00:51:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8066 states, 8062 states have (on average 3.0328702555197222) internal successors, (24451), 8065 states have internal predecessors, (24451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8066 states to 8066 states and 24451 transitions. [2022-11-26 00:51:58,496 INFO L78 Accepts]: Start accepts. Automaton has 8066 states and 24451 transitions. Word has length 32 [2022-11-26 00:51:58,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:58,497 INFO L495 AbstractCegarLoop]: Abstraction has 8066 states and 24451 transitions. [2022-11-26 00:51:58,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:58,497 INFO L276 IsEmpty]: Start isEmpty. Operand 8066 states and 24451 transitions. [2022-11-26 00:51:58,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:51:58,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:58,506 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:51:58,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-26 00:51:58,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:58,707 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:51:58,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:58,708 INFO L85 PathProgramCache]: Analyzing trace with hash -262229262, now seen corresponding path program 2 times [2022-11-26 00:51:58,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:58,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504809723] [2022-11-26 00:51:58,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:58,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:59,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:59,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504809723] [2022-11-26 00:51:59,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504809723] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:51:59,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978475726] [2022-11-26 00:51:59,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:51:59,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:59,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:51:59,404 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:51:59,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-26 00:51:59,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:51:59,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:51:59,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-26 00:51:59,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:51:59,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:59,731 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-26 00:51:59,737 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 12 [2022-11-26 00:51:59,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-26 00:52:00,008 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 23 [2022-11-26 00:52:00,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:52:00,372 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-11-26 00:52:00,372 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 38 [2022-11-26 00:52:00,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:52:00,475 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-11-26 00:52:00,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 41 [2022-11-26 00:52:00,664 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-26 00:52:00,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2022-11-26 00:52:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:00,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:52:00,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978475726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:52:00,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:52:00,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [14] total 30 [2022-11-26 00:52:00,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418691318] [2022-11-26 00:52:00,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:52:00,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-26 00:52:00,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:52:00,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-26 00:52:00,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2022-11-26 00:52:00,900 INFO L87 Difference]: Start difference. First operand 8066 states and 24451 transitions. Second operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:52:04,768 INFO L93 Difference]: Finished difference Result 10551 states and 31677 transitions. [2022-11-26 00:52:04,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 00:52:04,769 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-26 00:52:04,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:52:04,789 INFO L225 Difference]: With dead ends: 10551 [2022-11-26 00:52:04,789 INFO L226 Difference]: Without dead ends: 10551 [2022-11-26 00:52:04,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=189, Invalid=1791, Unknown=0, NotChecked=0, Total=1980 [2022-11-26 00:52:04,790 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 448 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 3308 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:52:04,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 129 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3308 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-26 00:52:04,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10551 states. [2022-11-26 00:52:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10551 to 9011. [2022-11-26 00:52:04,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9011 states, 9007 states have (on average 3.031086932385922) internal successors, (27301), 9010 states have internal predecessors, (27301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9011 states to 9011 states and 27301 transitions. [2022-11-26 00:52:04,961 INFO L78 Accepts]: Start accepts. Automaton has 9011 states and 27301 transitions. Word has length 32 [2022-11-26 00:52:04,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:52:04,961 INFO L495 AbstractCegarLoop]: Abstraction has 9011 states and 27301 transitions. [2022-11-26 00:52:04,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 9011 states and 27301 transitions. [2022-11-26 00:52:04,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:52:04,970 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:52:04,971 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:52:04,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-26 00:52:05,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:52:05,171 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:52:05,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:52:05,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1146405334, now seen corresponding path program 4 times [2022-11-26 00:52:05,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:52:05,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319139803] [2022-11-26 00:52:05,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:05,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:52:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:05,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:52:05,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319139803] [2022-11-26 00:52:05,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319139803] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:52:05,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758149571] [2022-11-26 00:52:05,748 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:52:05,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:52:05,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:52:05,749 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:52:05,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-26 00:52:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:06,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-26 00:52:06,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:52:06,052 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-26 00:52:06,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 27 [2022-11-26 00:52:06,159 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-26 00:52:06,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:52:06,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-26 00:52:06,575 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:52:06,600 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:52:06,753 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:52:06,826 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:52:06,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-11-26 00:52:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:06,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:52:07,157 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-11-26 00:52:07,185 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:52:15,641 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:52:15,655 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:52:16,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1487 treesize of output 1469 [2022-11-26 00:52:16,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:52:16,051 INFO L350 Elim1Store]: Elim1 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 1406 treesize of output 1390 [2022-11-26 00:52:16,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:52:16,066 INFO L350 Elim1Store]: Elim1 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 1341 treesize of output 1323 [2022-11-26 00:52:16,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:52:16,083 INFO L350 Elim1Store]: Elim1 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 1094 treesize of output 1030 [2022-11-26 00:52:16,096 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:52:16,099 INFO L350 Elim1Store]: Elim1 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 918 treesize of output 886 [2022-11-26 00:52:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:16,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758149571] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 00:52:16,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:52:16,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 13] total 40 [2022-11-26 00:52:16,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758069251] [2022-11-26 00:52:16,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:52:16,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 00:52:16,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:52:16,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 00:52:16,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1189, Unknown=33, NotChecked=300, Total=1722 [2022-11-26 00:52:16,278 INFO L87 Difference]: Start difference. First operand 9011 states and 27301 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:19,057 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3151 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-26 00:52:19,246 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3151 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-26 00:52:21,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:52:21,739 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3146 (Array Int Int)) (v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_3146) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:52:21,771 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:52:21,789 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:52:22,286 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3151 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:52:22,603 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3151 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:52:22,655 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3146 (Array Int Int)) (v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_3146) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:52:24,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:52:24,831 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3151 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:52:25,370 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3151 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3146 (Array Int Int)) (v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_3146) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:52:26,947 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3151 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:52:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:52:27,462 INFO L93 Difference]: Finished difference Result 13539 states and 40545 transitions. [2022-11-26 00:52:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-26 00:52:27,462 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-26 00:52:27,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:52:27,487 INFO L225 Difference]: With dead ends: 13539 [2022-11-26 00:52:27,487 INFO L226 Difference]: Without dead ends: 13539 [2022-11-26 00:52:27,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=266, Invalid=1585, Unknown=101, NotChecked=1470, Total=3422 [2022-11-26 00:52:27,488 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 289 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 32 mSolverCounterUnsat, 261 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 2361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 261 IncrementalHoareTripleChecker+Unknown, 1190 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:52:27,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 40 Invalid, 2361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 878 Invalid, 261 Unknown, 1190 Unchecked, 7.3s Time] [2022-11-26 00:52:27,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13539 states. [2022-11-26 00:52:27,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13539 to 9616. [2022-11-26 00:52:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9616 states, 9612 states have (on average 3.039117769454848) internal successors, (29212), 9615 states have internal predecessors, (29212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9616 states to 9616 states and 29212 transitions. [2022-11-26 00:52:27,671 INFO L78 Accepts]: Start accepts. Automaton has 9616 states and 29212 transitions. Word has length 32 [2022-11-26 00:52:27,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:52:27,671 INFO L495 AbstractCegarLoop]: Abstraction has 9616 states and 29212 transitions. [2022-11-26 00:52:27,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 9616 states and 29212 transitions. [2022-11-26 00:52:27,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:52:27,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:52:27,681 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:52:27,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-26 00:52:27,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:52:27,882 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:52:27,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:52:27,882 INFO L85 PathProgramCache]: Analyzing trace with hash -162357412, now seen corresponding path program 5 times [2022-11-26 00:52:27,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:52:27,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984333305] [2022-11-26 00:52:27,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:27,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:52:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:28,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:52:28,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984333305] [2022-11-26 00:52:28,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984333305] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:52:28,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853705181] [2022-11-26 00:52:28,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:52:28,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:52:28,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:52:28,399 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:52:28,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-26 00:52:28,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:52:28,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:52:28,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-26 00:52:28,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:52:28,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:52:28,726 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-26 00:52:28,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:52:28,732 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 23 [2022-11-26 00:52:28,736 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 12 [2022-11-26 00:52:29,011 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 23 [2022-11-26 00:52:29,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:52:29,387 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-11-26 00:52:29,388 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 38 [2022-11-26 00:52:29,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:52:29,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:52:29,466 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:52:29,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 35 [2022-11-26 00:52:29,619 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-26 00:52:29,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2022-11-26 00:52:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:29,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:52:29,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853705181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:52:29,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:52:29,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [14] total 31 [2022-11-26 00:52:29,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579245226] [2022-11-26 00:52:29,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:52:29,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-26 00:52:29,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:52:29,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-26 00:52:29,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 00:52:29,813 INFO L87 Difference]: Start difference. First operand 9616 states and 29212 transitions. Second operand has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:33,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:52:33,998 INFO L93 Difference]: Finished difference Result 12288 states and 37095 transitions. [2022-11-26 00:52:33,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:52:33,998 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-26 00:52:33,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:52:34,022 INFO L225 Difference]: With dead ends: 12288 [2022-11-26 00:52:34,022 INFO L226 Difference]: Without dead ends: 12288 [2022-11-26 00:52:34,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=223, Invalid=1939, Unknown=0, NotChecked=0, Total=2162 [2022-11-26 00:52:34,023 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 472 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 3732 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 3748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:52:34,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 151 Invalid, 3748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3732 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-26 00:52:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12288 states. [2022-11-26 00:52:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12288 to 9165. [2022-11-26 00:52:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9165 states, 9161 states have (on average 3.0475930575264707) internal successors, (27919), 9164 states have internal predecessors, (27919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9165 states to 9165 states and 27919 transitions. [2022-11-26 00:52:34,244 INFO L78 Accepts]: Start accepts. Automaton has 9165 states and 27919 transitions. Word has length 32 [2022-11-26 00:52:34,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:52:34,244 INFO L495 AbstractCegarLoop]: Abstraction has 9165 states and 27919 transitions. [2022-11-26 00:52:34,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:34,245 INFO L276 IsEmpty]: Start isEmpty. Operand 9165 states and 27919 transitions. [2022-11-26 00:52:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:52:34,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:52:34,253 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:52:34,259 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-26 00:52:34,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:52:34,454 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:52:34,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:52:34,455 INFO L85 PathProgramCache]: Analyzing trace with hash 706144960, now seen corresponding path program 6 times [2022-11-26 00:52:34,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:52:34,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370761353] [2022-11-26 00:52:34,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:34,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:52:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:34,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:34,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:52:34,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370761353] [2022-11-26 00:52:34,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370761353] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:52:34,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778107263] [2022-11-26 00:52:34,867 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:52:34,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:52:34,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:52:34,868 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:52:34,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-26 00:52:35,148 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:52:35,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:52:35,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-26 00:52:35,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:52:35,185 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-26 00:52:35,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-26 00:52:35,229 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:52:35,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-26 00:52:35,374 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:52:35,402 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:52:35,518 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:52:35,568 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:52:35,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-11-26 00:52:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:35,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:52:35,850 WARN L837 $PredicateComparison]: unable to prove that (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3293 (Array Int Int)) (v_ArrVal_3295 Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3293) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-11-26 00:52:35,884 WARN L837 $PredicateComparison]: unable to prove that (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3293 (Array Int Int)) (v_ArrVal_3295 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3293) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:52:35,989 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3292 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3293 (Array Int Int)) (v_ArrVal_3295 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3292) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3293) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:52:36,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 187 treesize of output 181 [2022-11-26 00:52:36,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:52:36,133 INFO L350 Elim1Store]: Elim1 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 160 treesize of output 156 [2022-11-26 00:52:36,137 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:52:36,141 INFO L350 Elim1Store]: Elim1 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 128 treesize of output 120 [2022-11-26 00:52:36,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:52:36,148 INFO L350 Elim1Store]: Elim1 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 113 treesize of output 107 [2022-11-26 00:52:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:36,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778107263] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 00:52:36,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:52:36,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13, 12] total 32 [2022-11-26 00:52:36,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85971877] [2022-11-26 00:52:36,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:52:36,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:52:36,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:52:36,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:52:36,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=807, Unknown=13, NotChecked=180, Total=1122 [2022-11-26 00:52:36,385 INFO L87 Difference]: Start difference. First operand 9165 states and 27919 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:37,337 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3295 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3293 (Array Int Int)) (v_ArrVal_3295 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3293) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-11-26 00:52:46,785 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3295 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 0)) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((v_ArrVal_3292 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3293 (Array Int Int)) (v_ArrVal_3295 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3292) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3293) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:52:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:52:48,665 INFO L93 Difference]: Finished difference Result 15353 states and 45626 transitions. [2022-11-26 00:52:48,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-26 00:52:48,666 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-26 00:52:48,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:52:48,701 INFO L225 Difference]: With dead ends: 15353 [2022-11-26 00:52:48,701 INFO L226 Difference]: Without dead ends: 15353 [2022-11-26 00:52:48,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=228, Invalid=1362, Unknown=70, NotChecked=410, Total=2070 [2022-11-26 00:52:48,702 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 332 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 17 mSolverCounterUnsat, 196 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 196 IncrementalHoareTripleChecker+Unknown, 523 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:52:48,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 136 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1188 Invalid, 196 Unknown, 523 Unchecked, 2.8s Time] [2022-11-26 00:52:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15353 states. [2022-11-26 00:52:48,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15353 to 10260. [2022-11-26 00:52:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10260 states, 10256 states have (on average 3.050117004680187) internal successors, (31282), 10259 states have internal predecessors, (31282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10260 states to 10260 states and 31282 transitions. [2022-11-26 00:52:48,931 INFO L78 Accepts]: Start accepts. Automaton has 10260 states and 31282 transitions. Word has length 32 [2022-11-26 00:52:48,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:52:48,931 INFO L495 AbstractCegarLoop]: Abstraction has 10260 states and 31282 transitions. [2022-11-26 00:52:48,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 10260 states and 31282 transitions. [2022-11-26 00:52:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:52:48,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:52:48,943 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:52:48,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-26 00:52:49,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable94 [2022-11-26 00:52:49,143 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:52:49,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:52:49,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1209454828, now seen corresponding path program 7 times [2022-11-26 00:52:49,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:52:49,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689886418] [2022-11-26 00:52:49,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:49,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:52:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:49,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:49,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:52:49,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689886418] [2022-11-26 00:52:49,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689886418] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:52:49,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127100932] [2022-11-26 00:52:49,775 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:52:49,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:52:49,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:52:49,777 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:52:49,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-26 00:52:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:50,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-26 00:52:50,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:52:50,110 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-26 00:52:50,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-26 00:52:50,169 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:52:50,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-26 00:52:50,297 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:52:50,320 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:52:50,454 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:52:50,505 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:52:50,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-11-26 00:52:50,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:50,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:52:50,767 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3363 (Array Int Int)) (v_ArrVal_3365 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3363) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3365) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-11-26 00:52:50,792 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3363 (Array Int Int)) (v_ArrVal_3365 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3363) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3365) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:52:50,925 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3362 (Array Int Int)) (v_ArrVal_3363 (Array Int Int)) (v_ArrVal_3365 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3362) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3363) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3365) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:52:51,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 187 treesize of output 181 [2022-11-26 00:52:51,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:52:51,046 INFO L350 Elim1Store]: Elim1 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 146 treesize of output 138 [2022-11-26 00:52:51,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:52:51,052 INFO L350 Elim1Store]: Elim1 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 124 treesize of output 120 [2022-11-26 00:52:51,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:52:51,059 INFO L350 Elim1Store]: Elim1 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 113 treesize of output 107 [2022-11-26 00:52:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:51,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127100932] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 00:52:51,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:52:51,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14, 12] total 33 [2022-11-26 00:52:51,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929446164] [2022-11-26 00:52:51,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:52:51,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:52:51,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:52:51,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:52:51,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=12, NotChecked=186, Total=1190 [2022-11-26 00:52:51,280 INFO L87 Difference]: Start difference. First operand 10260 states and 31282 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:52,018 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) 0)) (forall ((v_ArrVal_3362 (Array Int Int)) (v_ArrVal_3363 (Array Int Int)) (v_ArrVal_3365 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3362) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3363) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3365) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3365 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3365) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3363 (Array Int Int)) (v_ArrVal_3365 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3363) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3365) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-11-26 00:52:53,010 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) 0)) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3365 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3365) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3363 (Array Int Int)) (v_ArrVal_3365 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3363) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3365) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-11-26 00:52:54,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:52:54,020 INFO L93 Difference]: Finished difference Result 12611 states and 38068 transitions. [2022-11-26 00:52:54,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:52:54,021 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-26 00:52:54,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:52:54,049 INFO L225 Difference]: With dead ends: 12611 [2022-11-26 00:52:54,049 INFO L226 Difference]: Without dead ends: 12611 [2022-11-26 00:52:54,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=182, Invalid=1404, Unknown=74, NotChecked=410, Total=2070 [2022-11-26 00:52:54,050 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 248 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 15 mSolverCounterUnsat, 96 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 96 IncrementalHoareTripleChecker+Unknown, 1094 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:52:54,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 93 Invalid, 2212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1007 Invalid, 96 Unknown, 1094 Unchecked, 1.7s Time] [2022-11-26 00:52:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12611 states. [2022-11-26 00:52:54,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12611 to 11002. [2022-11-26 00:52:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11002 states, 10998 states have (on average 3.0538279687215857) internal successors, (33586), 11001 states have internal predecessors, (33586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11002 states to 11002 states and 33586 transitions. [2022-11-26 00:52:54,261 INFO L78 Accepts]: Start accepts. Automaton has 11002 states and 33586 transitions. Word has length 32 [2022-11-26 00:52:54,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:52:54,262 INFO L495 AbstractCegarLoop]: Abstraction has 11002 states and 33586 transitions. [2022-11-26 00:52:54,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 11002 states and 33586 transitions. [2022-11-26 00:52:54,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:52:54,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:52:54,274 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:52:54,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-26 00:52:54,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:52:54,475 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:52:54,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:52:54,475 INFO L85 PathProgramCache]: Analyzing trace with hash -714068810, now seen corresponding path program 8 times [2022-11-26 00:52:54,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:52:54,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905686482] [2022-11-26 00:52:54,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:54,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:52:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:55,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:52:55,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905686482] [2022-11-26 00:52:55,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905686482] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:52:55,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109128156] [2022-11-26 00:52:55,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:52:55,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:52:55,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:52:55,032 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:52:55,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-26 00:52:55,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:52:55,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:52:55,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-26 00:52:55,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:52:55,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:52:55,351 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-26 00:52:55,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:52:55,356 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 23 [2022-11-26 00:52:55,359 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 12 [2022-11-26 00:52:55,457 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 23 [2022-11-26 00:52:55,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:52:55,871 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-11-26 00:52:55,871 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2022-11-26 00:52:55,974 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-26 00:52:55,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 38 [2022-11-26 00:52:56,184 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-26 00:52:56,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2022-11-26 00:52:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:56,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:52:56,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109128156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:52:56,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:52:56,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [14] total 31 [2022-11-26 00:52:56,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097759631] [2022-11-26 00:52:56,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:52:56,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-26 00:52:56,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:52:56,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-26 00:52:56,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 00:52:56,443 INFO L87 Difference]: Start difference. First operand 11002 states and 33586 transitions. Second operand has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:01,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:01,126 INFO L93 Difference]: Finished difference Result 14144 states and 42950 transitions. [2022-11-26 00:53:01,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-26 00:53:01,126 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-26 00:53:01,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:01,155 INFO L225 Difference]: With dead ends: 14144 [2022-11-26 00:53:01,155 INFO L226 Difference]: Without dead ends: 14144 [2022-11-26 00:53:01,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=251, Invalid=2299, Unknown=0, NotChecked=0, Total=2550 [2022-11-26 00:53:01,156 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 434 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4154 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 4169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:01,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 164 Invalid, 4169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4154 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-26 00:53:01,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14144 states. [2022-11-26 00:53:01,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14144 to 10924. [2022-11-26 00:53:01,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10924 states, 10920 states have (on average 3.0579670329670328) internal successors, (33393), 10923 states have internal predecessors, (33393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:01,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10924 states to 10924 states and 33393 transitions. [2022-11-26 00:53:01,357 INFO L78 Accepts]: Start accepts. Automaton has 10924 states and 33393 transitions. Word has length 32 [2022-11-26 00:53:01,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:01,357 INFO L495 AbstractCegarLoop]: Abstraction has 10924 states and 33393 transitions. [2022-11-26 00:53:01,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 10924 states and 33393 transitions. [2022-11-26 00:53:01,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:53:01,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:01,368 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:53:01,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-26 00:53:01,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:53:01,569 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:53:01,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:01,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1488276964, now seen corresponding path program 9 times [2022-11-26 00:53:01,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:01,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668858369] [2022-11-26 00:53:01,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:01,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:01,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:01,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668858369] [2022-11-26 00:53:01,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668858369] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:53:01,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163145669] [2022-11-26 00:53:01,964 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:53:01,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:53:01,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:53:01,965 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:53:01,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-26 00:53:02,250 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:53:02,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:53:02,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-26 00:53:02,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:53:02,288 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-26 00:53:02,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-26 00:53:02,343 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:53:02,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-26 00:53:02,392 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:53:02,418 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:53:02,581 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:53:02,637 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:53:02,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-11-26 00:53:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:02,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:53:03,242 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3508) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3509) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-11-26 00:53:03,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 187 treesize of output 181 [2022-11-26 00:53:03,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:53:03,292 INFO L350 Elim1Store]: Elim1 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 160 treesize of output 156 [2022-11-26 00:53:03,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:53:03,298 INFO L350 Elim1Store]: Elim1 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 149 treesize of output 143 [2022-11-26 00:53:03,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:53:03,304 INFO L350 Elim1Store]: Elim1 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 110 treesize of output 102 [2022-11-26 00:53:03,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:03,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163145669] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 00:53:03,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:53:03,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13, 12] total 32 [2022-11-26 00:53:03,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24081342] [2022-11-26 00:53:03,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:03,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:53:03,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:03,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:53:03,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=913, Unknown=21, NotChecked=62, Total=1122 [2022-11-26 00:53:03,556 INFO L87 Difference]: Start difference. First operand 10924 states and 33393 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:03,914 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_3510 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3509) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-11-26 00:53:04,028 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_3510 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 0)) (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3509) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-11-26 00:53:04,547 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_3510 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3509) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-11-26 00:53:04,634 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_3510 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 0)) (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3509) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-11-26 00:53:05,002 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) 0)) (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3508) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3509) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_3510 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 0)) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-11-26 00:53:06,424 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_3510 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3509) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3509) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-11-26 00:53:06,633 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3509) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_3510 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-11-26 00:53:06,692 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3509) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3509) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:53:06,839 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_3510 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3509) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3510) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:53:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:08,913 INFO L93 Difference]: Finished difference Result 17735 states and 53105 transitions. [2022-11-26 00:53:08,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-26 00:53:08,913 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-26 00:53:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:08,952 INFO L225 Difference]: With dead ends: 17735 [2022-11-26 00:53:08,952 INFO L226 Difference]: Without dead ends: 17735 [2022-11-26 00:53:08,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=204, Invalid=1348, Unknown=48, NotChecked=850, Total=2450 [2022-11-26 00:53:08,952 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 309 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 32 mSolverCounterUnsat, 381 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 381 IncrementalHoareTripleChecker+Unknown, 959 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:08,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 98 Invalid, 2999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1627 Invalid, 381 Unknown, 959 Unchecked, 4.4s Time] [2022-11-26 00:53:08,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17735 states. [2022-11-26 00:53:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17735 to 14016. [2022-11-26 00:53:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14016 states, 14012 states have (on average 3.07693405652298) internal successors, (43114), 14015 states have internal predecessors, (43114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14016 states to 14016 states and 43114 transitions. [2022-11-26 00:53:09,240 INFO L78 Accepts]: Start accepts. Automaton has 14016 states and 43114 transitions. Word has length 32 [2022-11-26 00:53:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:09,240 INFO L495 AbstractCegarLoop]: Abstraction has 14016 states and 43114 transitions. [2022-11-26 00:53:09,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 14016 states and 43114 transitions. [2022-11-26 00:53:09,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:53:09,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:09,256 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:53:09,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-26 00:53:09,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:53:09,457 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:53:09,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:09,457 INFO L85 PathProgramCache]: Analyzing trace with hash -511283354, now seen corresponding path program 10 times [2022-11-26 00:53:09,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:09,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474859263] [2022-11-26 00:53:09,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:09,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:09,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:09,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:09,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474859263] [2022-11-26 00:53:09,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474859263] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:53:09,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140826147] [2022-11-26 00:53:09,979 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:53:09,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:53:09,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:53:09,980 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:53:09,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-26 00:53:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:10,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-26 00:53:10,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:53:10,308 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-26 00:53:10,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-26 00:53:10,433 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:53:10,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-26 00:53:10,624 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:53:10,647 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:53:10,779 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:53:10,835 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:53:10,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-11-26 00:53:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:10,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:53:11,132 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3579 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3581 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3579) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3581) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:53:11,156 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3579 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3581 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3579) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3581) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:53:11,263 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3578 (Array Int Int)) (v_ArrVal_3579 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3581 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3578) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3579) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3581) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:53:11,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 187 treesize of output 181 [2022-11-26 00:53:11,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:53:11,529 INFO L350 Elim1Store]: Elim1 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 160 treesize of output 156 [2022-11-26 00:53:11,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:53:11,536 INFO L350 Elim1Store]: Elim1 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 149 treesize of output 143 [2022-11-26 00:53:11,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:53:11,542 INFO L350 Elim1Store]: Elim1 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 110 treesize of output 102 [2022-11-26 00:53:11,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:11,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140826147] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 00:53:11,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:53:11,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14, 12] total 37 [2022-11-26 00:53:11,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714611580] [2022-11-26 00:53:11,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:11,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:53:11,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:11,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:53:11,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1134, Unknown=18, NotChecked=210, Total=1482 [2022-11-26 00:53:11,703 INFO L87 Difference]: Start difference. First operand 14016 states and 43114 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:12,157 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3581 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3581) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3578 (Array Int Int)) (v_ArrVal_3579 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3581 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3578) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3579) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3581) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-11-26 00:53:13,702 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3581 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3581) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3579 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3581 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3579) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3581) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3579 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3581 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3579) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3581) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:53:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:14,718 INFO L93 Difference]: Finished difference Result 16711 states and 50972 transitions. [2022-11-26 00:53:14,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-26 00:53:14,719 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-26 00:53:14,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:14,755 INFO L225 Difference]: With dead ends: 16711 [2022-11-26 00:53:14,756 INFO L226 Difference]: Without dead ends: 16711 [2022-11-26 00:53:14,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=175, Invalid=1567, Unknown=84, NotChecked=430, Total=2256 [2022-11-26 00:53:14,756 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 184 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 15 mSolverCounterUnsat, 262 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 2105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 262 IncrementalHoareTripleChecker+Unknown, 808 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:14,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 118 Invalid, 2105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1020 Invalid, 262 Unknown, 808 Unchecked, 2.1s Time] [2022-11-26 00:53:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16711 states. [2022-11-26 00:53:14,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16711 to 14889. [2022-11-26 00:53:15,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14889 states, 14885 states have (on average 3.0820960698689954) internal successors, (45877), 14888 states have internal predecessors, (45877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14889 states to 14889 states and 45877 transitions. [2022-11-26 00:53:15,041 INFO L78 Accepts]: Start accepts. Automaton has 14889 states and 45877 transitions. Word has length 32 [2022-11-26 00:53:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:15,042 INFO L495 AbstractCegarLoop]: Abstraction has 14889 states and 45877 transitions. [2022-11-26 00:53:15,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 14889 states and 45877 transitions. [2022-11-26 00:53:15,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:53:15,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:15,059 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:53:15,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-26 00:53:15,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2022-11-26 00:53:15,260 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:53:15,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:15,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1931497124, now seen corresponding path program 11 times [2022-11-26 00:53:15,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:15,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924344617] [2022-11-26 00:53:15,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:15,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:15,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:15,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924344617] [2022-11-26 00:53:15,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924344617] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:53:15,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302997790] [2022-11-26 00:53:15,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:53:15,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:53:15,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:53:15,843 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:53:15,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-26 00:53:16,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:53:16,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:53:16,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-26 00:53:16,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:53:16,208 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-26 00:53:16,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-26 00:53:16,349 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:53:16,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-26 00:53:16,485 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:53:16,511 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:53:16,722 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:53:16,792 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:53:16,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-11-26 00:53:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:16,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:53:17,128 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3651 Int) (v_ArrVal_3649 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3649) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3651) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:53:17,157 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3651 Int) (v_ArrVal_3649 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3649) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3651) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:53:19,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 187 treesize of output 181 [2022-11-26 00:53:19,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:53:19,651 INFO L350 Elim1Store]: Elim1 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 167 treesize of output 161 [2022-11-26 00:53:19,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:53:19,659 INFO L350 Elim1Store]: Elim1 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 128 treesize of output 120 [2022-11-26 00:53:19,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:53:19,666 INFO L350 Elim1Store]: Elim1 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 106 treesize of output 102 [2022-11-26 00:53:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:19,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302997790] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 00:53:19,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:53:19,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14, 12] total 37 [2022-11-26 00:53:19,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043610925] [2022-11-26 00:53:19,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:19,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:53:19,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:19,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:53:19,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1192, Unknown=28, NotChecked=142, Total=1482 [2022-11-26 00:53:19,825 INFO L87 Difference]: Start difference. First operand 14889 states and 45877 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:19,871 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3651 Int) (v_ArrVal_3649 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3649) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3651) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3651 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3651) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-11-26 00:53:19,979 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3651 Int) (v_ArrVal_3649 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3649) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3651) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3651 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3651) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-11-26 00:53:20,402 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3651 Int) (v_ArrVal_3648 (Array Int Int)) (v_ArrVal_3649 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3648) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3649) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3651) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 0)) (forall ((v_ArrVal_3651 Int) (v_ArrVal_3649 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3649) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3651) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3651 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3651) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((v_ArrVal_3651 Int) (v_ArrVal_3648 (Array Int Int)) (v_ArrVal_3649 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3648) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3649) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3651) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-11-26 00:53:20,876 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3651 Int) (v_ArrVal_3648 (Array Int Int)) (v_ArrVal_3649 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3648) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3649) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3651) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3651 Int) (v_ArrVal_3649 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3649) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3651) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:53:23,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:53:25,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:53:26,228 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3651 Int) (v_ArrVal_3648 (Array Int Int)) (v_ArrVal_3649 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3648) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3649) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3651) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3651 Int) (v_ArrVal_3649 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3649) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3651) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3651 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3651) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-26 00:53:28,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:53:30,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:53:32,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:53:35,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:53:38,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:53:39,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:39,260 INFO L93 Difference]: Finished difference Result 37026 states and 112008 transitions. [2022-11-26 00:53:39,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-26 00:53:39,260 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-26 00:53:39,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:39,342 INFO L225 Difference]: With dead ends: 37026 [2022-11-26 00:53:39,342 INFO L226 Difference]: Without dead ends: 37026 [2022-11-26 00:53:39,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=265, Invalid=2446, Unknown=73, NotChecked=756, Total=3540 [2022-11-26 00:53:39,343 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 514 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 20 mSolverCounterUnsat, 259 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 3046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 259 IncrementalHoareTripleChecker+Unknown, 992 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:39,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 207 Invalid, 3046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1775 Invalid, 259 Unknown, 992 Unchecked, 18.0s Time] [2022-11-26 00:53:39,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37026 states. [2022-11-26 00:53:39,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37026 to 16898. [2022-11-26 00:53:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16898 states, 16894 states have (on average 3.0877234521131762) internal successors, (52164), 16897 states have internal predecessors, (52164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:39,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16898 states to 16898 states and 52164 transitions. [2022-11-26 00:53:39,772 INFO L78 Accepts]: Start accepts. Automaton has 16898 states and 52164 transitions. Word has length 32 [2022-11-26 00:53:39,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:39,772 INFO L495 AbstractCegarLoop]: Abstraction has 16898 states and 52164 transitions. [2022-11-26 00:53:39,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:39,772 INFO L276 IsEmpty]: Start isEmpty. Operand 16898 states and 52164 transitions. [2022-11-26 00:53:39,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:53:39,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:39,800 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:53:39,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-26 00:53:40,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2022-11-26 00:53:40,006 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:53:40,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:40,007 INFO L85 PathProgramCache]: Analyzing trace with hash -26475974, now seen corresponding path program 12 times [2022-11-26 00:53:40,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:40,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412079419] [2022-11-26 00:53:40,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:40,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:40,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:40,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412079419] [2022-11-26 00:53:40,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412079419] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:53:40,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477763546] [2022-11-26 00:53:40,418 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:53:40,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:53:40,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:53:40,419 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:53:40,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-26 00:53:40,711 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:53:40,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:53:40,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-26 00:53:40,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:53:40,745 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-26 00:53:40,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-26 00:53:40,774 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:53:40,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-26 00:53:41,009 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-26 00:53:41,119 INFO L321 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2022-11-26 00:53:41,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 46 [2022-11-26 00:53:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:41,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:53:41,453 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3717 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_385| Int) (v_ArrVal_3718 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3717) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_385|) (- 4)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3718) (< (select (store .cse0 .cse1 v_ArrVal_3718) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 3)))) is different from false [2022-11-26 00:53:41,488 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3717 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_385| Int) (v_ArrVal_3718 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3717) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_385|) (- 4)))) (or (< (select (store .cse0 .cse1 v_ArrVal_3718) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 3) (< (+ (select .cse0 .cse1) 1) v_ArrVal_3718)))) is different from false [2022-11-26 00:53:41,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 87 treesize of output 81 [2022-11-26 00:53:41,686 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:53:41,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 50 [2022-11-26 00:53:41,705 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:53:41,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2022-11-26 00:53:41,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:41,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477763546] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:53:41,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1759729259] [2022-11-26 00:53:41,871 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-26 00:53:41,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:53:41,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 32 [2022-11-26 00:53:41,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024794499] [2022-11-26 00:53:41,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:53:41,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-26 00:53:41,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:41,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-26 00:53:41,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=880, Unknown=6, NotChecked=122, Total=1122 [2022-11-26 00:53:41,873 INFO L87 Difference]: Start difference. First operand 16898 states and 52164 transitions. Second operand has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 33 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:54:06,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:54:09,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:54:38,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:54:58,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:55:02,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:55:08,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:55:20,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:55:25,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:55:31,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:55:35,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:55:41,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:55:41,392 INFO L93 Difference]: Finished difference Result 54534 states and 163863 transitions. [2022-11-26 00:55:41,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2022-11-26 00:55:41,392 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 33 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-26 00:55:41,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:55:41,636 INFO L225 Difference]: With dead ends: 54534 [2022-11-26 00:55:41,637 INFO L226 Difference]: Without dead ends: 54534 [2022-11-26 00:55:41,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 53 SyntacticMatches, 22 SemanticMatches, 261 ConstructedPredicates, 2 IntricatePredicates, 14 DeprecatedPredicates, 28780 ImplicationChecksByTransitivity, 58.2s TimeCoverageRelationStatistics Valid=9857, Invalid=57965, Unknown=46, NotChecked=1038, Total=68906 [2022-11-26 00:55:41,639 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 2290 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 23372 mSolverCounterSat, 359 mSolverCounterUnsat, 1087 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2290 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 25722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 23372 IncrementalHoareTripleChecker+Invalid, 1087 IncrementalHoareTripleChecker+Unknown, 904 IncrementalHoareTripleChecker+Unchecked, 60.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:55:41,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2290 Valid, 345 Invalid, 25722 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [359 Valid, 23372 Invalid, 1087 Unknown, 904 Unchecked, 60.1s Time] [2022-11-26 00:55:41,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54534 states. [2022-11-26 00:55:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54534 to 18379. [2022-11-26 00:55:42,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18379 states, 18375 states have (on average 3.0440816326530613) internal successors, (55935), 18378 states have internal predecessors, (55935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:55:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18379 states to 18379 states and 55935 transitions. [2022-11-26 00:55:42,391 INFO L78 Accepts]: Start accepts. Automaton has 18379 states and 55935 transitions. Word has length 32 [2022-11-26 00:55:42,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:55:42,391 INFO L495 AbstractCegarLoop]: Abstraction has 18379 states and 55935 transitions. [2022-11-26 00:55:42,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 33 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:55:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 18379 states and 55935 transitions. [2022-11-26 00:55:42,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:55:42,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:55:42,410 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:55:42,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-26 00:55:42,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2022-11-26 00:55:42,611 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:55:42,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:55:42,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1699359168, now seen corresponding path program 13 times [2022-11-26 00:55:42,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:55:42,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439682163] [2022-11-26 00:55:42,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:55:42,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:55:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:55:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:55:43,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:55:43,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439682163] [2022-11-26 00:55:43,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439682163] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:55:43,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495201236] [2022-11-26 00:55:43,321 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:55:43,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:55:43,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:55:43,322 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:55:43,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-26 00:55:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:55:43,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-26 00:55:43,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:55:43,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:43,641 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-26 00:55:43,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:43,646 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 23 [2022-11-26 00:55:43,649 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 12 [2022-11-26 00:55:43,748 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 23 [2022-11-26 00:55:44,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:55:44,275 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-11-26 00:55:44,275 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 38 [2022-11-26 00:55:44,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:44,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:44,366 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:55:44,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 35 [2022-11-26 00:55:44,571 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-26 00:55:44,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2022-11-26 00:55:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:55:44,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:55:44,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495201236] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:55:44,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:55:44,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [14] total 31 [2022-11-26 00:55:44,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914712878] [2022-11-26 00:55:44,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:55:44,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-26 00:55:44,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:55:44,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-26 00:55:44,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 00:55:44,844 INFO L87 Difference]: Start difference. First operand 18379 states and 55935 transitions. Second operand has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:55:49,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:55:49,335 INFO L93 Difference]: Finished difference Result 21468 states and 64992 transitions. [2022-11-26 00:55:49,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:55:49,335 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-26 00:55:49,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:55:49,379 INFO L225 Difference]: With dead ends: 21468 [2022-11-26 00:55:49,379 INFO L226 Difference]: Without dead ends: 21468 [2022-11-26 00:55:49,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=228, Invalid=2124, Unknown=0, NotChecked=0, Total=2352 [2022-11-26 00:55:49,379 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 507 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 3767 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 3786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:55:49,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 147 Invalid, 3786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3767 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-26 00:55:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21468 states. [2022-11-26 00:55:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21468 to 18654. [2022-11-26 00:55:49,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18654 states, 18650 states have (on average 3.0432707774798926) internal successors, (56757), 18653 states have internal predecessors, (56757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:55:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18654 states to 18654 states and 56757 transitions. [2022-11-26 00:55:49,771 INFO L78 Accepts]: Start accepts. Automaton has 18654 states and 56757 transitions. Word has length 32 [2022-11-26 00:55:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:55:49,771 INFO L495 AbstractCegarLoop]: Abstraction has 18654 states and 56757 transitions. [2022-11-26 00:55:49,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:55:49,771 INFO L276 IsEmpty]: Start isEmpty. Operand 18654 states and 56757 transitions. [2022-11-26 00:55:49,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:55:49,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:55:49,790 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:55:49,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-26 00:55:49,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2022-11-26 00:55:49,990 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:55:49,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:55:49,991 INFO L85 PathProgramCache]: Analyzing trace with hash -741261766, now seen corresponding path program 3 times [2022-11-26 00:55:49,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:55:49,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145423244] [2022-11-26 00:55:49,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:55:49,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:55:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:55:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:55:50,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:55:50,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145423244] [2022-11-26 00:55:50,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145423244] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:55:50,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667587792] [2022-11-26 00:55:50,452 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:55:50,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:55:50,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:55:50,453 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:55:50,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-26 00:55:50,755 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:55:50,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:55:50,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-26 00:55:50,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:55:50,805 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-26 00:55:50,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-26 00:55:50,843 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:55:50,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-26 00:55:51,027 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:55:51,046 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:55:51,155 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:55:51,211 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:55:51,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-11-26 00:55:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:55:51,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:55:51,527 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3865 Int) (v_ArrVal_3864 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3864) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3865) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:55:51,538 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3865 Int) (v_ArrVal_3864 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3864) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3865) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:55:51,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 93 treesize of output 89 [2022-11-26 00:55:51,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:55:51,967 INFO L350 Elim1Store]: Elim1 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 68 treesize of output 64 [2022-11-26 00:55:51,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:55:51,972 INFO L350 Elim1Store]: Elim1 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 57 treesize of output 55 [2022-11-26 00:55:51,975 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:55:51,977 INFO L350 Elim1Store]: Elim1 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 55 treesize of output 51 [2022-11-26 00:55:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:55:52,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667587792] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 00:55:52,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:55:52,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 11] total 30 [2022-11-26 00:55:52,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332529009] [2022-11-26 00:55:52,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:55:52,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:55:52,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:55:52,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:55:52,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=718, Unknown=35, NotChecked=114, Total=992 [2022-11-26 00:55:52,092 INFO L87 Difference]: Start difference. First operand 18654 states and 56757 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:55:52,925 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) 0)) (forall ((v_ArrVal_3865 Int) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_3863) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3864) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3865) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3865 Int) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_3863) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3864) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3865) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3865 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3865) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-26 00:55:55,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:55:57,599 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3865 Int) (v_ArrVal_3864 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3864) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3865) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3865 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3865) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-26 00:55:59,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:55:59,614 INFO L93 Difference]: Finished difference Result 28023 states and 84483 transitions. [2022-11-26 00:55:59,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:55:59,615 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-26 00:55:59,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:55:59,731 INFO L225 Difference]: With dead ends: 28023 [2022-11-26 00:55:59,731 INFO L226 Difference]: Without dead ends: 28023 [2022-11-26 00:55:59,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=194, Invalid=1256, Unknown=48, NotChecked=308, Total=1806 [2022-11-26 00:55:59,731 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 342 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1786 mSolverCounterSat, 19 mSolverCounterUnsat, 251 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 2455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1786 IncrementalHoareTripleChecker+Invalid, 251 IncrementalHoareTripleChecker+Unknown, 399 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:55:59,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 93 Invalid, 2455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1786 Invalid, 251 Unknown, 399 Unchecked, 6.6s Time] [2022-11-26 00:55:59,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28023 states. [2022-11-26 00:56:00,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28023 to 19482. [2022-11-26 00:56:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19482 states, 19478 states have (on average 3.0467193757059245) internal successors, (59344), 19481 states have internal predecessors, (59344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:56:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19482 states to 19482 states and 59344 transitions. [2022-11-26 00:56:00,245 INFO L78 Accepts]: Start accepts. Automaton has 19482 states and 59344 transitions. Word has length 32 [2022-11-26 00:56:00,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:00,246 INFO L495 AbstractCegarLoop]: Abstraction has 19482 states and 59344 transitions. [2022-11-26 00:56:00,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:56:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 19482 states and 59344 transitions. [2022-11-26 00:56:00,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:56:00,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:00,280 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:56:00,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-26 00:56:00,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-11-26 00:56:00,481 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:56:00,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:00,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1721652922, now seen corresponding path program 4 times [2022-11-26 00:56:00,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:00,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449174675] [2022-11-26 00:56:00,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:00,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:00,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:56:00,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449174675] [2022-11-26 00:56:00,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449174675] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:56:00,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316346985] [2022-11-26 00:56:00,939 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:56:00,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:56:00,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:56:00,940 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:56:00,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-26 00:56:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:01,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-26 00:56:01,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:01,277 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-26 00:56:01,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-26 00:56:01,357 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:56:01,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-26 00:56:01,530 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:56:01,551 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:56:01,686 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:56:01,742 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:56:01,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-11-26 00:56:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:01,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:56:02,181 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3936 Int) (v_ArrVal_3934 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3934) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3936) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:56:02,351 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3936 Int) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3934 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_3933) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3934) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3936) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:56:02,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 93 treesize of output 89 [2022-11-26 00:56:02,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:56:02,425 INFO L350 Elim1Store]: Elim1 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 75 treesize of output 73 [2022-11-26 00:56:02,429 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:56:02,431 INFO L350 Elim1Store]: Elim1 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 59 treesize of output 55 [2022-11-26 00:56:02,436 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:56:02,439 INFO L350 Elim1Store]: Elim1 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 55 treesize of output 51 [2022-11-26 00:56:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:02,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316346985] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 00:56:02,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:56:02,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 11] total 33 [2022-11-26 00:56:02,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989059068] [2022-11-26 00:56:02,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:02,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:56:02,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:56:02,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:56:02,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=903, Unknown=22, NotChecked=126, Total=1190 [2022-11-26 00:56:02,531 INFO L87 Difference]: Start difference. First operand 19482 states and 59344 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:56:05,234 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) 0)) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((v_ArrVal_3936 Int) (v_ArrVal_3934 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3934) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3936) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:56:06,018 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3936 Int) (v_ArrVal_3934 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3934) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3936) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3936 Int) (v_ArrVal_3934 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3934) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3936) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:56:06,126 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3936 Int) (v_ArrVal_3934 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3934) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3936) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3936 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3936) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-26 00:56:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:08,357 INFO L93 Difference]: Finished difference Result 28326 states and 85607 transitions. [2022-11-26 00:56:08,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:56:08,358 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-26 00:56:08,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:08,436 INFO L225 Difference]: With dead ends: 28326 [2022-11-26 00:56:08,436 INFO L226 Difference]: Without dead ends: 28326 [2022-11-26 00:56:08,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=228, Invalid=1635, Unknown=49, NotChecked=440, Total=2352 [2022-11-26 00:56:08,436 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 343 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 14 mSolverCounterUnsat, 188 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 2531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 188 IncrementalHoareTripleChecker+Unknown, 546 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:08,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 100 Invalid, 2531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1783 Invalid, 188 Unknown, 546 Unchecked, 4.6s Time] [2022-11-26 00:56:08,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28326 states. [2022-11-26 00:56:08,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28326 to 20533. [2022-11-26 00:56:08,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20533 states, 20529 states have (on average 3.043304593501875) internal successors, (62476), 20532 states have internal predecessors, (62476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:56:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20533 states to 20533 states and 62476 transitions. [2022-11-26 00:56:09,112 INFO L78 Accepts]: Start accepts. Automaton has 20533 states and 62476 transitions. Word has length 32 [2022-11-26 00:56:09,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:09,112 INFO L495 AbstractCegarLoop]: Abstraction has 20533 states and 62476 transitions. [2022-11-26 00:56:09,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:56:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 20533 states and 62476 transitions. [2022-11-26 00:56:09,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:56:09,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:09,132 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:56:09,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:09,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-11-26 00:56:09,333 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:56:09,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:09,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1565588214, now seen corresponding path program 5 times [2022-11-26 00:56:09,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:09,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367258477] [2022-11-26 00:56:09,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:09,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:09,732 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:56:09,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367258477] [2022-11-26 00:56:09,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367258477] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:56:09,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936761813] [2022-11-26 00:56:09,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:56:09,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:56:09,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:56:09,734 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:56:09,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-26 00:56:10,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:56:10,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:56:10,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-26 00:56:10,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:10,129 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-26 00:56:10,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-26 00:56:10,168 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:56:10,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-26 00:56:10,352 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:56:10,375 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:56:10,499 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-26 00:56:10,557 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:56:10,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-11-26 00:56:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:10,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:56:10,989 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4004 (Array Int Int)) (v_ArrVal_4005 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_4004) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_4005) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:56:11,001 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4004 (Array Int Int)) (v_ArrVal_4005 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_4004) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_4005) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:56:11,188 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4003 (Array Int Int)) (v_ArrVal_4004 (Array Int Int)) (v_ArrVal_4005 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_4003) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_4004) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_4005) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-26 00:56:11,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 93 treesize of output 89 [2022-11-26 00:56:11,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:56:11,268 INFO L350 Elim1Store]: Elim1 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 68 treesize of output 64 [2022-11-26 00:56:11,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:56:11,274 INFO L350 Elim1Store]: Elim1 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 64 treesize of output 60 [2022-11-26 00:56:11,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:56:11,280 INFO L350 Elim1Store]: Elim1 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 48 treesize of output 46 [2022-11-26 00:56:11,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:11,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936761813] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 00:56:11,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:56:11,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 11] total 30 [2022-11-26 00:56:11,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89411050] [2022-11-26 00:56:11,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:11,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:56:11,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:56:11,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:56:11,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=683, Unknown=19, NotChecked=168, Total=992 [2022-11-26 00:56:11,404 INFO L87 Difference]: Start difference. First operand 20533 states and 62476 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:56:17,081 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) 0)) (forall ((v_ArrVal_4003 (Array Int Int)) (v_ArrVal_4004 (Array Int Int)) (v_ArrVal_4005 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_4003) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_4004) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_4005) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-11-26 00:56:17,547 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4003 (Array Int Int)) (v_ArrVal_4004 (Array Int Int)) (v_ArrVal_4005 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_4003) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_4004) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_4005) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_4005 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_4005) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-26 00:56:19,746 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_4005 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_4005) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_4004 (Array Int Int)) (v_ArrVal_4005 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_4004) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_4005) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-26 00:56:20,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:20,120 INFO L93 Difference]: Finished difference Result 28815 states and 86939 transitions. [2022-11-26 00:56:20,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:56:20,121 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-26 00:56:20,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:20,284 INFO L225 Difference]: With dead ends: 28815 [2022-11-26 00:56:20,284 INFO L226 Difference]: Without dead ends: 28815 [2022-11-26 00:56:20,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=196, Invalid=1197, Unknown=37, NotChecked=462, Total=1892 [2022-11-26 00:56:20,284 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 259 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 12 mSolverCounterUnsat, 181 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 181 IncrementalHoareTripleChecker+Unknown, 830 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:20,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 107 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1614 Invalid, 181 Unknown, 830 Unchecked, 3.8s Time] [2022-11-26 00:56:20,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28815 states. [2022-11-26 00:56:20,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28815 to 20901. [2022-11-26 00:56:20,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20901 states, 20897 states have (on average 3.037900177058908) internal successors, (63483), 20900 states have internal predecessors, (63483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:56:20,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20901 states to 20901 states and 63483 transitions. [2022-11-26 00:56:20,854 INFO L78 Accepts]: Start accepts. Automaton has 20901 states and 63483 transitions. Word has length 32 [2022-11-26 00:56:20,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:20,854 INFO L495 AbstractCegarLoop]: Abstraction has 20901 states and 63483 transitions. [2022-11-26 00:56:20,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:56:20,854 INFO L276 IsEmpty]: Start isEmpty. Operand 20901 states and 63483 transitions. [2022-11-26 00:56:20,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:56:20,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:20,884 INFO L195 NwaCegarLoop]: 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] [2022-11-26 00:56:20,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:21,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:56:21,085 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-26 00:56:21,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:21,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1759254134, now seen corresponding path program 6 times [2022-11-26 00:56:21,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:21,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061990390] [2022-11-26 00:56:21,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:21,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:21,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:56:21,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061990390] [2022-11-26 00:56:21,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061990390] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:56:21,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350641601] [2022-11-26 00:56:21,572 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:56:21,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:56:21,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:56:21,573 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:56:21,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658ef196-2f18-4f26-9ed4-7cfa35bfed57/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-26 00:56:21,901 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:56:21,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:56:21,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-26 00:56:21,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:22,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:22,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:22,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:56:22,491 INFO L321 Elim1Store]: treesize reduction 70, result has 36.4 percent of original size [2022-11-26 00:56:22,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 61 [2022-11-26 00:56:22,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:56:22,698 INFO L321 Elim1Store]: treesize reduction 60, result has 35.5 percent of original size [2022-11-26 00:56:22,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 56 treesize of output 72 [2022-11-26 00:56:23,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:23,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:23,184 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 00:56:23,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 53 [2022-11-26 00:56:23,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:23,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:23,422 INFO L321 Elim1Store]: treesize reduction 46, result has 62.3 percent of original size [2022-11-26 00:56:23,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 56 treesize of output 104 [2022-11-26 00:56:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:23,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:56:43,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:56:44,446 INFO L321 Elim1Store]: treesize reduction 321, result has 40.9 percent of original size [2022-11-26 00:56:44,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 679 treesize of output 749 [2022-11-26 00:56:44,516 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-26 00:56:44,516 INFO L350 Elim1Store]: Elim1 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 694 treesize of output 682 [2022-11-26 00:56:44,573 INFO L350 Elim1Store]: Elim1 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 232 treesize of output 228 [2022-11-26 00:56:49,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:56:49,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:56:52,915 INFO L321 Elim1Store]: treesize reduction 405, result has 58.8 percent of original size [2022-11-26 00:56:52,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 4 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 74 case distinctions, treesize of input 863 treesize of output 1272