./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 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/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_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9 --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-6b4ec56 [2022-11-20 20:04:14,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:04:14,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:04:14,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:04:14,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:04:14,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:04:14,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:04:14,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:04:14,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:04:14,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:04:14,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:04:14,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:04:14,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:04:14,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:04:14,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:04:14,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:04:14,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:04:14,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:04:14,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:04:14,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:04:14,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:04:14,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:04:14,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:04:14,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:04:14,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:04:14,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:04:14,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:04:14,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:04:14,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:04:14,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:04:14,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:04:14,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:04:14,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:04:14,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:04:14,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:04:14,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:04:14,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:04:14,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:04:14,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:04:14,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:04:14,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:04:14,402 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-20 20:04:14,431 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:04:14,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:04:14,433 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:04:14,433 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:04:14,434 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:04:14,434 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:04:14,435 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:04:14,435 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:04:14,436 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:04:14,436 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 20:04:14,437 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:04:14,437 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:04:14,438 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 20:04:14,438 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 20:04:14,438 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:04:14,439 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 20:04:14,439 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 20:04:14,440 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 20:04:14,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:04:14,441 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:04:14,442 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 20:04:14,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:04:14,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:04:14,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:04:14,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 20:04:14,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:04:14,445 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 20:04:14,445 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-20 20:04:14,445 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:04:14,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 20:04:14,446 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:04:14,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 20:04:14,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:04:14,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:04:14,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:04:14,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:04:14,449 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 20:04:14,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:04:14,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 20:04:14,450 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 20:04:14,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 20:04:14,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 20:04:14,451 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:04:14,451 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_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/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_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9 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-11-20 20:04:14,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:04:14,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:04:14,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:04:14,829 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:04:14,829 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:04:14,832 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i [2022-11-20 20:04:18,393 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:04:18,655 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:04:18,656 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i [2022-11-20 20:04:18,670 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/data/6f82228be/05ddb7082a5949f2b2d1b4670062c7db/FLAGce4d0f9bc [2022-11-20 20:04:18,703 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/data/6f82228be/05ddb7082a5949f2b2d1b4670062c7db [2022-11-20 20:04:18,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:04:18,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:04:18,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:04:18,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:04:18,723 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:04:18,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:04:18" (1/1) ... [2022-11-20 20:04:18,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373758fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:18, skipping insertion in model container [2022-11-20 20:04:18,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:04:18" (1/1) ... [2022-11-20 20:04:18,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:04:18,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:04:19,026 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-20 20:04:19,254 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30448,30461] [2022-11-20 20:04:19,287 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30811,30824] [2022-11-20 20:04:19,317 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31483,31496] [2022-11-20 20:04:19,318 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31534,31547] [2022-11-20 20:04:19,332 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31683,31696] [2022-11-20 20:04:19,334 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31760,31773] [2022-11-20 20:04:19,335 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31807,31820] [2022-11-20 20:04:19,338 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31916,31929] [2022-11-20 20:04:19,340 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32035,32048] [2022-11-20 20:04:19,342 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32083,32096] [2022-11-20 20:04:19,343 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32160,32173] [2022-11-20 20:04:19,345 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32286,32299] [2022-11-20 20:04:19,358 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32897,32910] [2022-11-20 20:04:19,359 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32974,32987] [2022-11-20 20:04:19,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:04:19,375 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:04:19,393 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-20 20:04:19,439 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30448,30461] [2022-11-20 20:04:19,444 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30811,30824] [2022-11-20 20:04:19,456 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31483,31496] [2022-11-20 20:04:19,469 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31534,31547] [2022-11-20 20:04:19,475 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31683,31696] [2022-11-20 20:04:19,479 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31760,31773] [2022-11-20 20:04:19,481 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31807,31820] [2022-11-20 20:04:19,487 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31916,31929] [2022-11-20 20:04:19,495 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32035,32048] [2022-11-20 20:04:19,497 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32083,32096] [2022-11-20 20:04:19,498 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32160,32173] [2022-11-20 20:04:19,500 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32286,32299] [2022-11-20 20:04:19,511 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32897,32910] [2022-11-20 20:04:19,512 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_c959cef5-95fd-451d-a99d-d81ac76926cf/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32974,32987] [2022-11-20 20:04:19,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:04:19,579 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:04:19,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:19 WrapperNode [2022-11-20 20:04:19,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:04:19,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:04:19,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:04:19,582 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:04:19,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:19" (1/1) ... [2022-11-20 20:04:19,619 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:19" (1/1) ... [2022-11-20 20:04:19,713 INFO L138 Inliner]: procedures = 174, calls = 73, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 805 [2022-11-20 20:04:19,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:04:19,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:04:19,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:04:19,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:04:19,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:19" (1/1) ... [2022-11-20 20:04:19,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:19" (1/1) ... [2022-11-20 20:04:19,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:19" (1/1) ... [2022-11-20 20:04:19,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:19" (1/1) ... [2022-11-20 20:04:19,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:19" (1/1) ... [2022-11-20 20:04:19,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:19" (1/1) ... [2022-11-20 20:04:19,833 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:19" (1/1) ... [2022-11-20 20:04:19,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:19" (1/1) ... [2022-11-20 20:04:19,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:04:19,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:04:19,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:04:19,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:04:19,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:19" (1/1) ... [2022-11-20 20:04:19,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:04:19,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:04:19,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:04:19,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:04:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 20:04:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 20:04:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 20:04:20,036 INFO L130 BoogieDeclarations]: Found specification of procedure worker_fn [2022-11-20 20:04:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure worker_fn [2022-11-20 20:04:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:04:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 20:04:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 20:04:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 20:04:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 20:04:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 20:04:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:04:20,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:04:20,042 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 20:04:20,318 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:04:20,320 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:04:22,104 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:04:22,153 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:04:22,153 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-11-20 20:04:22,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:04:22 BoogieIcfgContainer [2022-11-20 20:04:22,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:04:22,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:04:22,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:04:22,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:04:22,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:04:18" (1/3) ... [2022-11-20 20:04:22,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c0bc8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:04:22, skipping insertion in model container [2022-11-20 20:04:22,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:19" (2/3) ... [2022-11-20 20:04:22,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c0bc8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:04:22, skipping insertion in model container [2022-11-20 20:04:22,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:04:22" (3/3) ... [2022-11-20 20:04:22,179 INFO L112 eAbstractionObserver]: Analyzing ICFG one_time_barrier_twice_2t.i [2022-11-20 20:04:22,193 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 20:04:22,208 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:04:22,209 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2022-11-20 20:04:22,209 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 20:04:22,539 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-20 20:04:22,627 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 20:04:22,663 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 868 places, 928 transitions, 1864 flow [2022-11-20 20:04:22,670 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 868 places, 928 transitions, 1864 flow [2022-11-20 20:04:22,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 868 places, 928 transitions, 1864 flow [2022-11-20 20:04:23,625 INFO L130 PetriNetUnfolder]: 95/1352 cut-off events. [2022-11-20 20:04:23,625 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-20 20:04:23,679 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 4534 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-11-20 20:04:23,879 INFO L119 LiptonReduction]: Number of co-enabled transitions 313900 [2022-11-20 20:05:25,474 WARN L233 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 109 DAG size of output: 105 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:05:35,156 WARN L233 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 115 DAG size of output: 109 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:06:31,863 WARN L233 SmtUtils]: Spent 41.71s on a formula simplification. DAG size of input: 155 DAG size of output: 154 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:06:49,055 WARN L233 SmtUtils]: Spent 17.19s on a formula simplification that was a NOOP. DAG size: 148 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:07:29,800 WARN L233 SmtUtils]: Spent 40.74s on a formula simplification. DAG size of input: 158 DAG size of output: 157 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:07:45,587 WARN L233 SmtUtils]: Spent 15.79s on a formula simplification that was a NOOP. DAG size: 151 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:09:26,361 WARN L233 SmtUtils]: Spent 1.67m on a formula simplification. DAG size of input: 185 DAG size of output: 183 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:09:57,236 WARN L233 SmtUtils]: Spent 30.87s on a formula simplification that was a NOOP. DAG size: 163 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:12:05,304 WARN L233 SmtUtils]: Spent 2.13m on a formula simplification. DAG size of input: 197 DAG size of output: 193 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:12:41,070 WARN L233 SmtUtils]: Spent 35.76s on a formula simplification that was a NOOP. DAG size: 172 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:13:09,209 WARN L233 SmtUtils]: Spent 27.75s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:13:40,071 WARN L233 SmtUtils]: Spent 30.86s 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-11-20 20:14:19,430 WARN L233 SmtUtils]: Spent 39.36s on a formula simplification that was a NOOP. DAG size: 174 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:14:58,045 WARN L233 SmtUtils]: Spent 38.61s 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-11-20 20:15:04,919 INFO L134 LiptonReduction]: Checked pairs total: 5629627 [2022-11-20 20:15:04,920 INFO L136 LiptonReduction]: Total number of compositions: 705 [2022-11-20 20:15:04,932 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 439 places, 475 transitions, 958 flow [2022-11-20 20:15:06,448 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 45722 states, 44278 states have (on average 2.229052802746285) internal successors, (98698), 45721 states have internal predecessors, (98698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:15:06,509 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:15:06,518 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;@166f5385, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:15:06,537 INFO L358 AbstractCegarLoop]: Starting to check reachability of 113 error locations. [2022-11-20 20:15:06,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 45722 states, 44278 states have (on average 2.229052802746285) internal successors, (98698), 45721 states have internal predecessors, (98698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:15:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 20:15:06,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:15:06,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 20:15:06,756 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-11-20 20:15:06,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:15:06,779 INFO L85 PathProgramCache]: Analyzing trace with hash 100943, now seen corresponding path program 1 times [2022-11-20 20:15:06,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:15:06,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893568985] [2022-11-20 20:15:06,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:15:06,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:15:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:15:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:15:07,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:15:07,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893568985] [2022-11-20 20:15:07,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893568985] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:15:07,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:15:07,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 20:15:07,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001579329] [2022-11-20 20:15:07,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:15:07,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 20:15:07,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:15:07,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 20:15:07,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 20:15:07,456 INFO L87 Difference]: Start difference. First operand has 45722 states, 44278 states have (on average 2.229052802746285) internal successors, (98698), 45721 states have internal predecessors, (98698), 0 states have call successors, (0), 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-11-20 20:15:09,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:15:09,931 INFO L93 Difference]: Finished difference Result 45715 states and 94411 transitions. [2022-11-20 20:15:09,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 20:15:09,934 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-11-20 20:15:09,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:15:10,250 INFO L225 Difference]: With dead ends: 45715 [2022-11-20 20:15:10,251 INFO L226 Difference]: Without dead ends: 45713 [2022-11-20 20:15:10,252 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-11-20 20:15:10,348 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-20 20:15:10,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-20 20:15:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45713 states. [2022-11-20 20:15:12,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45713 to 45713. [2022-11-20 20:15:12,904 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-11-20 20:15:13,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45713 states to 45713 states and 94408 transitions. [2022-11-20 20:15:13,321 INFO L78 Accepts]: Start accepts. Automaton has 45713 states and 94408 transitions. Word has length 2 [2022-11-20 20:15:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:15:13,322 INFO L495 AbstractCegarLoop]: Abstraction has 45713 states and 94408 transitions. [2022-11-20 20:15:13,322 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-11-20 20:15:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 45713 states and 94408 transitions. [2022-11-20 20:15:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 20:15:13,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:15:13,324 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-11-20 20:15:13,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 20:15:13,325 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-11-20 20:15:13,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:15:13,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1856443043, now seen corresponding path program 1 times [2022-11-20 20:15:13,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:15:13,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923481492] [2022-11-20 20:15:13,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:15:13,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:15:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:15:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 20:15:13,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:15:13,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923481492] [2022-11-20 20:15:13,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923481492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:15:13,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:15:13,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:15:13,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492079528] [2022-11-20 20:15:13,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:15:13,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:15:13,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:15:13,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:15:13,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:15:13,775 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-11-20 20:15:16,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:15:16,219 INFO L93 Difference]: Finished difference Result 45714 states and 94409 transitions. [2022-11-20 20:15:16,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:15:16,220 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-11-20 20:15:16,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:15:16,421 INFO L225 Difference]: With dead ends: 45714 [2022-11-20 20:15:16,422 INFO L226 Difference]: Without dead ends: 45714 [2022-11-20 20:15:16,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:15:16,423 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 20:15:16,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-20 20:15:16,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45714 states. [2022-11-20 20:15:17,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45714 to 45714. [2022-11-20 20:15:17,915 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-11-20 20:15:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45714 states to 45714 states and 94409 transitions. [2022-11-20 20:15:18,347 INFO L78 Accepts]: Start accepts. Automaton has 45714 states and 94409 transitions. Word has length 7 [2022-11-20 20:15:18,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:15:18,348 INFO L495 AbstractCegarLoop]: Abstraction has 45714 states and 94409 transitions. [2022-11-20 20:15:18,348 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-11-20 20:15:18,348 INFO L276 IsEmpty]: Start isEmpty. Operand 45714 states and 94409 transitions. [2022-11-20 20:15:18,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 20:15:18,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:15:18,349 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-20 20:15:18,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 20:15:18,350 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-11-20 20:15:18,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:15:18,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1846733072, now seen corresponding path program 1 times [2022-11-20 20:15:18,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:15:18,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453864146] [2022-11-20 20:15:18,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:15:18,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:15:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:15:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 20:15:18,563 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:15:18,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453864146] [2022-11-20 20:15:18,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453864146] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:15:18,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075091865] [2022-11-20 20:15:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:15:18,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:15:18,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:15:18,569 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:15:18,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 20:15:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:15:18,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 20:15:18,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:15:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 20:15:18,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:15:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 20:15:18,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075091865] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:15:18,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [356612289] [2022-11-20 20:15:18,976 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:15:18,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:15:18,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-11-20 20:15:18,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334188907] [2022-11-20 20:15:18,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:15:18,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:15:18,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:15:18,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:15:18,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:15:18,983 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-11-20 20:15:21,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:15:21,744 INFO L93 Difference]: Finished difference Result 45715 states and 94410 transitions. [2022-11-20 20:15:21,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:15:21,745 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-11-20 20:15:21,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:15:21,969 INFO L225 Difference]: With dead ends: 45715 [2022-11-20 20:15:21,970 INFO L226 Difference]: Without dead ends: 45715 [2022-11-20 20:15:21,970 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-11-20 20:15:21,976 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:15:21,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-20 20:15:22,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45715 states. [2022-11-20 20:15:23,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45715 to 45715. [2022-11-20 20:15:23,513 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-11-20 20:15:23,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45715 states to 45715 states and 94410 transitions. [2022-11-20 20:15:23,709 INFO L78 Accepts]: Start accepts. Automaton has 45715 states and 94410 transitions. Word has length 8 [2022-11-20 20:15:23,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:15:23,709 INFO L495 AbstractCegarLoop]: Abstraction has 45715 states and 94410 transitions. [2022-11-20 20:15:23,710 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-11-20 20:15:23,710 INFO L276 IsEmpty]: Start isEmpty. Operand 45715 states and 94410 transitions. [2022-11-20 20:15:23,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 20:15:23,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:15:23,711 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-11-20 20:15:23,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 20:15:23,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:15:23,917 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-11-20 20:15:23,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:15:23,918 INFO L85 PathProgramCache]: Analyzing trace with hash 681075645, now seen corresponding path program 2 times [2022-11-20 20:15:23,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:15:23,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455926307] [2022-11-20 20:15:23,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:15:23,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:15:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:15:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:15:24,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:15:24,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455926307] [2022-11-20 20:15:24,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455926307] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:15:24,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415342174] [2022-11-20 20:15:24,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:15:24,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:15:24,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:15:24,149 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:15:24,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 20:15:25,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:15:25,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:15:25,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 20:15:25,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:15:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:15:25,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:15:25,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415342174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:15:25,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 20:15:25,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-11-20 20:15:25,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105190652] [2022-11-20 20:15:25,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:15:25,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:15:25,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:15:25,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:15:25,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:15:25,055 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-11-20 20:15:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:15:27,373 INFO L93 Difference]: Finished difference Result 45307 states and 93580 transitions. [2022-11-20 20:15:27,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:15:27,374 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-11-20 20:15:27,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:15:27,514 INFO L225 Difference]: With dead ends: 45307 [2022-11-20 20:15:27,515 INFO L226 Difference]: Without dead ends: 45307 [2022-11-20 20:15:27,515 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-11-20 20:15:27,516 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 651 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 20:15:27,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 572 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-20 20:15:27,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45307 states. [2022-11-20 20:15:28,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45307 to 45307. [2022-11-20 20:15:28,633 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-11-20 20:15:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45307 states to 45307 states and 93580 transitions. [2022-11-20 20:15:28,777 INFO L78 Accepts]: Start accepts. Automaton has 45307 states and 93580 transitions. Word has length 9 [2022-11-20 20:15:28,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:15:28,777 INFO L495 AbstractCegarLoop]: Abstraction has 45307 states and 93580 transitions. [2022-11-20 20:15:28,777 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-11-20 20:15:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 45307 states and 93580 transitions. [2022-11-20 20:15:28,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 20:15:28,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:15:28,779 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:15:28,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 20:15:28,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:15:28,987 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-11-20 20:15:28,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:15:28,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1513537412, now seen corresponding path program 1 times [2022-11-20 20:15:28,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:15:28,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068312806] [2022-11-20 20:15:28,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:15:28,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:15:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:15:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:15:29,404 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:15:29,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068312806] [2022-11-20 20:15:29,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068312806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:15:29,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:15:29,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:15:29,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995337736] [2022-11-20 20:15:29,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:15:29,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:15:29,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:15:29,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:15:29,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:15:29,407 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-11-20 20:15:30,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:15:30,691 INFO L93 Difference]: Finished difference Result 45105 states and 93369 transitions. [2022-11-20 20:15:30,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:15:30,692 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-11-20 20:15:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:15:30,789 INFO L225 Difference]: With dead ends: 45105 [2022-11-20 20:15:30,790 INFO L226 Difference]: Without dead ends: 45105 [2022-11-20 20:15:30,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:15:30,791 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 213 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:15:30,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 584 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 20:15:30,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45105 states. [2022-11-20 20:15:31,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45105 to 45105. [2022-11-20 20:15:31,814 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-11-20 20:15:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45105 states to 45105 states and 93369 transitions. [2022-11-20 20:15:31,914 INFO L78 Accepts]: Start accepts. Automaton has 45105 states and 93369 transitions. Word has length 10 [2022-11-20 20:15:31,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:15:31,914 INFO L495 AbstractCegarLoop]: Abstraction has 45105 states and 93369 transitions. [2022-11-20 20:15:31,914 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-11-20 20:15:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 45105 states and 93369 transitions. [2022-11-20 20:15:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 20:15:31,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:15:31,916 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:15:31,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 20:15:31,916 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-11-20 20:15:31,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:15:31,917 INFO L85 PathProgramCache]: Analyzing trace with hash 702481376, now seen corresponding path program 1 times [2022-11-20 20:15:31,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:15:31,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975565551] [2022-11-20 20:15:31,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:15:31,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:15:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:15:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:15:32,805 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:15:32,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975565551] [2022-11-20 20:15:32,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975565551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:15:32,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:15:32,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:15:32,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036584257] [2022-11-20 20:15:32,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:15:32,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:15:32,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:15:32,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:15:32,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:15:32,810 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-11-20 20:15:38,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:15:38,478 INFO L93 Difference]: Finished difference Result 46361 states and 95929 transitions. [2022-11-20 20:15:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:15:38,479 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-11-20 20:15:38,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:15:38,594 INFO L225 Difference]: With dead ends: 46361 [2022-11-20 20:15:38,595 INFO L226 Difference]: Without dead ends: 46361 [2022-11-20 20:15:38,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-20 20:15:38,596 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 532 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2786 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 3128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 2786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:15:38,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 438 Invalid, 3128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 2786 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-11-20 20:15:38,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46361 states. [2022-11-20 20:15:39,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46361 to 45939. [2022-11-20 20:15:39,704 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-11-20 20:15:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45939 states to 45939 states and 95069 transitions. [2022-11-20 20:15:39,807 INFO L78 Accepts]: Start accepts. Automaton has 45939 states and 95069 transitions. Word has length 12 [2022-11-20 20:15:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:15:39,807 INFO L495 AbstractCegarLoop]: Abstraction has 45939 states and 95069 transitions. [2022-11-20 20:15:39,808 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-11-20 20:15:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 45939 states and 95069 transitions. [2022-11-20 20:15:39,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 20:15:39,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:15:39,809 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:15:39,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 20:15:39,810 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-11-20 20:15:39,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:15:39,810 INFO L85 PathProgramCache]: Analyzing trace with hash 259291769, now seen corresponding path program 1 times [2022-11-20 20:15:39,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:15:39,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96368352] [2022-11-20 20:15:39,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:15:39,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:15:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:15:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:15:40,338 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:15:40,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96368352] [2022-11-20 20:15:40,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96368352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:15:40,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:15:40,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:15:40,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359029844] [2022-11-20 20:15:40,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:15:40,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:15:40,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:15:40,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:15:40,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:15:40,341 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-11-20 20:15:45,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:15:45,964 INFO L93 Difference]: Finished difference Result 47101 states and 97435 transitions. [2022-11-20 20:15:45,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:15:45,965 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-11-20 20:15:45,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:15:46,072 INFO L225 Difference]: With dead ends: 47101 [2022-11-20 20:15:46,072 INFO L226 Difference]: Without dead ends: 47101 [2022-11-20 20:15:46,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-20 20:15:46,073 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 480 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2660 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 2660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:15:46,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 413 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 2660 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-11-20 20:15:46,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47101 states. [2022-11-20 20:15:46,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47101 to 46711. [2022-11-20 20:15:46,958 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-11-20 20:15:47,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46711 states to 46711 states and 96641 transitions. [2022-11-20 20:15:47,083 INFO L78 Accepts]: Start accepts. Automaton has 46711 states and 96641 transitions. Word has length 13 [2022-11-20 20:15:47,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:15:47,083 INFO L495 AbstractCegarLoop]: Abstraction has 46711 states and 96641 transitions. [2022-11-20 20:15:47,083 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-11-20 20:15:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand 46711 states and 96641 transitions. [2022-11-20 20:15:47,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 20:15:47,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:15:47,085 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:15:47,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 20:15:47,085 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-11-20 20:15:47,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:15:47,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1730349245, now seen corresponding path program 1 times [2022-11-20 20:15:47,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:15:47,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453275575] [2022-11-20 20:15:47,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:15:47,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:15:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:15:47,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:15:47,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:15:47,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453275575] [2022-11-20 20:15:47,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453275575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:15:47,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:15:47,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:15:47,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289972898] [2022-11-20 20:15:47,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:15:47,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:15:47,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:15:47,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:15:47,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:15:47,259 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-11-20 20:15:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:15:50,179 INFO L93 Difference]: Finished difference Result 46924 states and 97075 transitions. [2022-11-20 20:15:50,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:15:50,180 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-11-20 20:15:50,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:15:50,286 INFO L225 Difference]: With dead ends: 46924 [2022-11-20 20:15:50,286 INFO L226 Difference]: Without dead ends: 46924 [2022-11-20 20:15:50,286 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-11-20 20:15:50,287 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 132 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:15:50,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 327 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-20 20:15:50,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46924 states. [2022-11-20 20:15:51,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46924 to 46924. [2022-11-20 20:15:51,441 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-11-20 20:15:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46924 states to 46924 states and 97075 transitions. [2022-11-20 20:15:51,540 INFO L78 Accepts]: Start accepts. Automaton has 46924 states and 97075 transitions. Word has length 15 [2022-11-20 20:15:51,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:15:51,540 INFO L495 AbstractCegarLoop]: Abstraction has 46924 states and 97075 transitions. [2022-11-20 20:15:51,541 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-11-20 20:15:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 46924 states and 97075 transitions. [2022-11-20 20:15:51,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 20:15:51,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:15:51,542 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:15:51,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 20:15:51,543 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-11-20 20:15:51,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:15:51,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2052168617, now seen corresponding path program 1 times [2022-11-20 20:15:51,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:15:51,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2378093] [2022-11-20 20:15:51,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:15:51,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:15:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:15:51,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:15:51,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:15:51,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2378093] [2022-11-20 20:15:51,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2378093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:15:51,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:15:51,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:15:51,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850324566] [2022-11-20 20:15:51,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:15:51,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:15:51,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:15:51,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:15:51,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:15:51,689 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-11-20 20:15:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:15:54,700 INFO L93 Difference]: Finished difference Result 47118 states and 97470 transitions. [2022-11-20 20:15:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:15:54,700 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-11-20 20:15:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:15:54,813 INFO L225 Difference]: With dead ends: 47118 [2022-11-20 20:15:54,813 INFO L226 Difference]: Without dead ends: 47118 [2022-11-20 20:15:54,814 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-11-20 20:15:54,815 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-20 20:15:54,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 323 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-20 20:15:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47118 states. [2022-11-20 20:15:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47118 to 47118. [2022-11-20 20:15:55,837 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-11-20 20:15:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47118 states to 47118 states and 97470 transitions. [2022-11-20 20:15:55,927 INFO L78 Accepts]: Start accepts. Automaton has 47118 states and 97470 transitions. Word has length 16 [2022-11-20 20:15:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:15:55,928 INFO L495 AbstractCegarLoop]: Abstraction has 47118 states and 97470 transitions. [2022-11-20 20:15:55,928 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-11-20 20:15:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 47118 states and 97470 transitions. [2022-11-20 20:15:55,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:15:55,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:15:55,929 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:15:55,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 20:15:55,929 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-11-20 20:15:55,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:15:55,930 INFO L85 PathProgramCache]: Analyzing trace with hash -422862537, now seen corresponding path program 1 times [2022-11-20 20:15:55,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:15:55,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120194423] [2022-11-20 20:15:55,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:15:55,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:15:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:15:56,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:15:56,967 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:15:56,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120194423] [2022-11-20 20:15:56,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120194423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:15:56,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:15:56,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:15:56,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224878636] [2022-11-20 20:15:56,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:15:56,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 20:15:56,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:15:56,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 20:15:56,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:15:56,969 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-11-20 20:16:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:16:01,573 INFO L93 Difference]: Finished difference Result 47122 states and 97478 transitions. [2022-11-20 20:16:01,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 20:16:01,573 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-11-20 20:16:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:16:01,682 INFO L225 Difference]: With dead ends: 47122 [2022-11-20 20:16:01,682 INFO L226 Difference]: Without dead ends: 47122 [2022-11-20 20:16:01,682 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-11-20 20:16:01,683 INFO L413 NwaCegarLoop]: 408 mSDtfsCounter, 1350 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:16:01,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 841 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-20 20:16:02,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47122 states. [2022-11-20 20:16:02,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47122 to 47102. [2022-11-20 20:16:02,834 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-11-20 20:16:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47102 states to 47102 states and 97438 transitions. [2022-11-20 20:16:02,970 INFO L78 Accepts]: Start accepts. Automaton has 47102 states and 97438 transitions. Word has length 18 [2022-11-20 20:16:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:16:02,970 INFO L495 AbstractCegarLoop]: Abstraction has 47102 states and 97438 transitions. [2022-11-20 20:16:02,970 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-11-20 20:16:02,970 INFO L276 IsEmpty]: Start isEmpty. Operand 47102 states and 97438 transitions. [2022-11-20 20:16:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:16:02,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:16:02,971 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:16:02,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 20:16:02,972 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting worker_fnErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-11-20 20:16:02,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:16:02,972 INFO L85 PathProgramCache]: Analyzing trace with hash -612514888, now seen corresponding path program 1 times [2022-11-20 20:16:02,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:16:02,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849446559] [2022-11-20 20:16:02,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:02,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:16:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:16:03,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:16:03,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849446559] [2022-11-20 20:16:03,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849446559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:16:03,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:16:03,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:16:03,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589048514] [2022-11-20 20:16:03,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:16:03,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:16:03,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:16:03,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:16:03,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:16:03,409 INFO L87 Difference]: Start difference. First operand 47102 states and 97438 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-11-20 20:16:05,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:16:05,812 INFO L93 Difference]: Finished difference Result 48137 states and 99548 transitions. [2022-11-20 20:16:05,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:16:05,812 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-11-20 20:16:05,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:16:05,901 INFO L225 Difference]: With dead ends: 48137 [2022-11-20 20:16:05,901 INFO L226 Difference]: Without dead ends: 48137 [2022-11-20 20:16:05,902 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-11-20 20:16:05,902 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 135 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:16:05,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 323 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-20 20:16:05,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48137 states. [2022-11-20 20:16:06,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48137 to 47295. [2022-11-20 20:16:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47295 states, 45934 states have (on average 2.1298384638829626) internal successors, (97832), 47294 states have internal predecessors, (97832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:16:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47295 states to 47295 states and 97832 transitions. [2022-11-20 20:16:06,925 INFO L78 Accepts]: Start accepts. Automaton has 47295 states and 97832 transitions. Word has length 18 [2022-11-20 20:16:06,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:16:06,925 INFO L495 AbstractCegarLoop]: Abstraction has 47295 states and 97832 transitions. [2022-11-20 20:16:06,925 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-11-20 20:16:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 47295 states and 97832 transitions. [2022-11-20 20:16:06,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:16:06,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:16:06,927 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:16:06,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 20:16:06,927 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-11-20 20:16:06,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:16:06,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1685438716, now seen corresponding path program 1 times [2022-11-20 20:16:06,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:16:06,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130884331] [2022-11-20 20:16:06,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:06,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:16:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:16:07,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:16:07,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130884331] [2022-11-20 20:16:07,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130884331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:16:07,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603182858] [2022-11-20 20:16:07,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:07,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:16:07,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:16:07,528 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:16:07,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 20:16:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:07,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 20:16:07,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:16:07,906 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:16:07,907 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 28 treesize of output 30 [2022-11-20 20:16:08,087 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-11-20 20:16:08,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:16:08,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:16:08,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:16:08,163 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1867 (Array Int Int))) (= (select (select (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| v_ArrVal_1867) |c_~#pre~0.base|) (+ |c_~#pre~0.offset| |c_ULTIMATE.start_worker_fn_~tid~0#1|)) |c_ULTIMATE.start_worker_fn_#t~nondet18#1|)) is different from false [2022-11-20 20:16:08,418 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:16:08,419 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 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-20 20:16:08,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-20 20:16:08,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:16:08,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603182858] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:16:08,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1778688983] [2022-11-20 20:16:08,493 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:16:08,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:16:08,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-11-20 20:16:08,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55267454] [2022-11-20 20:16:08,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:16:08,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 20:16:08,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:16:08,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 20:16:08,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2022-11-20 20:16:08,498 INFO L87 Difference]: Start difference. First operand 47295 states and 97832 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:16:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:16:14,756 INFO L93 Difference]: Finished difference Result 47299 states and 97840 transitions. [2022-11-20 20:16:14,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 20:16:14,757 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 20:16:14,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:16:14,870 INFO L225 Difference]: With dead ends: 47299 [2022-11-20 20:16:14,870 INFO L226 Difference]: Without dead ends: 47299 [2022-11-20 20:16:14,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=220, Unknown=1, NotChecked=32, Total=342 [2022-11-20 20:16:14,871 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 3407 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 2051 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3407 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 3181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1091 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-20 20:16:14,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3407 Valid, 974 Invalid, 3181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2051 Invalid, 0 Unknown, 1091 Unchecked, 5.7s Time] [2022-11-20 20:16:14,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47299 states. [2022-11-20 20:16:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47299 to 47279. [2022-11-20 20:16:15,840 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-11-20 20:16:15,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47279 states to 47279 states and 97800 transitions. [2022-11-20 20:16:15,953 INFO L78 Accepts]: Start accepts. Automaton has 47279 states and 97800 transitions. Word has length 18 [2022-11-20 20:16:15,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:16:15,954 INFO L495 AbstractCegarLoop]: Abstraction has 47279 states and 97800 transitions. [2022-11-20 20:16:15,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:16:15,954 INFO L276 IsEmpty]: Start isEmpty. Operand 47279 states and 97800 transitions. [2022-11-20 20:16:15,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 20:16:15,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:16:15,955 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:16:15,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 20:16:16,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 20:16:16,156 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-11-20 20:16:16,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:16:16,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1560978779, now seen corresponding path program 1 times [2022-11-20 20:16:16,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:16:16,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136372363] [2022-11-20 20:16:16,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:16,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:16:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:16:16,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:16:16,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136372363] [2022-11-20 20:16:16,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136372363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:16:16,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:16:16,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:16:16,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324945516] [2022-11-20 20:16:16,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:16:16,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:16:16,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:16:16,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:16:16,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:16:16,364 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-11-20 20:16:19,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:16:19,201 INFO L93 Difference]: Finished difference Result 48228 states and 99733 transitions. [2022-11-20 20:16:19,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:16:19,202 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-11-20 20:16:19,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:16:19,320 INFO L225 Difference]: With dead ends: 48228 [2022-11-20 20:16:19,321 INFO L226 Difference]: Without dead ends: 48228 [2022-11-20 20:16:19,321 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-11-20 20:16:19,321 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 123 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-20 20:16:19,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 320 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-20 20:16:19,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48228 states. [2022-11-20 20:16:20,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48228 to 47454. [2022-11-20 20:16:20,399 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-11-20 20:16:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47454 states to 47454 states and 98157 transitions. [2022-11-20 20:16:20,504 INFO L78 Accepts]: Start accepts. Automaton has 47454 states and 98157 transitions. Word has length 19 [2022-11-20 20:16:20,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:16:20,504 INFO L495 AbstractCegarLoop]: Abstraction has 47454 states and 98157 transitions. [2022-11-20 20:16:20,505 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-11-20 20:16:20,505 INFO L276 IsEmpty]: Start isEmpty. Operand 47454 states and 98157 transitions. [2022-11-20 20:16:20,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 20:16:20,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:16:20,506 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-11-20 20:16:20,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 20:16:20,506 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-11-20 20:16:20,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:16:20,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1158500770, now seen corresponding path program 1 times [2022-11-20 20:16:20,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:16:20,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597616803] [2022-11-20 20:16:20,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:20,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:16:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:22,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:16:22,476 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:16:22,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597616803] [2022-11-20 20:16:22,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597616803] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:16:22,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339204105] [2022-11-20 20:16:22,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:22,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:16:22,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:16:22,479 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:16:22,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 20:16:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:22,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-20 20:16:22,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:16:22,901 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-20 20:16:22,902 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 37 treesize of output 47 [2022-11-20 20:16:23,202 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-11-20 20:16:23,268 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-11-20 20:16:23,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:23,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:23,359 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-11-20 20:16:23,382 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-11-20 20:16:23,477 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-11-20 20:16:23,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:23,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:23,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:23,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:23,600 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-11-20 20:16:29,884 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-11-20 20:16:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:16:35,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:16:37,132 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ |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|)) (.cse4 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (forall ((v_ArrVal_2328 Int)) (let ((.cse0 (let ((.cse5 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse7 .cse4 v_ArrVal_2328)))) (store .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse3 0) .cse6 0))))) (let ((.cse1 (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (forall ((v_ArrVal_2335 (Array Int Int))) (= (select (select (store (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse1 .cse2 0)) |c_~#pre~0.base| v_ArrVal_2335) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse3) 0)) (not (= (select .cse1 .cse4) 0)))))) (forall ((v_ArrVal_2328 Int)) (let ((.cse8 (let ((.cse10 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse7 .cse4 v_ArrVal_2328)))) (store .cse10 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse3 0) .cse6 0))))) (let ((.cse9 (select .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (forall ((v_ArrVal_2335 (Array Int Int))) (= (select (select (store (store .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse9 .cse2 0)) |c_~#pre~0.base| v_ArrVal_2335) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse6) 0)) (not (= (select .cse9 .cse4) 0)))))) (forall ((v_ArrVal_2328 Int)) (let ((.cse11 (let ((.cse13 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse7 .cse4 v_ArrVal_2328)))) (store .cse13 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse3 0) .cse6 0))))) (let ((.cse12 (select .cse11 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (forall ((v_ArrVal_2335 (Array Int Int))) (= (select (select (store (store .cse11 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse12 .cse2 0)) |c_~#pre~0.base| v_ArrVal_2335) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)) (not (= (select .cse12 .cse4) 0)))))) (forall ((v_ArrVal_2328 Int)) (let ((.cse14 (let ((.cse16 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse7 .cse4 v_ArrVal_2328)))) (store .cse16 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse16 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse3 0) .cse6 0))))) (let ((.cse15 (select .cse14 |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (or (forall ((v_ArrVal_2335 (Array Int Int))) (= (select (select (store (store .cse14 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse15 .cse2 0)) |c_~#pre~0.base| v_ArrVal_2335) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)) (not (= (select .cse15 .cse4) 0)))))))) is different from false [2022-11-20 20:16:38,819 INFO L321 Elim1Store]: treesize reduction 249, result has 24.8 percent of original size [2022-11-20 20:16:38,820 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-11-20 20:16:38,869 INFO L321 Elim1Store]: treesize reduction 97, result has 4.0 percent of original size [2022-11-20 20:16:38,870 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-11-20 20:16:38,888 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-11-20 20:16:38,938 INFO L321 Elim1Store]: treesize reduction 330, result has 0.3 percent of original size [2022-11-20 20:16:38,939 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-11-20 20:16:38,997 INFO L321 Elim1Store]: treesize reduction 330, result has 0.3 percent of original size [2022-11-20 20:16:38,997 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-11-20 20:16:39,043 INFO L321 Elim1Store]: treesize reduction 330, result has 0.3 percent of original size [2022-11-20 20:16:39,044 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-11-20 20:16:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:16:39,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339204105] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 20:16:39,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:16:39,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 12] total 33 [2022-11-20 20:16:39,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001142048] [2022-11-20 20:16:39,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:16:39,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 20:16:39,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:16:39,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 20:16:39,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=901, Unknown=29, NotChecked=64, Total=1190 [2022-11-20 20:16:39,241 INFO L87 Difference]: Start difference. First operand 47454 states and 98157 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-11-20 20:16:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:16:43,287 INFO L93 Difference]: Finished difference Result 48485 states and 100255 transitions. [2022-11-20 20:16:43,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 20:16:43,287 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 21 [2022-11-20 20:16:43,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:16:43,385 INFO L225 Difference]: With dead ends: 48485 [2022-11-20 20:16:43,385 INFO L226 Difference]: Without dead ends: 48485 [2022-11-20 20:16:43,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=206, Invalid=1023, Unknown=35, NotChecked=68, Total=1332 [2022-11-20 20:16:43,386 INFO L413 NwaCegarLoop]: 436 mSDtfsCounter, 347 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 7155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5647 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:16:43,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 996 Invalid, 7155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1429 Invalid, 0 Unknown, 5647 Unchecked, 3.0s Time] [2022-11-20 20:16:43,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48485 states. [2022-11-20 20:16:44,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48485 to 47464. [2022-11-20 20:16:44,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47464 states, 46107 states have (on average 2.1293296028802566) internal successors, (98177), 47463 states have internal predecessors, (98177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:16:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47464 states to 47464 states and 98177 transitions. [2022-11-20 20:16:44,258 INFO L78 Accepts]: Start accepts. Automaton has 47464 states and 98177 transitions. Word has length 21 [2022-11-20 20:16:44,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:16:44,259 INFO L495 AbstractCegarLoop]: Abstraction has 47464 states and 98177 transitions. [2022-11-20 20:16:44,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-11-20 20:16:44,259 INFO L276 IsEmpty]: Start isEmpty. Operand 47464 states and 98177 transitions. [2022-11-20 20:16:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 20:16:44,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:16:44,260 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-11-20 20:16:44,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 20:16:44,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 20:16:44,461 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-11-20 20:16:44,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:16:44,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1161909132, now seen corresponding path program 1 times [2022-11-20 20:16:44,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:16:44,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889985000] [2022-11-20 20:16:44,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:44,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:16:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:16:46,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:16:46,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889985000] [2022-11-20 20:16:46,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889985000] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:16:46,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647282863] [2022-11-20 20:16:46,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:46,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:16:46,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:16:46,451 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:16:46,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 20:16:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:46,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-20 20:16:46,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:16:46,890 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-20 20:16:46,890 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 49 treesize of output 59 [2022-11-20 20:16:47,120 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-11-20 20:16:47,249 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-11-20 20:16:47,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,322 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-11-20 20:16:47,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,355 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-11-20 20:16:47,384 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-11-20 20:16:47,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,463 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-11-20 20:16:47,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,503 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-11-20 20:16:47,545 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-11-20 20:16:47,737 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-11-20 20:16:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:16:47,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:17:03,096 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse20 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse10 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse20 0)))) (let ((.cse6 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ 22 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse8 (+ 23 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse1 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse11 (select .cse10 |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse4 (+ 20 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse12 (+ 21 |c_ULTIMATE.start_main_~#a~1#1.offset|))) (and (forall ((v_ArrVal_2651 Int) (v_ArrVal_2654 Int) (v_ArrVal_2656 Int) (v_ArrVal_2649 Int)) (let ((.cse0 (let ((.cse5 (let ((.cse7 (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store .cse11 .cse4 v_ArrVal_2649) .cse12 v_ArrVal_2651)))) (store .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))))) (store .cse7 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (select .cse7 |c_ULTIMATE.start_main_~#a~1#1.base|) .cse3 v_ArrVal_2654) .cse8 v_ArrVal_2656))))) (store .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6 0))))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~#a~1#1.base|))) (or (forall ((v_ArrVal_2660 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_2660) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1) 0)) (not (= (select .cse2 .cse3) 0)) (not (= (select .cse2 .cse4) 0)))))) (forall ((v_ArrVal_2651 Int) (v_ArrVal_2654 Int) (v_ArrVal_2656 Int) (v_ArrVal_2649 Int)) (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse17 (store .cse10 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store .cse11 .cse4 v_ArrVal_2649) .cse12 v_ArrVal_2651)))) (store .cse17 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse17 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))))) (store .cse16 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (select .cse16 |c_ULTIMATE.start_main_~#a~1#1.base|) .cse3 v_ArrVal_2654) .cse8 v_ArrVal_2656))))) (store .cse15 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse15 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6 0))))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_main_~#a~1#1.base|))) (or (not (= (select .cse13 .cse3) 0)) (not (= (select .cse13 .cse4) 0)) (forall ((v_ArrVal_2660 (Array Int Int))) (= 0 (select (select (store .cse14 |c_~#pre~0.base| v_ArrVal_2660) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))))))) (forall ((v_ArrVal_2651 Int) (v_ArrVal_2654 Int) (v_ArrVal_2656 Int) (v_ArrVal_2649 Int)) (let ((.cse19 (let ((.cse21 (let ((.cse22 (let ((.cse23 (store .cse10 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store .cse11 .cse4 v_ArrVal_2649) .cse12 v_ArrVal_2651)))) (store .cse23 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse23 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))))) (store .cse22 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (select .cse22 |c_ULTIMATE.start_main_~#a~1#1.base|) .cse3 v_ArrVal_2654) .cse8 v_ArrVal_2656))))) (store .cse21 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse21 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6 0))))) (let ((.cse18 (select .cse19 |c_ULTIMATE.start_main_~#a~1#1.base|))) (or (not (= (select .cse18 .cse3) 0)) (forall ((v_ArrVal_2660 (Array Int Int))) (= (select (select (store .cse19 |c_~#pre~0.base| v_ArrVal_2660) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse20) 0)) (not (= (select .cse18 .cse4) 0)))))))))) is different from false [2022-11-20 20:17:03,669 INFO L321 Elim1Store]: treesize reduction 524, result has 28.5 percent of original size [2022-11-20 20:17:03,670 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 527 treesize of output 295 [2022-11-20 20:17:03,915 INFO L321 Elim1Store]: treesize reduction 96, result has 54.1 percent of original size [2022-11-20 20:17:03,915 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 234 treesize of output 292 [2022-11-20 20:17:04,081 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-11-20 20:17:04,307 INFO L321 Elim1Store]: treesize reduction 637, result has 13.1 percent of original size [2022-11-20 20:17:04,307 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 527 treesize of output 182 [2022-11-20 20:17:04,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:04,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:04,330 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:04,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:04,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:04,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:04,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:04,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:04,373 INFO L321 Elim1Store]: treesize reduction 10, result has 67.7 percent of original size [2022-11-20 20:17:04,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 122 [2022-11-20 20:17:04,619 INFO L321 Elim1Store]: treesize reduction 652, result has 11.1 percent of original size [2022-11-20 20:17:04,620 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 527 treesize of output 167 [2022-11-20 20:17:04,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:04,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:04,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:04,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:04,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:04,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:04,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:04,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:04,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:04,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 90 [2022-11-20 20:17:05,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-11-20 20:17:05,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647282863] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:17:05,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [650503738] [2022-11-20 20:17:05,667 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:17:05,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:17:05,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 15] total 38 [2022-11-20 20:17:05,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94421012] [2022-11-20 20:17:05,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:17:05,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 20:17:05,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:17:05,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 20:17:05,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1261, Unknown=54, NotChecked=74, Total=1560 [2022-11-20 20:17:05,670 INFO L87 Difference]: Start difference. First operand 47464 states and 98177 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-11-20 20:17:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:17:27,625 INFO L93 Difference]: Finished difference Result 60165 states and 124254 transitions. [2022-11-20 20:17:27,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 20:17:27,625 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-11-20 20:17:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:17:27,746 INFO L225 Difference]: With dead ends: 60165 [2022-11-20 20:17:27,746 INFO L226 Difference]: Without dead ends: 60165 [2022-11-20 20:17:27,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 28 SyntacticMatches, 19 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=519, Invalid=2619, Unknown=58, NotChecked=110, Total=3306 [2022-11-20 20:17:27,747 INFO L413 NwaCegarLoop]: 418 mSDtfsCounter, 6046 mSDsluCounter, 3069 mSDsCounter, 0 mSdLazyCounter, 9731 mSolverCounterSat, 769 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6046 SdHoareTripleChecker+Valid, 3487 SdHoareTripleChecker+Invalid, 23378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 769 IncrementalHoareTripleChecker+Valid, 9731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12878 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2022-11-20 20:17:27,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6046 Valid, 3487 Invalid, 23378 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [769 Valid, 9731 Invalid, 0 Unknown, 12878 Unchecked, 15.9s Time] [2022-11-20 20:17:27,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60165 states. [2022-11-20 20:17:28,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60165 to 47497. [2022-11-20 20:17:28,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47497 states, 46140 states have (on average 2.1292371044646727) internal successors, (98243), 47496 states have internal predecessors, (98243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:17:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47497 states to 47497 states and 98243 transitions. [2022-11-20 20:17:28,748 INFO L78 Accepts]: Start accepts. Automaton has 47497 states and 98243 transitions. Word has length 21 [2022-11-20 20:17:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:17:28,748 INFO L495 AbstractCegarLoop]: Abstraction has 47497 states and 98243 transitions. [2022-11-20 20:17:28,748 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-11-20 20:17:28,748 INFO L276 IsEmpty]: Start isEmpty. Operand 47497 states and 98243 transitions. [2022-11-20 20:17:28,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 20:17:28,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:17:28,750 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-11-20 20:17:28,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 20:17:28,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:17:28,951 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-11-20 20:17:28,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:17:28,951 INFO L85 PathProgramCache]: Analyzing trace with hash -603490918, now seen corresponding path program 2 times [2022-11-20 20:17:28,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:17:28,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265758888] [2022-11-20 20:17:28,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:17:28,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:17:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:17:30,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-11-20 20:17:30,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:17:30,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265758888] [2022-11-20 20:17:30,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265758888] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:17:30,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204898252] [2022-11-20 20:17:30,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:17:30,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:17:30,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:17:30,538 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:17:30,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 20:17:30,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 20:17:30,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:17:30,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-20 20:17:30,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:17:30,897 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:17:30,897 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-11-20 20:17:30,974 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-11-20 20:17:31,004 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-11-20 20:17:31,090 INFO L321 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2022-11-20 20:17:31,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 54 [2022-11-20 20:17:31,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:17:31,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 54 [2022-11-20 20:17:31,299 INFO L321 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2022-11-20 20:17:31,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 66 [2022-11-20 20:17:31,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:17:31,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-11-20 20:17:31,531 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 43 treesize of output 39 [2022-11-20 20:17:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:17:31,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:17:31,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204898252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:17:31,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 20:17:31,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 22 [2022-11-20 20:17:31,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550942785] [2022-11-20 20:17:31,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:17:31,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 20:17:31,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:17:31,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 20:17:31,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-11-20 20:17:31,579 INFO L87 Difference]: Start difference. First operand 47497 states and 98243 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-11-20 20:17:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:17:42,968 INFO L93 Difference]: Finished difference Result 54109 states and 111878 transitions. [2022-11-20 20:17:42,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 20:17:42,969 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 21 [2022-11-20 20:17:42,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:17:43,083 INFO L225 Difference]: With dead ends: 54109 [2022-11-20 20:17:43,084 INFO L226 Difference]: Without dead ends: 54109 [2022-11-20 20:17:43,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2022-11-20 20:17:43,085 INFO L413 NwaCegarLoop]: 414 mSDtfsCounter, 2117 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 6284 mSolverCounterSat, 683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2117 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 6967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 683 IncrementalHoareTripleChecker+Valid, 6284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-11-20 20:17:43,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2117 Valid, 930 Invalid, 6967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [683 Valid, 6284 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2022-11-20 20:17:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54109 states. [2022-11-20 20:17:43,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54109 to 47292. [2022-11-20 20:17:43,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47292 states, 45940 states have (on average 2.1294732259468874) internal successors, (97828), 47291 states have internal predecessors, (97828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:17:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47292 states to 47292 states and 97828 transitions. [2022-11-20 20:17:44,233 INFO L78 Accepts]: Start accepts. Automaton has 47292 states and 97828 transitions. Word has length 21 [2022-11-20 20:17:44,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:17:44,233 INFO L495 AbstractCegarLoop]: Abstraction has 47292 states and 97828 transitions. [2022-11-20 20:17:44,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-11-20 20:17:44,233 INFO L276 IsEmpty]: Start isEmpty. Operand 47292 states and 97828 transitions. [2022-11-20 20:17:44,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 20:17:44,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:17:44,236 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-11-20 20:17:44,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 20:17:44,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 20:17:44,443 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-11-20 20:17:44,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:17:44,444 INFO L85 PathProgramCache]: Analyzing trace with hash -754489168, now seen corresponding path program 2 times [2022-11-20 20:17:44,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:17:44,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146384145] [2022-11-20 20:17:44,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:17:44,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:17:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:17:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:17:46,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:17:46,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146384145] [2022-11-20 20:17:46,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146384145] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:17:46,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247134808] [2022-11-20 20:17:46,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:17:46,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:17:46,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:17:46,382 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:17:46,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c959cef5-95fd-451d-a99d-d81ac76926cf/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 20:17:47,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:17:47,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:17:47,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-20 20:17:47,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:17:47,795 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:17:47,795 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-11-20 20:17:47,944 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-11-20 20:17:48,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 20:17:48,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,127 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-11-20 20:17:48,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,218 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-11-20 20:17:48,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,257 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-11-20 20:17:48,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,371 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-11-20 20:17:48,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,422 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-11-20 20:17:48,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:48,459 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-11-20 20:17:52,685 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 70 treesize of output 60 [2022-11-20 20:17:56,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:17:56,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:17:56,815 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3309 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3309) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3309 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3309) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3309 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3309) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3309 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3309) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))))) is different from false [2022-11-20 20:17:57,384 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse6 (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) (.cse2 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11))) (and (forall ((v_ArrVal_3306 Int) (v_ArrVal_3304 Int)) (let ((.cse0 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store .cse6 .cse3 v_ArrVal_3304) .cse2 v_ArrVal_3306)))) (store .cse4 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse4 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5 0))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base|))) (or (forall ((v_ArrVal_3309 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_3309) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (not (= (select .cse1 .cse2) 0)) (not (= (select .cse1 .cse3) 0)))))) (forall ((v_ArrVal_3306 Int) (v_ArrVal_3304 Int)) (let ((.cse7 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store .cse6 .cse3 v_ArrVal_3304) .cse2 v_ArrVal_3306)))) (store .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5 0))))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_worker_fn_~a~0#1.base|))) (or (forall ((v_ArrVal_3309 (Array Int Int))) (= (select (select (store .cse7 |c_~#pre~0.base| v_ArrVal_3309) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (not (= (select .cse8 .cse2) 0)) (not (= (select .cse8 .cse3) 0)))))) (forall ((v_ArrVal_3306 Int) (v_ArrVal_3304 Int)) (let ((.cse11 (let ((.cse12 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store .cse6 .cse3 v_ArrVal_3304) .cse2 v_ArrVal_3306)))) (store .cse12 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse12 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5 0))))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_worker_fn_~a~0#1.base|))) (or (not (= (select .cse10 .cse2) 0)) (not (= (select .cse10 .cse3) 0)) (forall ((v_ArrVal_3309 (Array Int Int))) (= (select (select (store .cse11 |c_~#pre~0.base| v_ArrVal_3309) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))))))) is different from false [2022-11-20 20:17:57,492 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse6 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse12 0)))) (let ((.cse5 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse7 (select .cse6 |c_ULTIMATE.start_worker_fn_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) (.cse1 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11))) (and (forall ((v_ArrVal_3306 Int) (v_ArrVal_3304 Int)) (let ((.cse3 (let ((.cse4 (store .cse6 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store .cse7 .cse2 v_ArrVal_3304) .cse1 v_ArrVal_3306)))) (store .cse4 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse4 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5 0))))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_worker_fn_~a~0#1.base|))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse0 .cse2) 0)) (forall ((v_ArrVal_3309 (Array Int Int))) (= (select (select (store .cse3 |c_~#pre~0.base| v_ArrVal_3309) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))))) (forall ((v_ArrVal_3306 Int) (v_ArrVal_3304 Int)) (let ((.cse9 (let ((.cse10 (store .cse6 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store .cse7 .cse2 v_ArrVal_3304) .cse1 v_ArrVal_3306)))) (store .cse10 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse10 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5 0))))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_worker_fn_~a~0#1.base|))) (or (not (= (select .cse8 .cse1) 0)) (forall ((v_ArrVal_3309 (Array Int Int))) (= (select (select (store .cse9 |c_~#pre~0.base| v_ArrVal_3309) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (not (= (select .cse8 .cse2) 0)))))) (forall ((v_ArrVal_3306 Int) (v_ArrVal_3304 Int)) (let ((.cse11 (let ((.cse14 (store .cse6 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store .cse7 .cse2 v_ArrVal_3304) .cse1 v_ArrVal_3306)))) (store .cse14 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse14 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5 0))))) (let ((.cse13 (select .cse11 |c_ULTIMATE.start_worker_fn_~a~0#1.base|))) (or (forall ((v_ArrVal_3309 (Array Int Int))) (= (select (select (store .cse11 |c_~#pre~0.base| v_ArrVal_3309) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse12) 0)) (not (= (select .cse13 .cse1) 0)) (not (= (select .cse13 .cse2) 0)))))))))) is different from false [2022-11-20 20:18:13,798 INFO L321 Elim1Store]: treesize reduction 567, result has 20.7 percent of original size [2022-11-20 20:18:13,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 501 treesize of output 208 [2022-11-20 20:18:13,937 INFO L321 Elim1Store]: treesize reduction 142, result has 29.4 percent of original size [2022-11-20 20:18:13,937 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 173 treesize of output 177 [2022-11-20 20:18:14,049 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-11-20 20:18:14,141 INFO L321 Elim1Store]: treesize reduction 714, result has 0.1 percent of original size [2022-11-20 20:18:14,142 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 501 treesize of output 1 [2022-11-20 20:18:15,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:18:15,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247134808] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:18:15,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [14544515] [2022-11-20 20:18:15,411 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:18:15,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:18:15,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 15] total 38 [2022-11-20 20:18:15,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280005197] [2022-11-20 20:18:15,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:18:15,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 20:18:15,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:18:15,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 20:18:15,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1096, Unknown=61, NotChecked=216, Total=1560 [2022-11-20 20:18:15,415 INFO L87 Difference]: Start difference. First operand 47292 states and 97828 transitions. Second operand has 40 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 39 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)