./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 654ba073723c5bebcf706552b3cd58bc95cc07bc71a7e60391f80a16de89dbcb --- 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-2329fc7 [2022-12-14 04:57:03,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 04:57:03,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 04:57:03,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 04:57:03,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 04:57:03,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 04:57:03,621 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 04:57:03,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 04:57:03,624 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 04:57:03,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 04:57:03,626 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 04:57:03,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 04:57:03,627 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 04:57:03,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 04:57:03,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 04:57:03,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 04:57:03,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 04:57:03,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 04:57:03,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 04:57:03,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 04:57:03,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 04:57:03,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 04:57:03,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 04:57:03,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 04:57:03,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 04:57:03,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 04:57:03,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 04:57:03,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 04:57:03,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 04:57:03,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 04:57:03,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 04:57:03,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 04:57:03,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 04:57:03,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 04:57:03,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 04:57:03,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 04:57:03,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 04:57:03,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 04:57:03,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 04:57:03,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 04:57:03,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 04:57:03,653 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-12-14 04:57:03,673 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 04:57:03,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 04:57:03,674 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 04:57:03,681 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 04:57:03,682 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 04:57:03,682 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 04:57:03,682 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 04:57:03,682 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 04:57:03,683 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 04:57:03,683 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 04:57:03,683 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 04:57:03,683 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 04:57:03,683 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 04:57:03,683 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 04:57:03,684 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 04:57:03,684 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 04:57:03,684 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 04:57:03,684 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 04:57:03,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 04:57:03,685 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 04:57:03,685 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 04:57:03,685 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 04:57:03,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 04:57:03,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 04:57:03,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 04:57:03,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 04:57:03,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 04:57:03,686 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-12-14 04:57:03,686 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 04:57:03,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 04:57:03,686 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 04:57:03,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 04:57:03,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 04:57:03,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 04:57:03,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:57:03,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 04:57:03,687 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 04:57:03,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 04:57:03,688 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 04:57:03,688 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 04:57:03,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 04:57:03,688 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 04:57:03,688 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 04:57:03,688 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_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/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_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh 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 ! data-race) ) 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 -> 654ba073723c5bebcf706552b3cd58bc95cc07bc71a7e60391f80a16de89dbcb [2022-12-14 04:57:03,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 04:57:03,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 04:57:03,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 04:57:03,904 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 04:57:03,905 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 04:57:03,906 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i [2022-12-14 04:57:06,543 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 04:57:06,715 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 04:57:06,716 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i [2022-12-14 04:57:06,724 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/data/8067a5d03/907a4696f807487584f6cd033ce5eb34/FLAG1e4df08e1 [2022-12-14 04:57:06,737 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/data/8067a5d03/907a4696f807487584f6cd033ce5eb34 [2022-12-14 04:57:06,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 04:57:06,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 04:57:06,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 04:57:06,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 04:57:06,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 04:57:06,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:57:06" (1/1) ... [2022-12-14 04:57:06,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc27f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:06, skipping insertion in model container [2022-12-14 04:57:06,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:57:06" (1/1) ... [2022-12-14 04:57:06,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 04:57:06,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 04:57:06,927 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 04:57:07,070 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30448,30461] [2022-12-14 04:57:07,082 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30811,30824] [2022-12-14 04:57:07,097 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31483,31496] [2022-12-14 04:57:07,098 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31534,31547] [2022-12-14 04:57:07,100 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31683,31696] [2022-12-14 04:57:07,101 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31760,31773] [2022-12-14 04:57:07,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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31807,31820] [2022-12-14 04:57:07,104 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31916,31929] [2022-12-14 04:57:07,106 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32035,32048] [2022-12-14 04:57:07,107 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32083,32096] [2022-12-14 04:57:07,108 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32160,32173] [2022-12-14 04:57:07,109 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32286,32299] [2022-12-14 04:57:07,118 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32897,32910] [2022-12-14 04:57:07,119 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32974,32987] [2022-12-14 04:57:07,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:57:07,132 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 04:57:07,144 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 04:57:07,163 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30448,30461] [2022-12-14 04:57:07,167 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30811,30824] [2022-12-14 04:57:07,175 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31483,31496] [2022-12-14 04:57:07,176 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31534,31547] [2022-12-14 04:57:07,178 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31683,31696] [2022-12-14 04:57:07,179 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31760,31773] [2022-12-14 04:57:07,180 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31807,31820] [2022-12-14 04:57:07,182 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31916,31929] [2022-12-14 04:57:07,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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32035,32048] [2022-12-14 04:57:07,185 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32083,32096] [2022-12-14 04:57:07,186 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32160,32173] [2022-12-14 04:57:07,187 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32286,32299] [2022-12-14 04:57:07,195 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32897,32910] [2022-12-14 04:57:07,196 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_45225fda-4c8d-4408-8857-4702940b4443/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32974,32987] [2022-12-14 04:57:07,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:57:07,227 INFO L208 MainTranslator]: Completed translation [2022-12-14 04:57:07,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:07 WrapperNode [2022-12-14 04:57:07,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 04:57:07,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 04:57:07,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 04:57:07,229 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 04:57:07,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:07" (1/1) ... [2022-12-14 04:57:07,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:07" (1/1) ... [2022-12-14 04:57:07,301 INFO L138 Inliner]: procedures = 174, calls = 73, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 805 [2022-12-14 04:57:07,302 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 04:57:07,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 04:57:07,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 04:57:07,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 04:57:07,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:07" (1/1) ... [2022-12-14 04:57:07,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:07" (1/1) ... [2022-12-14 04:57:07,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:07" (1/1) ... [2022-12-14 04:57:07,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:07" (1/1) ... [2022-12-14 04:57:07,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:07" (1/1) ... [2022-12-14 04:57:07,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:07" (1/1) ... [2022-12-14 04:57:07,374 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:07" (1/1) ... [2022-12-14 04:57:07,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:07" (1/1) ... [2022-12-14 04:57:07,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 04:57:07,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 04:57:07,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 04:57:07,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 04:57:07,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:07" (1/1) ... [2022-12-14 04:57:07,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:57:07,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:57:07,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 04:57:07,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 04:57:07,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 04:57:07,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 04:57:07,449 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 04:57:07,449 INFO L130 BoogieDeclarations]: Found specification of procedure worker_fn [2022-12-14 04:57:07,449 INFO L138 BoogieDeclarations]: Found implementation of procedure worker_fn [2022-12-14 04:57:07,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 04:57:07,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 04:57:07,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 04:57:07,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 04:57:07,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 04:57:07,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 04:57:07,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 04:57:07,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 04:57:07,451 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 04:57:07,581 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 04:57:07,583 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 04:57:08,424 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 04:57:08,435 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 04:57:08,435 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-12-14 04:57:08,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:57:08 BoogieIcfgContainer [2022-12-14 04:57:08,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 04:57:08,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 04:57:08,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 04:57:08,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 04:57:08,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:57:06" (1/3) ... [2022-12-14 04:57:08,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7974189e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:57:08, skipping insertion in model container [2022-12-14 04:57:08,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:07" (2/3) ... [2022-12-14 04:57:08,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7974189e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:57:08, skipping insertion in model container [2022-12-14 04:57:08,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:57:08" (3/3) ... [2022-12-14 04:57:08,443 INFO L112 eAbstractionObserver]: Analyzing ICFG one_time_barrier_twice_2t.i [2022-12-14 04:57:08,449 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 04:57:08,457 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 04:57:08,457 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2022-12-14 04:57:08,457 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 04:57:08,592 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-14 04:57:08,626 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 04:57:08,638 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 868 places, 928 transitions, 1864 flow [2022-12-14 04:57:08,640 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 868 places, 928 transitions, 1864 flow [2022-12-14 04:57:08,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 868 places, 928 transitions, 1864 flow [2022-12-14 04:57:09,015 INFO L130 PetriNetUnfolder]: 95/1352 cut-off events. [2022-12-14 04:57:09,015 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-14 04:57:09,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 1352 events. 95/1352 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 4538 event pairs, 0 based on Foata normal form. 0/1139 useless extension candidates. Maximal degree in co-relation 794. Up to 4 conditions per place. [2022-12-14 04:57:09,100 INFO L119 LiptonReduction]: Number of co-enabled transitions 313900 [2022-12-14 04:57:45,274 WARN L233 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 111 DAG size of output: 109 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 04:57:52,601 WARN L233 SmtUtils]: Spent 5.23s on a formula simplification. DAG size of input: 115 DAG size of output: 107 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 04:58:20,626 WARN L233 SmtUtils]: Spent 17.62s on a formula simplification. DAG size of input: 138 DAG size of output: 136 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 04:58:45,469 WARN L233 SmtUtils]: Spent 20.89s on a formula simplification. DAG size of input: 150 DAG size of output: 146 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 04:59:56,209 WARN L233 SmtUtils]: Spent 1.09m on a formula simplification. DAG size of input: 179 DAG size of output: 175 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 05:00:17,766 WARN L233 SmtUtils]: Spent 21.55s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 05:01:39,139 WARN L233 SmtUtils]: Spent 1.36m on a formula simplification. DAG size of input: 188 DAG size of output: 184 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 05:02:07,445 WARN L233 SmtUtils]: Spent 28.30s on a formula simplification that was a NOOP. DAG size: 174 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 05:02:11,080 INFO L134 LiptonReduction]: Checked pairs total: 5634481 [2022-12-14 05:02:11,080 INFO L136 LiptonReduction]: Total number of compositions: 701 [2022-12-14 05:02:11,086 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 439 places, 475 transitions, 958 flow [2022-12-14 05:02:11,793 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 45722 states, 44278 states have (on average 2.2286462803197975) internal successors, (98680), 45721 states have internal predecessors, (98680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:11,809 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 05:02:11,812 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;@7c01b5de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 05:02:11,813 INFO L358 AbstractCegarLoop]: Starting to check reachability of 113 error locations. [2022-12-14 05:02:11,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 45722 states, 44278 states have (on average 2.2286462803197975) internal successors, (98680), 45721 states have internal predecessors, (98680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:11,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 05:02:11,855 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:02:11,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 05:02:11,856 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-14 05:02:11,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:02:11,860 INFO L85 PathProgramCache]: Analyzing trace with hash 101315, now seen corresponding path program 1 times [2022-12-14 05:02:11,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:02:11,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272758742] [2022-12-14 05:02:11,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:02:11,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:02:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:02:12,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:02:12,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:02:12,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272758742] [2022-12-14 05:02:12,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272758742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:02:12,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:02:12,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 05:02:12,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507577653] [2022-12-14 05:02:12,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:02:12,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 05:02:12,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:02:12,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 05:02:12,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 05:02:12,093 INFO L87 Difference]: Start difference. First operand has 45722 states, 44278 states have (on average 2.2286462803197975) internal successors, (98680), 45721 states have internal predecessors, (98680), 0 states have call successors, (0), 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, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:13,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:02:13,393 INFO L93 Difference]: Finished difference Result 45715 states and 94411 transitions. [2022-12-14 05:02:13,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 05:02:13,396 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-12-14 05:02:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:02:13,645 INFO L225 Difference]: With dead ends: 45715 [2022-12-14 05:02:13,646 INFO L226 Difference]: Without dead ends: 45713 [2022-12-14 05:02:13,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 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-12-14 05:02:13,648 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 05:02:13,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 297 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 05:02:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45713 states. [2022-12-14 05:02:14,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45713 to 45713. [2022-12-14 05:02:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45713 states, 44278 states have (on average 2.132164957766837) internal successors, (94408), 45712 states have internal predecessors, (94408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45713 states to 45713 states and 94408 transitions. [2022-12-14 05:02:14,770 INFO L78 Accepts]: Start accepts. Automaton has 45713 states and 94408 transitions. Word has length 2 [2022-12-14 05:02:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:02:14,770 INFO L495 AbstractCegarLoop]: Abstraction has 45713 states and 94408 transitions. [2022-12-14 05:02:14,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 45713 states and 94408 transitions. [2022-12-14 05:02:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 05:02:14,771 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:02:14,771 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-12-14 05:02:14,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 05:02:14,771 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-14 05:02:14,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:02:14,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1871540906, now seen corresponding path program 1 times [2022-12-14 05:02:14,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:02:14,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137539482] [2022-12-14 05:02:14,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:02:14,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:02:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:02:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 05:02:14,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:02:14,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137539482] [2022-12-14 05:02:14,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137539482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:02:14,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:02:14,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:02:14,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710692904] [2022-12-14 05:02:14,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:02:14,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:02:14,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:02:14,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:02:14,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:02:14,904 INFO L87 Difference]: Start difference. First operand 45713 states and 94408 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:16,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:02:16,270 INFO L93 Difference]: Finished difference Result 45714 states and 94409 transitions. [2022-12-14 05:02:16,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:02:16,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 05:02:16,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:02:16,380 INFO L225 Difference]: With dead ends: 45714 [2022-12-14 05:02:16,380 INFO L226 Difference]: Without dead ends: 45714 [2022-12-14 05:02:16,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:02:16,381 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 0 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:02:16,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 594 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 05:02:16,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45714 states. [2022-12-14 05:02:17,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45714 to 45714. [2022-12-14 05:02:17,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45714 states, 44279 states have (on average 2.1321393888750877) internal successors, (94409), 45713 states have internal predecessors, (94409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45714 states to 45714 states and 94409 transitions. [2022-12-14 05:02:17,212 INFO L78 Accepts]: Start accepts. Automaton has 45714 states and 94409 transitions. Word has length 7 [2022-12-14 05:02:17,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:02:17,212 INFO L495 AbstractCegarLoop]: Abstraction has 45714 states and 94409 transitions. [2022-12-14 05:02:17,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 45714 states and 94409 transitions. [2022-12-14 05:02:17,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 05:02:17,213 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:02:17,213 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-14 05:02:17,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 05:02:17,213 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-14 05:02:17,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:02:17,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2001597246, now seen corresponding path program 1 times [2022-12-14 05:02:17,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:02:17,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319739302] [2022-12-14 05:02:17,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:02:17,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:02:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:02:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 05:02:17,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:02:17,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319739302] [2022-12-14 05:02:17,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319739302] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:02:17,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649146967] [2022-12-14 05:02:17,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:02:17,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:02:17,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:02:17,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:02:17,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 05:02:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:02:17,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 05:02:17,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:02:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 05:02:17,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:02:17,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 05:02:17,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649146967] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:02:17,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [535271343] [2022-12-14 05:02:17,508 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-12-14 05:02:17,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:02:17,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-12-14 05:02:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723913819] [2022-12-14 05:02:17,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:02:17,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 05:02:17,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:02:17,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 05:02:17,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:02:17,512 INFO L87 Difference]: Start difference. First operand 45714 states and 94409 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:18,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:02:18,663 INFO L93 Difference]: Finished difference Result 45715 states and 94410 transitions. [2022-12-14 05:02:18,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:02:18,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 05:02:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:02:18,743 INFO L225 Difference]: With dead ends: 45715 [2022-12-14 05:02:18,743 INFO L226 Difference]: Without dead ends: 45715 [2022-12-14 05:02:18,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:02:18,745 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 0 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:02:18,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 594 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 05:02:18,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45715 states. [2022-12-14 05:02:19,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45715 to 45715. [2022-12-14 05:02:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45715 states, 44280 states have (on average 2.1321138211382116) internal successors, (94410), 45714 states have internal predecessors, (94410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45715 states to 45715 states and 94410 transitions. [2022-12-14 05:02:19,518 INFO L78 Accepts]: Start accepts. Automaton has 45715 states and 94410 transitions. Word has length 8 [2022-12-14 05:02:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:02:19,518 INFO L495 AbstractCegarLoop]: Abstraction has 45715 states and 94410 transitions. [2022-12-14 05:02:19,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 45715 states and 94410 transitions. [2022-12-14 05:02:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 05:02:19,519 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:02:19,519 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-12-14 05:02:19,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 05:02:19,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:02:19,721 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-14 05:02:19,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:02:19,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1738376490, now seen corresponding path program 2 times [2022-12-14 05:02:19,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:02:19,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500130063] [2022-12-14 05:02:19,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:02:19,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:02:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:02:19,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:02:19,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:02:19,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500130063] [2022-12-14 05:02:19,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500130063] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:02:19,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009424921] [2022-12-14 05:02:19,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:02:19,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:02:19,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:02:19,930 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:02:19,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 05:02:20,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 05:02:20,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:02:20,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 05:02:20,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:02:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:02:20,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:02:20,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009424921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:02:20,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:02:20,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-14 05:02:20,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040890163] [2022-12-14 05:02:20,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:02:20,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:02:20,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:02:20,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:02:20,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:02:20,515 INFO L87 Difference]: Start difference. First operand 45715 states and 94410 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:02:22,058 INFO L93 Difference]: Finished difference Result 45307 states and 93580 transitions. [2022-12-14 05:02:22,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:02:22,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 05:02:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:02:22,152 INFO L225 Difference]: With dead ends: 45307 [2022-12-14 05:02:22,152 INFO L226 Difference]: Without dead ends: 45307 [2022-12-14 05:02:22,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:02:22,153 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 651 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:02:22,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 580 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 05:02:22,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45307 states. [2022-12-14 05:02:22,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45307 to 45307. [2022-12-14 05:02:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45307 states, 43907 states have (on average 2.131323023663653) internal successors, (93580), 45306 states have internal predecessors, (93580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45307 states to 45307 states and 93580 transitions. [2022-12-14 05:02:22,952 INFO L78 Accepts]: Start accepts. Automaton has 45307 states and 93580 transitions. Word has length 9 [2022-12-14 05:02:22,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:02:22,953 INFO L495 AbstractCegarLoop]: Abstraction has 45307 states and 93580 transitions. [2022-12-14 05:02:22,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 45307 states and 93580 transitions. [2022-12-14 05:02:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 05:02:22,953 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:02:22,953 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:02:22,959 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 05:02:23,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-14 05:02:23,155 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-14 05:02:23,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:02:23,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1076386851, now seen corresponding path program 1 times [2022-12-14 05:02:23,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:02:23,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149547025] [2022-12-14 05:02:23,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:02:23,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:02:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:02:23,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:02:23,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:02:23,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149547025] [2022-12-14 05:02:23,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149547025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:02:23,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:02:23,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:02:23,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747512916] [2022-12-14 05:02:23,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:02:23,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:02:23,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:02:23,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:02:23,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:02:23,229 INFO L87 Difference]: Start difference. First operand 45307 states and 93580 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:02:24,027 INFO L93 Difference]: Finished difference Result 45105 states and 93369 transitions. [2022-12-14 05:02:24,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:02:24,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 05:02:24,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:02:24,103 INFO L225 Difference]: With dead ends: 45105 [2022-12-14 05:02:24,103 INFO L226 Difference]: Without dead ends: 45105 [2022-12-14 05:02:24,103 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-12-14 05:02:24,104 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 213 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 05:02:24,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 592 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 05:02:24,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45105 states. [2022-12-14 05:02:24,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45105 to 45105. [2022-12-14 05:02:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45105 states, 43739 states have (on average 2.1346852923020645) internal successors, (93369), 45104 states have internal predecessors, (93369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45105 states to 45105 states and 93369 transitions. [2022-12-14 05:02:24,880 INFO L78 Accepts]: Start accepts. Automaton has 45105 states and 93369 transitions. Word has length 10 [2022-12-14 05:02:24,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:02:24,880 INFO L495 AbstractCegarLoop]: Abstraction has 45105 states and 93369 transitions. [2022-12-14 05:02:24,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:24,881 INFO L276 IsEmpty]: Start isEmpty. Operand 45105 states and 93369 transitions. [2022-12-14 05:02:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 05:02:24,881 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:02:24,881 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:02:24,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 05:02:24,881 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-14 05:02:24,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:02:24,882 INFO L85 PathProgramCache]: Analyzing trace with hash 55629910, now seen corresponding path program 1 times [2022-12-14 05:02:24,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:02:24,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855442672] [2022-12-14 05:02:24,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:02:24,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:02:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:02:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:02:25,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:02:25,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855442672] [2022-12-14 05:02:25,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855442672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:02:25,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:02:25,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 05:02:25,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505260448] [2022-12-14 05:02:25,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:02:25,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 05:02:25,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:02:25,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 05:02:25,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:02:25,199 INFO L87 Difference]: Start difference. First operand 45105 states and 93369 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:29,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:02:29,178 INFO L93 Difference]: Finished difference Result 46361 states and 95929 transitions. [2022-12-14 05:02:29,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:02:29,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 05:02:29,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:02:29,257 INFO L225 Difference]: With dead ends: 46361 [2022-12-14 05:02:29,258 INFO L226 Difference]: Without dead ends: 46361 [2022-12-14 05:02:29,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:02:29,258 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 532 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 3096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-12-14 05:02:29,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 466 Invalid, 3096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 2758 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-12-14 05:02:29,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46361 states. [2022-12-14 05:02:29,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46361 to 45939. [2022-12-14 05:02:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45939 states, 44574 states have (on average 2.132835285143806) internal successors, (95069), 45938 states have internal predecessors, (95069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45939 states to 45939 states and 95069 transitions. [2022-12-14 05:02:30,048 INFO L78 Accepts]: Start accepts. Automaton has 45939 states and 95069 transitions. Word has length 12 [2022-12-14 05:02:30,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:02:30,049 INFO L495 AbstractCegarLoop]: Abstraction has 45939 states and 95069 transitions. [2022-12-14 05:02:30,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 45939 states and 95069 transitions. [2022-12-14 05:02:30,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 05:02:30,049 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:02:30,049 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:02:30,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 05:02:30,049 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-14 05:02:30,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:02:30,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1599178239, now seen corresponding path program 1 times [2022-12-14 05:02:30,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:02:30,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288735260] [2022-12-14 05:02:30,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:02:30,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:02:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:02:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 05:02:30,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:02:30,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288735260] [2022-12-14 05:02:30,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288735260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:02:30,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:02:30,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 05:02:30,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374519973] [2022-12-14 05:02:30,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:02:30,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 05:02:30,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:02:30,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 05:02:30,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:02:30,386 INFO L87 Difference]: Start difference. First operand 45939 states and 95069 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:33,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:02:33,937 INFO L93 Difference]: Finished difference Result 47101 states and 97435 transitions. [2022-12-14 05:02:33,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:02:33,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have 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-12-14 05:02:33,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:02:34,035 INFO L225 Difference]: With dead ends: 47101 [2022-12-14 05:02:34,036 INFO L226 Difference]: Without dead ends: 47101 [2022-12-14 05:02:34,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:02:34,036 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 480 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 2632 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 2632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:02:34,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 441 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 2632 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-12-14 05:02:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47101 states. [2022-12-14 05:02:34,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47101 to 46711. [2022-12-14 05:02:34,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46711 states, 45346 states have (on average 2.131191284788074) internal successors, (96641), 46710 states have internal predecessors, (96641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46711 states to 46711 states and 96641 transitions. [2022-12-14 05:02:34,740 INFO L78 Accepts]: Start accepts. Automaton has 46711 states and 96641 transitions. Word has length 13 [2022-12-14 05:02:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:02:34,740 INFO L495 AbstractCegarLoop]: Abstraction has 46711 states and 96641 transitions. [2022-12-14 05:02:34,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 46711 states and 96641 transitions. [2022-12-14 05:02:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 05:02:34,741 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:02:34,741 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:02:34,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 05:02:34,741 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-14 05:02:34,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:02:34,741 INFO L85 PathProgramCache]: Analyzing trace with hash -564118582, now seen corresponding path program 1 times [2022-12-14 05:02:34,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:02:34,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483432542] [2022-12-14 05:02:34,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:02:34,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:02:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:02:34,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:02:34,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:02:34,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483432542] [2022-12-14 05:02:34,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483432542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:02:34,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:02:34,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:02:34,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643335917] [2022-12-14 05:02:34,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:02:34,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:02:34,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:02:34,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:02:34,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:02:34,815 INFO L87 Difference]: Start difference. First operand 46711 states and 96641 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:36,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:02:36,460 INFO L93 Difference]: Finished difference Result 46924 states and 97075 transitions. [2022-12-14 05:02:36,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:02:36,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 05:02:36,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:02:36,540 INFO L225 Difference]: With dead ends: 46924 [2022-12-14 05:02:36,540 INFO L226 Difference]: Without dead ends: 46924 [2022-12-14 05:02:36,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:02:36,540 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 132 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:02:36,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 337 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 05:02:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46924 states. [2022-12-14 05:02:37,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46924 to 46924. [2022-12-14 05:02:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46924 states, 45559 states have (on average 2.1307535283917556) internal successors, (97075), 46923 states have internal predecessors, (97075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46924 states to 46924 states and 97075 transitions. [2022-12-14 05:02:37,252 INFO L78 Accepts]: Start accepts. Automaton has 46924 states and 97075 transitions. Word has length 15 [2022-12-14 05:02:37,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:02:37,253 INFO L495 AbstractCegarLoop]: Abstraction has 46924 states and 97075 transitions. [2022-12-14 05:02:37,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 46924 states and 97075 transitions. [2022-12-14 05:02:37,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 05:02:37,253 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:02:37,254 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:02:37,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 05:02:37,254 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-14 05:02:37,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:02:37,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1374488054, now seen corresponding path program 1 times [2022-12-14 05:02:37,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:02:37,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808270372] [2022-12-14 05:02:37,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:02:37,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:02:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:02:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 05:02:37,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:02:37,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808270372] [2022-12-14 05:02:37,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808270372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:02:37,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:02:37,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:02:37,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891758245] [2022-12-14 05:02:37,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:02:37,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:02:37,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:02:37,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:02:37,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:02:37,330 INFO L87 Difference]: Start difference. First operand 46924 states and 97075 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:02:39,012 INFO L93 Difference]: Finished difference Result 47118 states and 97470 transitions. [2022-12-14 05:02:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:02:39,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 05:02:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:02:39,099 INFO L225 Difference]: With dead ends: 47118 [2022-12-14 05:02:39,099 INFO L226 Difference]: Without dead ends: 47118 [2022-12-14 05:02:39,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:02:39,100 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 120 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 05:02:39,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 332 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 05:02:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47118 states. [2022-12-14 05:02:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47118 to 47118. [2022-12-14 05:02:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47118 states, 45754 states have (on average 2.130305547055995) internal successors, (97470), 47117 states have internal predecessors, (97470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47118 states to 47118 states and 97470 transitions. [2022-12-14 05:02:39,814 INFO L78 Accepts]: Start accepts. Automaton has 47118 states and 97470 transitions. Word has length 16 [2022-12-14 05:02:39,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:02:39,814 INFO L495 AbstractCegarLoop]: Abstraction has 47118 states and 97470 transitions. [2022-12-14 05:02:39,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 47118 states and 97470 transitions. [2022-12-14 05:02:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 05:02:39,815 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:02:39,815 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:02:39,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 05:02:39,815 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-14 05:02:39,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:02:39,815 INFO L85 PathProgramCache]: Analyzing trace with hash -387826148, now seen corresponding path program 1 times [2022-12-14 05:02:39,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:02:39,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346868254] [2022-12-14 05:02:39,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:02:39,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:02:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:02:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 05:02:40,247 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:02:40,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346868254] [2022-12-14 05:02:40,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346868254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:02:40,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:02:40,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 05:02:40,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383840670] [2022-12-14 05:02:40,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:02:40,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 05:02:40,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:02:40,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 05:02:40,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:02:40,249 INFO L87 Difference]: Start difference. First operand 47118 states and 97470 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:02:42,916 INFO L93 Difference]: Finished difference Result 47122 states and 97478 transitions. [2022-12-14 05:02:42,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 05:02:42,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 05:02:42,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:02:42,995 INFO L225 Difference]: With dead ends: 47122 [2022-12-14 05:02:42,995 INFO L226 Difference]: Without dead ends: 47122 [2022-12-14 05:02:42,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-14 05:02:42,996 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 1345 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:02:42,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 861 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-12-14 05:02:43,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47122 states. [2022-12-14 05:02:43,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47122 to 47102. [2022-12-14 05:02:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47102 states, 45739 states have (on average 2.1303045541004395) internal successors, (97438), 47101 states have internal predecessors, (97438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47102 states to 47102 states and 97438 transitions. [2022-12-14 05:02:43,849 INFO L78 Accepts]: Start accepts. Automaton has 47102 states and 97438 transitions. Word has length 18 [2022-12-14 05:02:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:02:43,849 INFO L495 AbstractCegarLoop]: Abstraction has 47102 states and 97438 transitions. [2022-12-14 05:02:43,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 47102 states and 97438 transitions. [2022-12-14 05:02:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 05:02:43,850 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:02:43,850 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:02:43,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 05:02:43,850 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-14 05:02:43,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:02:43,850 INFO L85 PathProgramCache]: Analyzing trace with hash -10576955, now seen corresponding path program 1 times [2022-12-14 05:02:43,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:02:43,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952710586] [2022-12-14 05:02:43,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:02:43,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:02:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:02:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:02:44,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:02:44,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952710586] [2022-12-14 05:02:44,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952710586] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:02:44,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418648713] [2022-12-14 05:02:44,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:02:44,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:02:44,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:02:44,244 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:02:44,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 05:02:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:02:44,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 05:02:44,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:02:44,461 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 05:02:44,462 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 24 treesize of output 26 [2022-12-14 05:02:44,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:02:44,586 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-12-14 05:02:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:02:44,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:02:44,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418648713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:02:44,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:02:44,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2022-12-14 05:02:44,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107663885] [2022-12-14 05:02:44,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:02:44,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 05:02:44,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:02:44,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 05:02:44,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-12-14 05:02:44,603 INFO L87 Difference]: Start difference. First operand 47102 states and 97438 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-12-14 05:02:49,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:02:49,314 INFO L93 Difference]: Finished difference Result 47306 states and 97653 transitions. [2022-12-14 05:02:49,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 05:02:49,314 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 18 [2022-12-14 05:02:49,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:02:49,409 INFO L225 Difference]: With dead ends: 47306 [2022-12-14 05:02:49,409 INFO L226 Difference]: Without dead ends: 47306 [2022-12-14 05:02:49,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-12-14 05:02:49,410 INFO L413 NwaCegarLoop]: 426 mSDtfsCounter, 1215 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 2328 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:02:49,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 1157 Invalid, 2342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2328 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-12-14 05:02:49,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47306 states. [2022-12-14 05:02:50,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47306 to 47086. [2022-12-14 05:02:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47086 states, 45724 states have (on average 2.1303035604933953) internal successors, (97406), 47085 states have internal predecessors, (97406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47086 states to 47086 states and 97406 transitions. [2022-12-14 05:02:50,129 INFO L78 Accepts]: Start accepts. Automaton has 47086 states and 97406 transitions. Word has length 18 [2022-12-14 05:02:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:02:50,130 INFO L495 AbstractCegarLoop]: Abstraction has 47086 states and 97406 transitions. [2022-12-14 05:02:50,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-12-14 05:02:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 47086 states and 97406 transitions. [2022-12-14 05:02:50,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 05:02:50,130 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:02:50,130 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:02:50,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 05:02:50,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 05:02:50,332 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting worker_fnErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-14 05:02:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:02:50,333 INFO L85 PathProgramCache]: Analyzing trace with hash 574767790, now seen corresponding path program 1 times [2022-12-14 05:02:50,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:02:50,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737948343] [2022-12-14 05:02:50,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:02:50,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:02:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:02:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:02:50,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:02:50,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737948343] [2022-12-14 05:02:50,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737948343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:02:50,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:02:50,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:02:50,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676555819] [2022-12-14 05:02:50,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:02:50,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:02:50,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:02:50,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:02:50,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:02:50,464 INFO L87 Difference]: Start difference. First operand 47086 states and 97406 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-12-14 05:02:51,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:02:51,971 INFO L93 Difference]: Finished difference Result 48121 states and 99516 transitions. [2022-12-14 05:02:51,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:02:51,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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 18 [2022-12-14 05:02:51,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:02:52,051 INFO L225 Difference]: With dead ends: 48121 [2022-12-14 05:02:52,051 INFO L226 Difference]: Without dead ends: 48121 [2022-12-14 05:02:52,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:02:52,052 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 135 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:02:52,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 333 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 05:02:52,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48121 states. [2022-12-14 05:02:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48121 to 47279. [2022-12-14 05:02:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47279 states, 45919 states have (on average 2.129837322241338) internal successors, (97800), 47278 states have internal predecessors, (97800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:52,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47279 states to 47279 states and 97800 transitions. [2022-12-14 05:02:52,847 INFO L78 Accepts]: Start accepts. Automaton has 47279 states and 97800 transitions. Word has length 18 [2022-12-14 05:02:52,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:02:52,847 INFO L495 AbstractCegarLoop]: Abstraction has 47279 states and 97800 transitions. [2022-12-14 05:02:52,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-12-14 05:02:52,847 INFO L276 IsEmpty]: Start isEmpty. Operand 47279 states and 97800 transitions. [2022-12-14 05:02:52,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 05:02:52,848 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:02:52,848 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:02:52,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 05:02:52,848 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-14 05:02:52,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:02:52,849 INFO L85 PathProgramCache]: Analyzing trace with hash -814785275, now seen corresponding path program 1 times [2022-12-14 05:02:52,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:02:52,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289954668] [2022-12-14 05:02:52,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:02:52,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:02:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:02:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 05:02:52,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:02:52,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289954668] [2022-12-14 05:02:52,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289954668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:02:52,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:02:52,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:02:52,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295407072] [2022-12-14 05:02:52,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:02:52,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:02:52,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:02:52,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:02:52,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:02:52,927 INFO L87 Difference]: Start difference. First operand 47279 states and 97800 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-12-14 05:02:54,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:02:54,698 INFO L93 Difference]: Finished difference Result 48228 states and 99733 transitions. [2022-12-14 05:02:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:02:54,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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 19 [2022-12-14 05:02:54,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:02:54,780 INFO L225 Difference]: With dead ends: 48228 [2022-12-14 05:02:54,781 INFO L226 Difference]: Without dead ends: 48228 [2022-12-14 05:02:54,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:02:54,781 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 123 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 05:02:54,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 330 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 05:02:54,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48228 states. [2022-12-14 05:02:55,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48228 to 47454. [2022-12-14 05:02:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47454 states, 46097 states have (on average 2.1293576588498166) internal successors, (98157), 47453 states have internal predecessors, (98157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:02:55,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47454 states to 47454 states and 98157 transitions. [2022-12-14 05:02:55,455 INFO L78 Accepts]: Start accepts. Automaton has 47454 states and 98157 transitions. Word has length 19 [2022-12-14 05:02:55,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:02:55,455 INFO L495 AbstractCegarLoop]: Abstraction has 47454 states and 98157 transitions. [2022-12-14 05:02:55,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-12-14 05:02:55,456 INFO L276 IsEmpty]: Start isEmpty. Operand 47454 states and 98157 transitions. [2022-12-14 05:02:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 05:02:55,456 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:02:55,456 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] [2022-12-14 05:02:55,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 05:02:55,457 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-14 05:02:55,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:02:55,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1003390513, now seen corresponding path program 1 times [2022-12-14 05:02:55,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:02:55,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291120489] [2022-12-14 05:02:55,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:02:55,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:02:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:02:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:02:56,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:02:56,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291120489] [2022-12-14 05:02:56,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291120489] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:02:56,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295488150] [2022-12-14 05:02:56,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:02:56,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:02:56,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:02:56,537 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:02:56,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 05:02:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:02:56,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-14 05:02:56,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:02:56,747 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 05:02:56,747 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 19 treesize of output 19 [2022-12-14 05:02:56,931 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:02:56,975 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 22 [2022-12-14 05:02:57,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:02:57,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:02:57,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-12-14 05:02:57,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:02:57,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:02:57,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-12-14 05:02:57,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-12-14 05:02:57,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:02:57,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:02:57,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:02:57,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-12-14 05:02:57,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:02:57,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:02:57,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:02:57,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-12-14 05:02:57,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:02:57,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:02:57,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:02:57,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:02:57,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:02:57,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:02:57,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:02:57,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:02:57,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-12-14 05:02:57,302 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 57 treesize of output 49 [2022-12-14 05:02:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:02:57,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:02:57,485 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_2340 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_2340) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2340 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_2340) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2340 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_2340) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2340 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_2340) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) is different from false [2022-12-14 05:03:00,730 INFO L321 Elim1Store]: treesize reduction 533, result has 25.5 percent of original size [2022-12-14 05:03:00,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 479 treesize of output 220 [2022-12-14 05:03:00,854 INFO L321 Elim1Store]: treesize reduction 90, result has 55.2 percent of original size [2022-12-14 05:03:00,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 207 treesize of output 263 [2022-12-14 05:03:00,861 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 7 treesize of output 3 [2022-12-14 05:03:01,164 INFO L321 Elim1Store]: treesize reduction 609, result has 14.8 percent of original size [2022-12-14 05:03:01,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 479 treesize of output 144 [2022-12-14 05:03:01,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:03:01,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:01,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:03:01,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:03:01,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:03:01,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:03:01,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:03:01,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:03:01,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:03:01,189 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 05:03:01,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 58 [2022-12-14 05:03:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:03:01,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295488150] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:03:01,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [856445666] [2022-12-14 05:03:01,709 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-12-14 05:03:01,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:03:01,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 15] total 38 [2022-12-14 05:03:01,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644926241] [2022-12-14 05:03:01,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:03:01,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-14 05:03:01,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:03:01,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-14 05:03:01,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1280, Unknown=24, NotChecked=74, Total=1560 [2022-12-14 05:03:01,710 INFO L87 Difference]: Start difference. First operand 47454 states and 98157 transitions. Second operand has 40 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 39 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:03:08,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:03:11,922 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-12-14 05:03:13,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:04:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:04:08,127 INFO L93 Difference]: Finished difference Result 110679 states and 228861 transitions. [2022-12-14 05:04:08,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 05:04:08,127 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 39 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 05:04:08,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:04:08,344 INFO L225 Difference]: With dead ends: 110679 [2022-12-14 05:04:08,344 INFO L226 Difference]: Without dead ends: 110679 [2022-12-14 05:04:08,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=537, Invalid=2521, Unknown=26, NotChecked=108, Total=3192 [2022-12-14 05:04:08,346 INFO L413 NwaCegarLoop]: 533 mSDtfsCounter, 9097 mSDsluCounter, 3511 mSDsCounter, 0 mSdLazyCounter, 21771 mSolverCounterSat, 1453 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9097 SdHoareTripleChecker+Valid, 4044 SdHoareTripleChecker+Invalid, 25452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1453 IncrementalHoareTripleChecker+Valid, 21771 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 2227 IncrementalHoareTripleChecker+Unchecked, 64.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:04:08,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9097 Valid, 4044 Invalid, 25452 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1453 Valid, 21771 Invalid, 1 Unknown, 2227 Unchecked, 64.1s Time] [2022-12-14 05:04:08,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110679 states. [2022-12-14 05:04:09,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110679 to 47489. [2022-12-14 05:04:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47489 states, 46132 states have (on average 2.1292595161709875) internal successors, (98227), 47488 states have internal predecessors, (98227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:04:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47489 states to 47489 states and 98227 transitions. [2022-12-14 05:04:09,378 INFO L78 Accepts]: Start accepts. Automaton has 47489 states and 98227 transitions. Word has length 21 [2022-12-14 05:04:09,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:04:09,378 INFO L495 AbstractCegarLoop]: Abstraction has 47489 states and 98227 transitions. [2022-12-14 05:04:09,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 39 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:04:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 47489 states and 98227 transitions. [2022-12-14 05:04:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 05:04:09,379 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:04:09,379 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] [2022-12-14 05:04:09,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 05:04:09,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 05:04:09,581 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-14 05:04:09,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:04:09,582 INFO L85 PathProgramCache]: Analyzing trace with hash 507260505, now seen corresponding path program 1 times [2022-12-14 05:04:09,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:04:09,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763491787] [2022-12-14 05:04:09,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:04:09,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:04:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:04:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:04:10,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:04:10,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763491787] [2022-12-14 05:04:10,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763491787] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:04:10,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357789653] [2022-12-14 05:04:10,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:04:10,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:04:10,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:04:10,479 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:04:10,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45225fda-4c8d-4408-8857-4702940b4443/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 05:04:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:04:10,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-14 05:04:10,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:04:10,689 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 05:04:10,690 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 24 treesize of output 26 [2022-12-14 05:04:10,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:04:10,856 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 22 [2022-12-14 05:04:10,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:04:10,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:04:10,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-12-14 05:04:10,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-12-14 05:04:10,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-12-14 05:04:11,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:04:11,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:04:11,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:04:11,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:04:11,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-12-14 05:04:17,152 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 61 treesize of output 53 [2022-12-14 05:04:23,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:04:23,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:04:23,232 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) 0))) is different from false [2022-12-14 05:04:26,407 INFO L321 Elim1Store]: treesize reduction 249, result has 24.8 percent of original size [2022-12-14 05:04:26,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 257 treesize of output 138 [2022-12-14 05:04:26,435 INFO L321 Elim1Store]: treesize reduction 97, result has 4.0 percent of original size [2022-12-14 05:04:26,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 107 treesize of output 69 [2022-12-14 05:04:26,455 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 7 treesize of output 3 [2022-12-14 05:04:26,490 INFO L321 Elim1Store]: treesize reduction 330, result has 0.3 percent of original size [2022-12-14 05:04:26,490 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 6 case distinctions, treesize of input 257 treesize of output 1 [2022-12-14 05:04:26,521 INFO L321 Elim1Store]: treesize reduction 330, result has 0.3 percent of original size [2022-12-14 05:04:26,522 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 6 case distinctions, treesize of input 257 treesize of output 1 [2022-12-14 05:04:26,550 INFO L321 Elim1Store]: treesize reduction 330, result has 0.3 percent of original size [2022-12-14 05:04:26,550 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 6 case distinctions, treesize of input 257 treesize of output 1 [2022-12-14 05:04:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 05:04:26,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357789653] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 05:04:26,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:04:26,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 12] total 33 [2022-12-14 05:04:26,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85694561] [2022-12-14 05:04:26,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:04:26,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 05:04:26,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:04:26,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 05:04:26,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=898, Unknown=27, NotChecked=64, Total=1190 [2022-12-14 05:04:26,687 INFO L87 Difference]: Start difference. First operand 47489 states and 98227 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:04:31,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:04:44,598 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-12-14 05:04:50,069 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-12-14 05:04:54,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:04:57,862 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-12-14 05:05:00,117 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-12-14 05:05:04,206 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-12-14 05:05:08,443 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-12-14 05:05:10,580 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9))) (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store .cse9 .cse3 0)))) (let ((.cse6 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) (.cse14 (select .cse13 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse8 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) (.cse4 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) (.cse18 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse1 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store .cse9 .cse5 0) .cse4 0)))) (let ((.cse0 (select .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (not (= (select .cse0 .cse1) 0)) (let ((.cse2 (store .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse0 .cse8 0)))) (and (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store .cse2 |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store .cse2 |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= 0 (select (select (store .cse2 |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5))) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store .cse2 |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse6) 0))))))) (forall ((v_ArrVal_2655 Int)) (let ((.cse11 (let ((.cse12 (store .cse13 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse14 .cse1 v_ArrVal_2655)))) (store .cse12 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse4 0))))) (let ((.cse10 (select .cse11 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (not (= (select .cse10 .cse1) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse11 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse10 .cse8 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse6) 0)))))) (forall ((v_ArrVal_2655 Int)) (let ((.cse16 (let ((.cse17 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse18 .cse1 v_ArrVal_2655)))) (store .cse17 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse17 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse4 0))))) (let ((.cse15 (select .cse16 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (not (= (select .cse15 .cse1) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse16 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse15 .cse8 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse3) 0)))))) (forall ((v_ArrVal_2655 Int)) (let ((.cse20 (let ((.cse21 (store .cse13 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse14 .cse1 v_ArrVal_2655)))) (store .cse21 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse21 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse4 0))))) (let ((.cse19 (select .cse20 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (not (= (select .cse19 .cse1) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse20 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse19 .cse8 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5) 0)))))) (forall ((v_ArrVal_2655 Int)) (let ((.cse23 (let ((.cse24 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse18 .cse1 v_ArrVal_2655)))) (store .cse24 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse24 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse4 0))))) (let ((.cse22 (select .cse23 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (not (= (select .cse22 .cse1) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse23 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse22 .cse8 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse4) 0)))))) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_~#pre~0.base|)) (forall ((v_ArrVal_2655 Int)) (let ((.cse25 (let ((.cse27 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse18 .cse1 v_ArrVal_2655)))) (store .cse27 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse4 0))))) (let ((.cse26 (select .cse25 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse25 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse26 .cse8 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse6) 0)) (not (= (select .cse26 .cse1) 0)))))) (forall ((v_ArrVal_2655 Int)) (let ((.cse28 (let ((.cse30 (store .cse13 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse14 .cse1 v_ArrVal_2655)))) (store .cse30 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse4 0))))) (let ((.cse29 (select .cse28 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse28 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse29 .cse8 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse3) 0)) (not (= (select .cse29 .cse1) 0)))))) (forall ((v_ArrVal_2655 Int)) (let ((.cse31 (let ((.cse33 (store .cse13 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse14 .cse1 v_ArrVal_2655)))) (store .cse33 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse33 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse4 0))))) (let ((.cse32 (select .cse31 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse31 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse32 .cse8 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse4) 0)) (not (= (select .cse32 .cse1) 0)))))) (forall ((v_ArrVal_2655 Int)) (let ((.cse34 (let ((.cse36 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse18 .cse1 v_ArrVal_2655)))) (store .cse36 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse36 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse4 0))))) (let ((.cse35 (select .cse34 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse34 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse35 .cse8 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5) 0)) (not (= (select .cse35 .cse1) 0)))))))))) is different from false [2022-12-14 05:05:13,689 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-12-14 05:05:16,625 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-12-14 05:05:22,140 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-12-14 05:05:25,701 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9))) (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store .cse9 .cse3 0)))) (let ((.cse6 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) (.cse14 (select .cse13 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse8 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) (.cse4 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) (.cse18 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse1 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store .cse9 .cse5 0) .cse4 0)))) (let ((.cse0 (select .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (not (= (select .cse0 .cse1) 0)) (let ((.cse2 (store .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse0 .cse8 0)))) (and (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store .cse2 |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store .cse2 |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= 0 (select (select (store .cse2 |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5))) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store .cse2 |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse6) 0))))))) (forall ((v_ArrVal_2655 Int)) (let ((.cse11 (let ((.cse12 (store .cse13 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse14 .cse1 v_ArrVal_2655)))) (store .cse12 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse4 0))))) (let ((.cse10 (select .cse11 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (not (= (select .cse10 .cse1) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse11 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse10 .cse8 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse6) 0)))))) (forall ((v_ArrVal_2655 Int)) (let ((.cse16 (let ((.cse17 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse18 .cse1 v_ArrVal_2655)))) (store .cse17 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse17 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse4 0))))) (let ((.cse15 (select .cse16 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (not (= (select .cse15 .cse1) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse16 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse15 .cse8 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse3) 0)))))) (forall ((v_ArrVal_2655 Int)) (let ((.cse20 (let ((.cse21 (store .cse13 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse14 .cse1 v_ArrVal_2655)))) (store .cse21 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse21 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse4 0))))) (let ((.cse19 (select .cse20 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (not (= (select .cse19 .cse1) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse20 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse19 .cse8 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5) 0)))))) (let ((.cse23 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store .cse9 .cse4 0)))) (let ((.cse24 (select .cse23 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (let ((.cse22 (store .cse23 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse24 .cse8 0)))) (and (forall ((v_ArrVal_2662 (Array Int Int))) (= 0 (select (select (store .cse22 |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse4))) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store .cse22 |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse6) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store .cse22 |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store .cse22 |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse3) 0)))) (not (= (select .cse24 .cse1) 0))))) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse6) 0)) (forall ((v_ArrVal_2655 Int)) (let ((.cse26 (let ((.cse27 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse18 .cse1 v_ArrVal_2655)))) (store .cse27 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse4 0))))) (let ((.cse25 (select .cse26 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (not (= (select .cse25 .cse1) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse26 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse25 .cse8 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse4) 0)))))) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_~#pre~0.base|)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_2655 Int)) (let ((.cse28 (let ((.cse30 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse18 .cse1 v_ArrVal_2655)))) (store .cse30 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse4 0))))) (let ((.cse29 (select .cse28 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse28 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse29 .cse8 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse6) 0)) (not (= (select .cse29 .cse1) 0)))))) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_2655 Int)) (let ((.cse31 (let ((.cse33 (store .cse13 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse14 .cse1 v_ArrVal_2655)))) (store .cse33 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse33 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse4 0))))) (let ((.cse32 (select .cse31 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse31 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse32 .cse8 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse3) 0)) (not (= (select .cse32 .cse1) 0)))))) (forall ((v_ArrVal_2655 Int)) (let ((.cse34 (let ((.cse36 (store .cse13 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse14 .cse1 v_ArrVal_2655)))) (store .cse36 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse36 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse4 0))))) (let ((.cse35 (select .cse34 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse34 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse35 .cse8 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse4) 0)) (not (= (select .cse35 .cse1) 0)))))) (forall ((v_ArrVal_2655 Int)) (let ((.cse37 (let ((.cse39 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse18 .cse1 v_ArrVal_2655)))) (store .cse39 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse39 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse4 0))))) (let ((.cse38 (select .cse37 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse37 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse38 .cse8 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5) 0)) (not (= (select .cse38 .cse1) 0)))))))))) is different from false [2022-12-14 05:05:37,948 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-12-14 05:05:40,131 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-12-14 05:05:42,194 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-12-14 05:05:52,167 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-12-14 05:05:59,619 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-12-14 05:06:01,627 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-12-14 05:06:10,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:06:13,264 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-12-14 05:06:17,524 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-12-14 05:06:19,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:06:22,241 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-12-14 05:06:37,076 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-12-14 05:06:39,290 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-12-14 05:06:41,416 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-12-14 05:06:43,962 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-12-14 05:06:47,527 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-12-14 05:06:51,250 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-12-14 05:06:53,517 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-12-14 05:06:56,127 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-12-14 05:07:00,394 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-12-14 05:07:04,559 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-12-14 05:07:07,577 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-12-14 05:07:09,663 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-12-14 05:07:11,791 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-12-14 05:07:14,863 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-12-14 05:07:16,997 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-12-14 05:07:20,284 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-12-14 05:07:24,696 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-12-14 05:07:26,870 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-12-14 05:07:29,076 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-12-14 05:07:32,677 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-12-14 05:07:34,733 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-12-14 05:07:37,353 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-12-14 05:07:39,866 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-12-14 05:07:42,216 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-12-14 05:07:44,408 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-12-14 05:07:46,573 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-12-14 05:07:50,562 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-12-14 05:07:52,705 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-12-14 05:08:02,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:08:05,738 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-12-14 05:08:16,325 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-12-14 05:08:19,979 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-12-14 05:08:22,068 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-12-14 05:08:23,127 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) (.cse6 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) (.cse7 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse1 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (forall ((v_ArrVal_2655 Int)) (let ((.cse2 (let ((.cse4 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse7 .cse1 v_ArrVal_2655)))) (store .cse4 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse6 0))))) (let ((.cse0 (select .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (not (= (select .cse0 .cse1) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse0 .cse3 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)))))) (forall ((v_ArrVal_2655 Int)) (let ((.cse9 (let ((.cse10 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse7 .cse1 v_ArrVal_2655)))) (store .cse10 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse6 0))))) (let ((.cse8 (select .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (not (= (select .cse8 .cse1) 0)) (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse8 .cse3 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse6) 0)))))) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_~#pre~0.base|)) (forall ((v_ArrVal_2655 Int)) (let ((.cse11 (let ((.cse13 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse7 .cse1 v_ArrVal_2655)))) (store .cse13 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse6 0))))) (let ((.cse12 (select .cse11 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse11 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse12 .cse3 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)) (not (= (select .cse12 .cse1) 0)))))) (forall ((v_ArrVal_2655 Int)) (let ((.cse14 (let ((.cse16 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse7 .cse1 v_ArrVal_2655)))) (store .cse16 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse16 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5 0) .cse6 0))))) (let ((.cse15 (select .cse14 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (forall ((v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store .cse14 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse15 .cse3 0)) |c_~#pre~0.base| v_ArrVal_2662) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse5) 0)) (not (= (select .cse15 .cse1) 0)))))))) is different from false [2022-12-14 05:08:26,135 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-12-14 05:08:28,237 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-12-14 05:08:30,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:08:34,277 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-12-14 05:08:38,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:08:41,197 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-12-14 05:08:47,976 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-12-14 05:08:50,179 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-12-14 05:08:54,456 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-12-14 05:08:56,507 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-12-14 05:09:01,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:09:03,195 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-12-14 05:09:05,276 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-12-14 05:09:07,479 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-12-14 05:09:09,615 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-12-14 05:09:14,221 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-12-14 05:09:18,119 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-12-14 05:09:20,285 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-12-14 05:09:24,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:09:27,498 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-12-14 05:09:32,566 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-12-14 05:09:34,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:09:40,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:09:42,544 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-12-14 05:09:45,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:09:52,293 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-12-14 05:09:54,429 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-12-14 05:09:56,475 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-12-14 05:09:58,518 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-12-14 05:10:01,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:10:04,367 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-12-14 05:10:07,714 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-12-14 05:10:10,658 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-12-14 05:10:13,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:10:15,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:10:18,179 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-12-14 05:10:24,597 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-12-14 05:10:30,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:10:33,043 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-12-14 05:10:36,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:10:39,051 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-12-14 05:10:41,157 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-12-14 05:10:45,328 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-12-14 05:10:53,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:10:55,288 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-12-14 05:10:59,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:11:01,664 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-12-14 05:11:06,111 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-12-14 05:11:08,263 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-12-14 05:11:22,178 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-12-14 05:11:25,544 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-12-14 05:11:27,674 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-12-14 05:11:30,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:11:32,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]