./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 5e519f3a 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_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/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_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI --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-5e519f3 [2022-11-03 02:52:10,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:52:10,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:52:10,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:52:10,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:52:10,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:52:10,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:52:10,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:52:10,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:52:10,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:52:10,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:52:10,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:52:10,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:52:10,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:52:10,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:52:10,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:52:10,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:52:10,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:52:10,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:52:10,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:52:10,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:52:10,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:52:10,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:52:10,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:52:10,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:52:10,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:52:10,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:52:10,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:52:10,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:52:10,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:52:10,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:52:10,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:52:10,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:52:10,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:52:10,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:52:10,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:52:10,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:52:10,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:52:10,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:52:10,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:52:10,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:52:10,981 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-03 02:52:11,016 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:52:11,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:52:11,024 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:52:11,024 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:52:11,025 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:52:11,025 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:52:11,025 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:52:11,026 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:52:11,026 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:52:11,026 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:52:11,027 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:52:11,027 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:52:11,027 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:52:11,028 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:52:11,028 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:52:11,028 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:52:11,028 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:52:11,029 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:52:11,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:52:11,030 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:52:11,030 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 02:52:11,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:52:11,030 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:52:11,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:52:11,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:52:11,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:52:11,031 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:52:11,031 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-03 02:52:11,032 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:52:11,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:52:11,032 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:52:11,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:52:11,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:52:11,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:52:11,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:52:11,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:52:11,034 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:52:11,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:52:11,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:52:11,035 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:52:11,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:52:11,037 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:52:11,037 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:52:11,037 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_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/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_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI 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-03 02:52:11,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:52:11,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:52:11,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:52:11,368 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:52:11,369 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:52:11,370 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i [2022-11-03 02:52:11,442 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/data/d25aad1d5/e646c1e90fef4fd696bf23ed7d43879d/FLAG995f04110 [2022-11-03 02:52:12,014 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:52:12,014 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i [2022-11-03 02:52:12,032 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/data/d25aad1d5/e646c1e90fef4fd696bf23ed7d43879d/FLAG995f04110 [2022-11-03 02:52:12,344 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/data/d25aad1d5/e646c1e90fef4fd696bf23ed7d43879d [2022-11-03 02:52:12,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:52:12,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:52:12,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:52:12,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:52:12,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:52:12,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:52:12" (1/1) ... [2022-11-03 02:52:12,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41e8fcba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:52:12, skipping insertion in model container [2022-11-03 02:52:12,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:52:12" (1/1) ... [2022-11-03 02:52:12,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:52:12,420 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:52:12,594 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-03 02:52:12,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30448,30461] [2022-11-03 02:52:12,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30811,30824] [2022-11-03 02:52:12,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31483,31496] [2022-11-03 02:52:12,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31534,31547] [2022-11-03 02:52:12,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31683,31696] [2022-11-03 02:52:12,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31760,31773] [2022-11-03 02:52:12,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31807,31820] [2022-11-03 02:52:12,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31916,31929] [2022-11-03 02:52:12,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32035,32048] [2022-11-03 02:52:12,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32083,32096] [2022-11-03 02:52:12,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32160,32173] [2022-11-03 02:52:12,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32286,32299] [2022-11-03 02:52:12,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32897,32910] [2022-11-03 02:52:12,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32974,32987] [2022-11-03 02:52:12,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:52:12,918 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:52:12,934 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-03 02:52:12,966 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30448,30461] [2022-11-03 02:52:12,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30811,30824] [2022-11-03 02:52:12,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31483,31496] [2022-11-03 02:52:12,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31534,31547] [2022-11-03 02:52:12,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31683,31696] [2022-11-03 02:52:13,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31760,31773] [2022-11-03 02:52:13,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31807,31820] [2022-11-03 02:52:13,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31916,31929] [2022-11-03 02:52:13,007 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32035,32048] [2022-11-03 02:52:13,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32083,32096] [2022-11-03 02:52:13,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32160,32173] [2022-11-03 02:52:13,015 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32286,32299] [2022-11-03 02:52:13,027 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32897,32910] [2022-11-03 02:52:13,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32974,32987] [2022-11-03 02:52:13,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:52:13,072 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:52:13,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:52:13 WrapperNode [2022-11-03 02:52:13,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:52:13,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:52:13,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:52:13,074 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:52:13,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:52:13" (1/1) ... [2022-11-03 02:52:13,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:52:13" (1/1) ... [2022-11-03 02:52:13,188 INFO L138 Inliner]: procedures = 174, calls = 73, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 805 [2022-11-03 02:52:13,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:52:13,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:52:13,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:52:13,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:52:13,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:52:13" (1/1) ... [2022-11-03 02:52:13,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:52:13" (1/1) ... [2022-11-03 02:52:13,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:52:13" (1/1) ... [2022-11-03 02:52:13,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:52:13" (1/1) ... [2022-11-03 02:52:13,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:52:13" (1/1) ... [2022-11-03 02:52:13,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:52:13" (1/1) ... [2022-11-03 02:52:13,280 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:52:13" (1/1) ... [2022-11-03 02:52:13,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:52:13" (1/1) ... [2022-11-03 02:52:13,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:52:13,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:52:13,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:52:13,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:52:13,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:52:13" (1/1) ... [2022-11-03 02:52:13,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:52:13,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:52:13,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:52:13,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:52:13,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:52:13,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:52:13,439 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-03 02:52:13,440 INFO L130 BoogieDeclarations]: Found specification of procedure worker_fn [2022-11-03 02:52:13,440 INFO L138 BoogieDeclarations]: Found implementation of procedure worker_fn [2022-11-03 02:52:13,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:52:13,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:52:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:52:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:52:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:52:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:52:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:52:13,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:52:13,445 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 02:52:13,659 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:52:13,661 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:52:14,979 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:52:14,991 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:52:14,991 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-11-03 02:52:14,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:52:14 BoogieIcfgContainer [2022-11-03 02:52:14,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:52:14,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:52:14,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:52:15,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:52:15,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:52:12" (1/3) ... [2022-11-03 02:52:15,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2910c075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:52:15, skipping insertion in model container [2022-11-03 02:52:15,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:52:13" (2/3) ... [2022-11-03 02:52:15,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2910c075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:52:15, skipping insertion in model container [2022-11-03 02:52:15,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:52:14" (3/3) ... [2022-11-03 02:52:15,005 INFO L112 eAbstractionObserver]: Analyzing ICFG one_time_barrier_twice_2t.i [2022-11-03 02:52:15,015 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:52:15,025 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:52:15,025 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2022-11-03 02:52:15,025 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:52:15,262 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-03 02:52:15,337 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:52:15,357 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 868 places, 928 transitions, 1864 flow [2022-11-03 02:52:15,362 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 868 places, 928 transitions, 1864 flow [2022-11-03 02:52:15,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 868 places, 928 transitions, 1864 flow [2022-11-03 02:52:16,123 INFO L130 PetriNetUnfolder]: 95/1352 cut-off events. [2022-11-03 02:52:16,124 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-03 02:52:16,160 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 4547 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-03 02:52:16,263 INFO L118 LiptonReduction]: Number of co-enabled transitions 313900 [2022-11-03 02:53:23,160 WARN L234 SmtUtils]: Spent 17.91s on a formula simplification that was a NOOP. DAG size: 157 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-03 02:53:37,758 WARN L234 SmtUtils]: Spent 14.60s 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-03 02:53:58,456 WARN L234 SmtUtils]: Spent 20.70s on a formula simplification that was a NOOP. DAG size: 160 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-03 02:54:15,294 WARN L234 SmtUtils]: Spent 16.84s on a formula simplification that was a NOOP. DAG size: 154 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-03 02:55:48,018 WARN L234 SmtUtils]: Spent 1.36m on a formula simplification. DAG size of input: 189 DAG size of output: 185 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-03 02:56:10,601 WARN L234 SmtUtils]: Spent 22.58s 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-03 02:57:55,973 WARN L234 SmtUtils]: Spent 1.76m on a formula simplification. DAG size of input: 201 DAG size of output: 195 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-03 02:58:25,938 WARN L234 SmtUtils]: Spent 29.96s 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-03 02:58:31,831 INFO L133 LiptonReduction]: Checked pairs total: 5237143 [2022-11-03 02:58:31,831 INFO L135 LiptonReduction]: Total number of compositions: 695 [2022-11-03 02:58:31,840 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 438 places, 472 transitions, 952 flow [2022-11-03 02:58:33,069 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 45517 states, 44073 states have (on average 2.2196809838222946) internal successors, (97828), 45516 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-03 02:58:33,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:58:33,103 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;@24ac7c19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:58:33,104 INFO L358 AbstractCegarLoop]: Starting to check reachability of 113 error locations. [2022-11-03 02:58:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 45517 states, 44073 states have (on average 2.2196809838222946) internal successors, (97828), 45516 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-03 02:58:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 02:58:33,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:58:33,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 02:58:33,200 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-03 02:58:33,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:58:33,211 INFO L85 PathProgramCache]: Analyzing trace with hash 101065, now seen corresponding path program 1 times [2022-11-03 02:58:33,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:58:33,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427106120] [2022-11-03 02:58:33,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:58:33,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:58:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:58:33,623 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-03 02:58:33,624 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:58:33,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427106120] [2022-11-03 02:58:33,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427106120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:58:33,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:58:33,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:58:33,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600792923] [2022-11-03 02:58:33,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:58:33,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 02:58:33,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:58:33,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 02:58:33,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:58:33,730 INFO L87 Difference]: Start difference. First operand has 45517 states, 44073 states have (on average 2.2196809838222946) internal successors, (97828), 45516 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) 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-03 02:58:35,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:58:35,383 INFO L93 Difference]: Finished difference Result 45510 states and 93995 transitions. [2022-11-03 02:58:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 02:58:35,408 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-03 02:58:35,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:58:35,888 INFO L225 Difference]: With dead ends: 45510 [2022-11-03 02:58:35,888 INFO L226 Difference]: Without dead ends: 45508 [2022-11-03 02:58:35,889 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-03 02:58:35,892 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:58:35,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 02:58:36,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45508 states. [2022-11-03 02:58:37,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45508 to 45508. [2022-11-03 02:58:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45508 states, 44073 states have (on average 2.1326435686247818) internal successors, (93992), 45507 states have internal predecessors, (93992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:58:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45508 states to 45508 states and 93992 transitions. [2022-11-03 02:58:38,346 INFO L78 Accepts]: Start accepts. Automaton has 45508 states and 93992 transitions. Word has length 2 [2022-11-03 02:58:38,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:58:38,347 INFO L495 AbstractCegarLoop]: Abstraction has 45508 states and 93992 transitions. [2022-11-03 02:58:38,347 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-03 02:58:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 45508 states and 93992 transitions. [2022-11-03 02:58:38,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:58:38,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:58:38,348 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-11-03 02:58:38,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:58:38,349 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-03 02:58:38,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:58:38,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1440500174, now seen corresponding path program 1 times [2022-11-03 02:58:38,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:58:38,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124087109] [2022-11-03 02:58:38,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:58:38,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:58:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:58:38,777 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-03 02:58:38,777 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:58:38,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124087109] [2022-11-03 02:58:38,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124087109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:58:38,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:58:38,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:58:38,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369254142] [2022-11-03 02:58:38,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:58:38,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:58:38,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:58:38,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:58:38,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:58:38,782 INFO L87 Difference]: Start difference. First operand 45508 states and 93992 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-03 02:58:41,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:58:41,312 INFO L93 Difference]: Finished difference Result 45509 states and 93993 transitions. [2022-11-03 02:58:41,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:58:41,313 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-03 02:58:41,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:58:41,539 INFO L225 Difference]: With dead ends: 45509 [2022-11-03 02:58:41,539 INFO L226 Difference]: Without dead ends: 45509 [2022-11-03 02:58:41,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:58:41,541 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 0 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:58:41,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 598 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-03 02:58:41,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45509 states. [2022-11-03 02:58:42,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45509 to 45509. [2022-11-03 02:58:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45509 states, 44074 states have (on average 2.132617869946) internal successors, (93993), 45508 states have internal predecessors, (93993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:58:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45509 states to 45509 states and 93993 transitions. [2022-11-03 02:58:43,328 INFO L78 Accepts]: Start accepts. Automaton has 45509 states and 93993 transitions. Word has length 7 [2022-11-03 02:58:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:58:43,329 INFO L495 AbstractCegarLoop]: Abstraction has 45509 states and 93993 transitions. [2022-11-03 02:58:43,330 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-03 02:58:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 45509 states and 93993 transitions. [2022-11-03 02:58:43,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:58:43,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:58:43,331 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-03 02:58:43,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:58:43,332 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-03 02:58:43,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:58:43,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1607424566, now seen corresponding path program 1 times [2022-11-03 02:58:43,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:58:43,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503376780] [2022-11-03 02:58:43,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:58:43,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:58:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:58:43,504 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-03 02:58:43,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:58:43,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503376780] [2022-11-03 02:58:43,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503376780] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:58:43,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353049313] [2022-11-03 02:58:43,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:58:43,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:58:43,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:58:43,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:58:43,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:58:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:58:43,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:58:43,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:58:43,852 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-03 02:58:43,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:58:43,873 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-03 02:58:43,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353049313] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:58:43,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [136093969] [2022-11-03 02:58:43,884 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-03 02:58:43,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:58:43,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-11-03 02:58:43,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403229520] [2022-11-03 02:58:43,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:58:43,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:58:43,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:58:43,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:58:43,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:58:43,889 INFO L87 Difference]: Start difference. First operand 45509 states and 93993 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-03 02:58:45,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:58:45,822 INFO L93 Difference]: Finished difference Result 45510 states and 93994 transitions. [2022-11-03 02:58:45,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:58:45,822 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-03 02:58:45,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:58:45,995 INFO L225 Difference]: With dead ends: 45510 [2022-11-03 02:58:45,995 INFO L226 Difference]: Without dead ends: 45510 [2022-11-03 02:58:45,995 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-03 02:58:45,996 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 0 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:58:45,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 598 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-03 02:58:46,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45510 states. [2022-11-03 02:58:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45510 to 45510. [2022-11-03 02:58:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45510 states, 44075 states have (on average 2.1325921724333523) internal successors, (93994), 45509 states have internal predecessors, (93994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:58:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45510 states to 45510 states and 93994 transitions. [2022-11-03 02:58:47,293 INFO L78 Accepts]: Start accepts. Automaton has 45510 states and 93994 transitions. Word has length 8 [2022-11-03 02:58:47,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:58:47,294 INFO L495 AbstractCegarLoop]: Abstraction has 45510 states and 93994 transitions. [2022-11-03 02:58:47,294 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-03 02:58:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 45510 states and 93994 transitions. [2022-11-03 02:58:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 02:58:47,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:58:47,295 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-11-03 02:58:47,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:58:47,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:58:47,511 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-03 02:58:47,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:58:47,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1807853874, now seen corresponding path program 2 times [2022-11-03 02:58:47,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:58:47,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592540359] [2022-11-03 02:58:47,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:58:47,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:58:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:58:47,708 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-03 02:58:47,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:58:47,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592540359] [2022-11-03 02:58:47,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592540359] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:58:47,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605767243] [2022-11-03 02:58:47,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:58:47,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:58:47,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:58:47,711 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:58:47,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:58:48,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:58:48,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:58:48,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:58:48,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:58:48,457 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-03 02:58:48,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:58:48,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605767243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:58:48,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:58:48,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-11-03 02:58:48,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919929246] [2022-11-03 02:58:48,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:58:48,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:58:48,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:58:48,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:58:48,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:58:48,463 INFO L87 Difference]: Start difference. First operand 45510 states and 93994 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-03 02:58:50,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:58:50,493 INFO L93 Difference]: Finished difference Result 45102 states and 93164 transitions. [2022-11-03 02:58:50,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:58:50,493 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-03 02:58:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:58:50,692 INFO L225 Difference]: With dead ends: 45102 [2022-11-03 02:58:50,692 INFO L226 Difference]: Without dead ends: 45102 [2022-11-03 02:58:50,693 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-03 02:58:50,696 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 879 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:58:50,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 590 Invalid, 286 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [2 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-03 02:58:50,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45102 states. [2022-11-03 02:58:52,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45102 to 45102. [2022-11-03 02:58:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45102 states, 43702 states have (on average 2.1318017482037437) internal successors, (93164), 45101 states have internal predecessors, (93164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:58:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45102 states to 45102 states and 93164 transitions. [2022-11-03 02:58:52,361 INFO L78 Accepts]: Start accepts. Automaton has 45102 states and 93164 transitions. Word has length 9 [2022-11-03 02:58:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:58:52,361 INFO L495 AbstractCegarLoop]: Abstraction has 45102 states and 93164 transitions. [2022-11-03 02:58:52,362 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-03 02:58:52,362 INFO L276 IsEmpty]: Start isEmpty. Operand 45102 states and 93164 transitions. [2022-11-03 02:58:52,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:58:52,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:58:52,363 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:58:52,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:58:52,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:58:52,578 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-03 02:58:52,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:58:52,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1409300635, now seen corresponding path program 1 times [2022-11-03 02:58:52,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:58:52,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061139890] [2022-11-03 02:58:52,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:58:52,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:58:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:58:52,680 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-03 02:58:52,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:58:52,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061139890] [2022-11-03 02:58:52,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061139890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:58:52,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:58:52,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:58:52,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683648785] [2022-11-03 02:58:52,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:58:52,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:58:52,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:58:52,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:58:52,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:58:52,683 INFO L87 Difference]: Start difference. First operand 45102 states and 93164 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-03 02:58:53,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:58:53,553 INFO L93 Difference]: Finished difference Result 44901 states and 92954 transitions. [2022-11-03 02:58:53,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:58:53,554 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-03 02:58:53,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:58:53,954 INFO L225 Difference]: With dead ends: 44901 [2022-11-03 02:58:53,954 INFO L226 Difference]: Without dead ends: 44901 [2022-11-03 02:58:53,954 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-03 02:58:53,955 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 213 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:58:53,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 596 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:58:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44901 states. [2022-11-03 02:58:54,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44901 to 44901. [2022-11-03 02:58:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44901 states, 43535 states have (on average 2.135155621913403) internal successors, (92954), 44900 states have internal predecessors, (92954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:58:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44901 states to 44901 states and 92954 transitions. [2022-11-03 02:58:55,390 INFO L78 Accepts]: Start accepts. Automaton has 44901 states and 92954 transitions. Word has length 10 [2022-11-03 02:58:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:58:55,390 INFO L495 AbstractCegarLoop]: Abstraction has 44901 states and 92954 transitions. [2022-11-03 02:58:55,390 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-03 02:58:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 44901 states and 92954 transitions. [2022-11-03 02:58:55,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:58:55,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:58:55,391 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:58:55,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:58:55,392 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-03 02:58:55,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:58:55,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1692694115, now seen corresponding path program 1 times [2022-11-03 02:58:55,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:58:55,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694822327] [2022-11-03 02:58:55,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:58:55,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:58:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:58:56,014 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-03 02:58:56,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:58:56,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694822327] [2022-11-03 02:58:56,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694822327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:58:56,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:58:56,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:58:56,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256036084] [2022-11-03 02:58:56,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:58:56,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:58:56,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:58:56,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:58:56,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:58:56,018 INFO L87 Difference]: Start difference. First operand 44901 states and 92954 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-03 02:59:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:59:01,162 INFO L93 Difference]: Finished difference Result 46151 states and 95502 transitions. [2022-11-03 02:59:01,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:59:01,163 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-03 02:59:01,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:59:01,273 INFO L225 Difference]: With dead ends: 46151 [2022-11-03 02:59:01,273 INFO L226 Difference]: Without dead ends: 46151 [2022-11-03 02:59:01,273 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-03 02:59:01,274 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 530 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 2574 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 2574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:59:01,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 424 Invalid, 2917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 2574 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-03 02:59:01,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46151 states. [2022-11-03 02:59:02,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46151 to 45731. [2022-11-03 02:59:02,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45731 states, 44366 states have (on average 2.1333002749853494) internal successors, (94646), 45730 states have internal predecessors, (94646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:59:02,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45731 states to 45731 states and 94646 transitions. [2022-11-03 02:59:02,385 INFO L78 Accepts]: Start accepts. Automaton has 45731 states and 94646 transitions. Word has length 12 [2022-11-03 02:59:02,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:59:02,385 INFO L495 AbstractCegarLoop]: Abstraction has 45731 states and 94646 transitions. [2022-11-03 02:59:02,386 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-03 02:59:02,386 INFO L276 IsEmpty]: Start isEmpty. Operand 45731 states and 94646 transitions. [2022-11-03 02:59:02,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:59:02,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:59:02,388 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:59:02,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:59:02,389 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-03 02:59:02,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:59:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1920786291, now seen corresponding path program 1 times [2022-11-03 02:59:02,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:59:02,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595622692] [2022-11-03 02:59:02,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:59:02,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:59:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:59:02,929 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-03 02:59:02,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:59:02,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595622692] [2022-11-03 02:59:02,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595622692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:59:02,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:59:02,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:59:02,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519886049] [2022-11-03 02:59:02,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:59:02,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:59:02,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:59:02,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:59:02,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:59:02,938 INFO L87 Difference]: Start difference. First operand 45731 states and 94646 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-03 02:59:09,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:59:09,230 INFO L93 Difference]: Finished difference Result 46893 states and 97012 transitions. [2022-11-03 02:59:09,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:59:09,230 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-03 02:59:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:59:09,370 INFO L225 Difference]: With dead ends: 46893 [2022-11-03 02:59:09,370 INFO L226 Difference]: Without dead ends: 46893 [2022-11-03 02:59:09,371 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-03 02:59:09,371 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 478 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 3254 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 3571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 3254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:59:09,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 508 Invalid, 3571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 3254 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-11-03 02:59:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46893 states. [2022-11-03 02:59:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46893 to 46503. [2022-11-03 02:59:10,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46503 states, 45138 states have (on average 2.131640746156232) internal successors, (96218), 46502 states have internal predecessors, (96218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:59:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46503 states to 46503 states and 96218 transitions. [2022-11-03 02:59:10,385 INFO L78 Accepts]: Start accepts. Automaton has 46503 states and 96218 transitions. Word has length 13 [2022-11-03 02:59:10,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:59:10,385 INFO L495 AbstractCegarLoop]: Abstraction has 46503 states and 96218 transitions. [2022-11-03 02:59:10,385 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-03 02:59:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 46503 states and 96218 transitions. [2022-11-03 02:59:10,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:59:10,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:59:10,387 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:59:10,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:59:10,387 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-03 02:59:10,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:59:10,388 INFO L85 PathProgramCache]: Analyzing trace with hash 178318143, now seen corresponding path program 1 times [2022-11-03 02:59:10,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:59:10,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299060398] [2022-11-03 02:59:10,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:59:10,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:59:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:59:10,529 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-03 02:59:10,529 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:59:10,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299060398] [2022-11-03 02:59:10,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299060398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:59:10,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:59:10,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:59:10,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114958584] [2022-11-03 02:59:10,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:59:10,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:59:10,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:59:10,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:59:10,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:59:10,532 INFO L87 Difference]: Start difference. First operand 46503 states and 96218 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-03 02:59:13,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:59:13,408 INFO L93 Difference]: Finished difference Result 46715 states and 96650 transitions. [2022-11-03 02:59:13,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:59:13,408 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-03 02:59:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:59:13,518 INFO L225 Difference]: With dead ends: 46715 [2022-11-03 02:59:13,519 INFO L226 Difference]: Without dead ends: 46715 [2022-11-03 02:59:13,519 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-03 02:59:13,519 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 131 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:59:13,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 332 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-03 02:59:13,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46715 states. [2022-11-03 02:59:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46715 to 46715. [2022-11-03 02:59:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46715 states, 45350 states have (on average 2.131201764057332) internal successors, (96650), 46714 states have internal predecessors, (96650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:59:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46715 states to 46715 states and 96650 transitions. [2022-11-03 02:59:14,615 INFO L78 Accepts]: Start accepts. Automaton has 46715 states and 96650 transitions. Word has length 15 [2022-11-03 02:59:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:59:14,616 INFO L495 AbstractCegarLoop]: Abstraction has 46715 states and 96650 transitions. [2022-11-03 02:59:14,616 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-03 02:59:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 46715 states and 96650 transitions. [2022-11-03 02:59:14,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:59:14,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:59:14,618 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:59:14,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:59:14,618 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-03 02:59:14,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:59:14,619 INFO L85 PathProgramCache]: Analyzing trace with hash 330334307, now seen corresponding path program 1 times [2022-11-03 02:59:14,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:59:14,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671601340] [2022-11-03 02:59:14,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:59:14,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:59:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:59:14,766 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-03 02:59:14,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:59:14,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671601340] [2022-11-03 02:59:14,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671601340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:59:14,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:59:14,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:59:14,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233419908] [2022-11-03 02:59:14,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:59:14,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:59:14,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:59:14,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:59:14,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:59:14,769 INFO L87 Difference]: Start difference. First operand 46715 states and 96650 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-03 02:59:17,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:59:17,654 INFO L93 Difference]: Finished difference Result 46909 states and 97045 transitions. [2022-11-03 02:59:17,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:59:17,655 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-03 02:59:17,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:59:17,760 INFO L225 Difference]: With dead ends: 46909 [2022-11-03 02:59:17,760 INFO L226 Difference]: Without dead ends: 46909 [2022-11-03 02:59:17,761 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-03 02:59:17,761 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 120 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:59:17,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 338 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-03 02:59:17,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46909 states. [2022-11-03 02:59:18,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46909 to 46909. [2022-11-03 02:59:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46909 states, 45545 states have (on average 2.130749807882314) internal successors, (97045), 46908 states have internal predecessors, (97045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:59:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46909 states to 46909 states and 97045 transitions. [2022-11-03 02:59:19,177 INFO L78 Accepts]: Start accepts. Automaton has 46909 states and 97045 transitions. Word has length 16 [2022-11-03 02:59:19,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:59:19,178 INFO L495 AbstractCegarLoop]: Abstraction has 46909 states and 97045 transitions. [2022-11-03 02:59:19,178 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-03 02:59:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 46909 states and 97045 transitions. [2022-11-03 02:59:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:59:19,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:59:19,179 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:59:19,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:59:19,180 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-03 02:59:19,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:59:19,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2128247443, now seen corresponding path program 1 times [2022-11-03 02:59:19,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:59:19,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089844683] [2022-11-03 02:59:19,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:59:19,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:59:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:59:20,324 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-03 02:59:20,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:59:20,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089844683] [2022-11-03 02:59:20,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089844683] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:59:20,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:59:20,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:59:20,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829391394] [2022-11-03 02:59:20,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:59:20,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:59:20,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:59:20,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:59:20,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:59:20,327 INFO L87 Difference]: Start difference. First operand 46909 states and 97045 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-03 02:59:24,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:59:24,415 INFO L93 Difference]: Finished difference Result 46913 states and 97053 transitions. [2022-11-03 02:59:24,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:59:24,416 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-03 02:59:24,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:59:24,537 INFO L225 Difference]: With dead ends: 46913 [2022-11-03 02:59:24,537 INFO L226 Difference]: Without dead ends: 46913 [2022-11-03 02:59:24,538 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-03 02:59:24,538 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 1349 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:59:24,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 878 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-11-03 02:59:24,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46913 states. [2022-11-03 02:59:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46913 to 46893. [2022-11-03 02:59:25,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46893 states, 45530 states have (on average 2.130748956731825) internal successors, (97013), 46892 states have internal predecessors, (97013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:59:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46893 states to 46893 states and 97013 transitions. [2022-11-03 02:59:25,541 INFO L78 Accepts]: Start accepts. Automaton has 46893 states and 97013 transitions. Word has length 18 [2022-11-03 02:59:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:59:25,541 INFO L495 AbstractCegarLoop]: Abstraction has 46893 states and 97013 transitions. [2022-11-03 02:59:25,541 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-03 02:59:25,542 INFO L276 IsEmpty]: Start isEmpty. Operand 46893 states and 97013 transitions. [2022-11-03 02:59:25,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:59:25,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:59:25,542 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:59:25,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:59:25,543 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-03 02:59:25,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:59:25,543 INFO L85 PathProgramCache]: Analyzing trace with hash -575530470, now seen corresponding path program 1 times [2022-11-03 02:59:25,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:59:25,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262667279] [2022-11-03 02:59:25,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:59:25,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:59:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:59:25,692 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-03 02:59:25,693 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:59:25,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262667279] [2022-11-03 02:59:25,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262667279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:59:25,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:59:25,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:59:25,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067091375] [2022-11-03 02:59:25,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:59:25,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:59:25,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:59:25,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:59:25,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:59:25,695 INFO L87 Difference]: Start difference. First operand 46893 states and 97013 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-03 02:59:28,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:59:28,346 INFO L93 Difference]: Finished difference Result 47923 states and 99113 transitions. [2022-11-03 02:59:28,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:59:28,347 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-03 02:59:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:59:28,442 INFO L225 Difference]: With dead ends: 47923 [2022-11-03 02:59:28,442 INFO L226 Difference]: Without dead ends: 47923 [2022-11-03 02:59:28,442 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-03 02:59:28,443 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 134 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:59:28,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 329 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-03 02:59:28,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47923 states. [2022-11-03 02:59:29,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47923 to 47085. [2022-11-03 02:59:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47085 states, 45724 states have (on average 2.130281690140845) internal successors, (97405), 47084 states have internal predecessors, (97405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:59:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47085 states to 47085 states and 97405 transitions. [2022-11-03 02:59:29,590 INFO L78 Accepts]: Start accepts. Automaton has 47085 states and 97405 transitions. Word has length 18 [2022-11-03 02:59:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:59:29,590 INFO L495 AbstractCegarLoop]: Abstraction has 47085 states and 97405 transitions. [2022-11-03 02:59:29,590 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-03 02:59:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 47085 states and 97405 transitions. [2022-11-03 02:59:29,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:59:29,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:59:29,592 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:59:29,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:59:29,592 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-03 02:59:29,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:59:29,593 INFO L85 PathProgramCache]: Analyzing trace with hash -995655965, now seen corresponding path program 1 times [2022-11-03 02:59:29,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:59:29,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112474868] [2022-11-03 02:59:29,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:59:29,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:59:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:59:30,169 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-03 02:59:30,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:59:30,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112474868] [2022-11-03 02:59:30,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112474868] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:59:30,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135126962] [2022-11-03 02:59:30,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:59:30,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:59:30,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:59:30,175 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:59:30,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:59:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:59:30,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 02:59:30,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:59:30,578 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 02:59:30,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:59:30,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:59:30,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:59:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:59:30,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:59:30,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135126962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:59:30,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:59:30,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2022-11-03 02:59:30,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579222126] [2022-11-03 02:59:30,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:59:30,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:59:30,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:59:30,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:59:30,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:59:30,819 INFO L87 Difference]: Start difference. First operand 47085 states and 97405 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:59:37,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:59:37,027 INFO L93 Difference]: Finished difference Result 47288 states and 97619 transitions. [2022-11-03 02:59:37,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:59:37,028 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 02:59:37,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:59:37,121 INFO L225 Difference]: With dead ends: 47288 [2022-11-03 02:59:37,121 INFO L226 Difference]: Without dead ends: 47288 [2022-11-03 02:59:37,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:59:37,122 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 1214 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 2390 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 2408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:59:37,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 1297 Invalid, 2408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2390 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-11-03 02:59:37,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47288 states. [2022-11-03 02:59:37,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47288 to 47069. [2022-11-03 02:59:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47069 states, 45709 states have (on average 2.1302806887046315) internal successors, (97373), 47068 states have internal predecessors, (97373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:59:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47069 states to 47069 states and 97373 transitions. [2022-11-03 02:59:38,338 INFO L78 Accepts]: Start accepts. Automaton has 47069 states and 97373 transitions. Word has length 18 [2022-11-03 02:59:38,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:59:38,339 INFO L495 AbstractCegarLoop]: Abstraction has 47069 states and 97373 transitions. [2022-11-03 02:59:38,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:59:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 47069 states and 97373 transitions. [2022-11-03 02:59:38,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:59:38,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:59:38,340 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-03 02:59:38,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:59:38,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 02:59:38,540 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-03 02:59:38,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:59:38,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1246790940, now seen corresponding path program 1 times [2022-11-03 02:59:38,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:59:38,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120348100] [2022-11-03 02:59:38,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:59:38,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:59:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:59:38,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-03 02:59:38,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:59:38,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120348100] [2022-11-03 02:59:38,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120348100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:59:38,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:59:38,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:59:38,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458155795] [2022-11-03 02:59:38,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:59:38,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:59:38,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:59:38,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:59:38,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:59:38,689 INFO L87 Difference]: Start difference. First operand 47069 states and 97373 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-03 02:59:40,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:59:40,503 INFO L93 Difference]: Finished difference Result 48018 states and 99306 transitions. [2022-11-03 02:59:40,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:59:40,504 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-03 02:59:40,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:59:40,597 INFO L225 Difference]: With dead ends: 48018 [2022-11-03 02:59:40,597 INFO L226 Difference]: Without dead ends: 48018 [2022-11-03 02:59:40,597 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-03 02:59:40,598 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 123 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:59:40,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 333 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-03 02:59:40,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48018 states. [2022-11-03 02:59:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48018 to 47244. [2022-11-03 02:59:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47244 states, 45887 states have (on average 2.1297971102926754) internal successors, (97730), 47243 states have internal predecessors, (97730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:59:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47244 states to 47244 states and 97730 transitions. [2022-11-03 02:59:41,618 INFO L78 Accepts]: Start accepts. Automaton has 47244 states and 97730 transitions. Word has length 19 [2022-11-03 02:59:41,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:59:41,618 INFO L495 AbstractCegarLoop]: Abstraction has 47244 states and 97730 transitions. [2022-11-03 02:59:41,618 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-03 02:59:41,619 INFO L276 IsEmpty]: Start isEmpty. Operand 47244 states and 97730 transitions. [2022-11-03 02:59:41,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:59:41,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:59:41,619 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-03 02:59:41,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 02:59:41,620 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-03 02:59:41,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:59:41,621 INFO L85 PathProgramCache]: Analyzing trace with hash 822177896, now seen corresponding path program 1 times [2022-11-03 02:59:41,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:59:41,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401329938] [2022-11-03 02:59:41,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:59:41,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:59:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:59:42,755 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-03 02:59:42,755 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:59:42,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401329938] [2022-11-03 02:59:42,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401329938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:59:42,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:59:42,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:59:42,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862093363] [2022-11-03 02:59:42,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:59:42,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:59:42,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:59:42,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:59:42,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:59:42,757 INFO L87 Difference]: Start difference. First operand 47244 states and 97730 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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-03 02:59:49,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:59:49,372 INFO L93 Difference]: Finished difference Result 53650 states and 110948 transitions. [2022-11-03 02:59:49,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:59:49,373 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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-03 02:59:49,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:59:49,721 INFO L225 Difference]: With dead ends: 53650 [2022-11-03 02:59:49,722 INFO L226 Difference]: Without dead ends: 53650 [2022-11-03 02:59:49,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:59:49,722 INFO L413 NwaCegarLoop]: 446 mSDtfsCounter, 1810 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 3666 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1810 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 4172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 3666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:59:49,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1810 Valid, 1036 Invalid, 4172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [506 Valid, 3666 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-11-03 02:59:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53650 states. [2022-11-03 02:59:50,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53650 to 47054. [2022-11-03 02:59:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47054 states, 45702 states have (on average 2.1299943109710733) internal successors, (97345), 47053 states have internal predecessors, (97345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:59:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47054 states to 47054 states and 97345 transitions. [2022-11-03 02:59:50,557 INFO L78 Accepts]: Start accepts. Automaton has 47054 states and 97345 transitions. Word has length 21 [2022-11-03 02:59:50,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:59:50,557 INFO L495 AbstractCegarLoop]: Abstraction has 47054 states and 97345 transitions. [2022-11-03 02:59:50,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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-03 02:59:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 47054 states and 97345 transitions. [2022-11-03 02:59:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:59:50,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:59:50,558 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-03 02:59:50,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 02:59:50,559 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting worker_fnErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-11-03 02:59:50,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:59:50,560 INFO L85 PathProgramCache]: Analyzing trace with hash -92861023, now seen corresponding path program 1 times [2022-11-03 02:59:50,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:59:50,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80015069] [2022-11-03 02:59:50,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:59:50,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:59:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:59:50,960 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-03 02:59:50,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:59:50,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80015069] [2022-11-03 02:59:50,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80015069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:59:50,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:59:50,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:59:50,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264205033] [2022-11-03 02:59:50,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:59:50,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:59:50,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:59:50,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:59:50,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:59:50,963 INFO L87 Difference]: Start difference. First operand 47054 states and 97345 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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-03 02:59:53,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:59:53,360 INFO L93 Difference]: Finished difference Result 47248 states and 97741 transitions. [2022-11-03 02:59:53,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:59:53,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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-03 02:59:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:59:53,459 INFO L225 Difference]: With dead ends: 47248 [2022-11-03 02:59:53,459 INFO L226 Difference]: Without dead ends: 47248 [2022-11-03 02:59:53,460 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-03 02:59:53,460 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 130 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:59:53,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 333 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-03 02:59:53,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47248 states. [2022-11-03 02:59:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47248 to 47248. [2022-11-03 02:59:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47248 states, 45898 states have (on average 2.129526341017038) internal successors, (97741), 47247 states have internal predecessors, (97741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:59:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47248 states to 47248 states and 97741 transitions. [2022-11-03 02:59:54,535 INFO L78 Accepts]: Start accepts. Automaton has 47248 states and 97741 transitions. Word has length 21 [2022-11-03 02:59:54,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:59:54,536 INFO L495 AbstractCegarLoop]: Abstraction has 47248 states and 97741 transitions. [2022-11-03 02:59:54,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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-03 02:59:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 47248 states and 97741 transitions. [2022-11-03 02:59:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:59:54,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:59:54,538 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-03 02:59:54,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 02:59:54,538 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting worker_fnErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-11-03 02:59:54,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:59:54,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1606905962, now seen corresponding path program 1 times [2022-11-03 02:59:54,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:59:54,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486308550] [2022-11-03 02:59:54,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:59:54,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:59:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:59:54,693 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-03 02:59:54,693 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:59:54,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486308550] [2022-11-03 02:59:54,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486308550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:59:54,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:59:54,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:59:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253499583] [2022-11-03 02:59:54,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:59:54,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:59:54,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:59:54,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:59:54,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:59:54,697 INFO L87 Difference]: Start difference. First operand 47248 states and 97741 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-03 02:59:56,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:59:56,288 INFO L93 Difference]: Finished difference Result 49404 states and 102133 transitions. [2022-11-03 02:59:56,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:59:56,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-03 02:59:56,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:59:56,393 INFO L225 Difference]: With dead ends: 49404 [2022-11-03 02:59:56,393 INFO L226 Difference]: Without dead ends: 49404 [2022-11-03 02:59:56,393 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-03 02:59:56,394 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 234 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:59:56,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 737 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-03 02:59:56,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49404 states. [2022-11-03 02:59:57,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49404 to 47469. [2022-11-03 02:59:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47469 states, 46119 states have (on average 2.129079121403326) internal successors, (98191), 47468 states have internal predecessors, (98191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:59:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47469 states to 47469 states and 98191 transitions. [2022-11-03 02:59:57,690 INFO L78 Accepts]: Start accepts. Automaton has 47469 states and 98191 transitions. Word has length 21 [2022-11-03 02:59:57,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:59:57,691 INFO L495 AbstractCegarLoop]: Abstraction has 47469 states and 98191 transitions. [2022-11-03 02:59:57,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-03 02:59:57,691 INFO L276 IsEmpty]: Start isEmpty. Operand 47469 states and 98191 transitions. [2022-11-03 02:59:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:59:57,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:59:57,692 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-03 02:59:57,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 02:59:57,692 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-03 02:59:57,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:59:57,693 INFO L85 PathProgramCache]: Analyzing trace with hash -559841293, now seen corresponding path program 1 times [2022-11-03 02:59:57,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:59:57,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001314962] [2022-11-03 02:59:57,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:59:57,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:59:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:00:00,472 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-03 03:00:00,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:00:00,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001314962] [2022-11-03 03:00:00,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001314962] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:00:00,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704357896] [2022-11-03 03:00:00,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:00:00,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:00:00,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:00:00,479 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:00:00,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:00:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:00:00,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-03 03:00:00,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:00:00,944 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-03 03:00:00,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:00:01,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:00:01,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 03:00:01,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:00:01,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:00:01,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:01,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:01,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:01,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:01,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:00:01,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:01,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:01,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:01,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:01,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:00:01,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:01,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:01,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:01,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:01,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:00:01,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:01,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:01,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:01,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:01,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:00:08,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-11-03 03:00:14,131 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-03 03:00:14,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:00:14,165 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2792 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2792 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2792 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2792 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-11-03 03:00:15,103 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) 0)) (.cse1 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) (.cse2 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) (.cse3 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11))) (and (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store .cse0 .cse1 v_ArrVal_2786) .cse2 v_ArrVal_2788) .cse3 v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store .cse0 .cse1 v_ArrVal_2786) .cse2 v_ArrVal_2788) .cse3 v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store .cse0 .cse1 v_ArrVal_2786) .cse2 v_ArrVal_2788) .cse3 v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store .cse0 .cse1 v_ArrVal_2786) .cse2 v_ArrVal_2788) .cse3 v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) is different from false [2022-11-03 03:00:15,197 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse0) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse0))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= 0 (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse0))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse0))))) is different from false [2022-11-03 03:00:15,546 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse2 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse2))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse2) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= 0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse2))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse2))))))) is different from false [2022-11-03 03:00:15,808 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2 0) .cse4 0)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse3 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3))))))) is different from false [2022-11-03 03:00:22,275 INFO L356 Elim1Store]: treesize reduction 590, result has 26.3 percent of original size [2022-11-03 03:00:22,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 223 [2022-11-03 03:00:22,296 INFO L356 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2022-11-03 03:00:22,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 206 treesize of output 170 [2022-11-03 03:00:22,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:00:22,600 INFO L356 Elim1Store]: treesize reduction 740, result has 7.6 percent of original size [2022-11-03 03:00:22,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 73 [2022-11-03 03:00:22,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:00:22,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2022-11-03 03:00:22,711 INFO L356 Elim1Store]: treesize reduction 800, result has 0.1 percent of original size [2022-11-03 03:00:22,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 1 [2022-11-03 03:00:22,900 INFO L356 Elim1Store]: treesize reduction 730, result has 8.9 percent of original size [2022-11-03 03:00:22,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 83 [2022-11-03 03:00:22,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:00:22,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2022-11-03 03:00:23,853 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-03 03:00:23,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704357896] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:00:23,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1079815095] [2022-11-03 03:00:23,854 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-03 03:00:23,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:00:23,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 36 [2022-11-03 03:00:23,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098499258] [2022-11-03 03:00:23,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:00:23,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 03:00:23,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:00:23,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 03:00:23,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=838, Unknown=29, NotChecked=330, Total=1406 [2022-11-03 03:00:23,857 INFO L87 Difference]: Start difference. First operand 47469 states and 98191 transitions. Second operand has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 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) [2022-11-03 03:00:30,794 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse2 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse5 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store .cse7 .cse2 0) .cse5 0)))) (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse8 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse6 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3))) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| .cse4) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3))) (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#a~1#1.base|) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (<= |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| .cse4) (= (select .cse7 .cse8) 0) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_ULTIMATE.start_main_~#b2~0#1.base|)) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse8) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3))) (= |c_ULTIMATE.start_main_~i~5#1| 0) (= |c_~#pre~0.base| 3) (= (select .cse7 .cse6) 0))))) is different from false [2022-11-03 03:00:32,952 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse7 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse6 .cse7 0)))) (let ((.cse5 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse3 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse2 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3))) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= 0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4))))) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3))) (= (select .cse6 .cse5) 0) (= (select .cse6 .cse4) 0) (= |c_ULTIMATE.start_main_~i~5#1| 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse7) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3))) (= |c_~#pre~0.base| 3) (= (select .cse6 .cse2) 0))))) is different from false [2022-11-03 03:00:35,093 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse2 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store .cse6 .cse2 0) .cse4 0)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse7 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse5 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3))) (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#a~1#1.base|) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (<= |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (= (select .cse6 .cse7) 0) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_ULTIMATE.start_main_~#b2~0#1.base|)) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse7) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3))) (= |c_~#pre~0.base| 3) (= (select .cse6 .cse5) 0))))) is different from false [2022-11-03 03:00:37,194 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse5 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse0 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse4 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse6 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse2 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|))) (and (= (select .cse0 .cse1) 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse2) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse3 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse3 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse2))) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (= (select .cse0 .cse5) 0) (= (select .cse0 .cse6) 0) (= |c_ULTIMATE.start_main_~i~5#1| 0) (= |c_~#pre~0.base| 3) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= 0 (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse3 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5))) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse2))) (= (select .cse0 .cse4) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse3 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse2))))) is different from false [2022-11-03 03:00:39,276 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse7 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse6 .cse7 0)))) (let ((.cse5 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse3 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse2 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3))) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= 0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4))))) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3))) (= (select .cse6 .cse5) 0) (= (select .cse6 .cse4) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse7) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse3))) (= |c_~#pre~0.base| 3) (= (select .cse6 .cse2) 0))))) is different from false [2022-11-03 03:00:41,439 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse5 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse0 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse4 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse6 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse2 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|))) (and (= (select .cse0 .cse1) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse2) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse3 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse3 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse2))) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (= (select .cse0 .cse5) 0) (= (select .cse0 .cse6) 0) (= |c_~#pre~0.base| 3) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= 0 (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse3 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5))) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse2))) (= (select .cse0 .cse4) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| Int)) (or (forall ((v_ArrVal_2791 Int) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2792 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse3 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 9) v_ArrVal_2786) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 10) v_ArrVal_2788) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| 11) v_ArrVal_2791)) |c_~#pre~0.base| v_ArrVal_2792) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2858| .cse2))))) is different from false [2022-11-03 03:00:50,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:00:50,746 INFO L93 Difference]: Finished difference Result 48369 states and 100050 transitions. [2022-11-03 03:00:50,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 03:00:50,746 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 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) Word has length 21 [2022-11-03 03:00:50,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:00:50,842 INFO L225 Difference]: With dead ends: 48369 [2022-11-03 03:00:50,842 INFO L226 Difference]: Without dead ends: 48369 [2022-11-03 03:00:50,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 38.3s TimeCoverageRelationStatistics Valid=325, Invalid=1324, Unknown=35, NotChecked=968, Total=2652 [2022-11-03 03:00:50,844 INFO L413 NwaCegarLoop]: 446 mSDtfsCounter, 1511 mSDsluCounter, 3785 mSDsCounter, 0 mSdLazyCounter, 4466 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 2345 SdHoareTripleChecker+Invalid, 16104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 4466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11524 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:00:50,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1511 Valid, 2345 Invalid, 16104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 4466 Invalid, 0 Unknown, 11524 Unchecked, 8.9s Time] [2022-11-03 03:00:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48369 states. [2022-11-03 03:00:51,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48369 to 47483. [2022-11-03 03:00:51,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47483 states, 46133 states have (on average 2.129061626167819) internal successors, (98220), 47482 states have internal predecessors, (98220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:00:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47483 states to 47483 states and 98220 transitions. [2022-11-03 03:00:51,688 INFO L78 Accepts]: Start accepts. Automaton has 47483 states and 98220 transitions. Word has length 21 [2022-11-03 03:00:51,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:00:51,688 INFO L495 AbstractCegarLoop]: Abstraction has 47483 states and 98220 transitions. [2022-11-03 03:00:51,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 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) [2022-11-03 03:00:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 47483 states and 98220 transitions. [2022-11-03 03:00:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 03:00:51,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:00:51,690 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-03 03:00:51,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:00:51,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 03:00:51,894 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-11-03 03:00:51,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:00:51,895 INFO L85 PathProgramCache]: Analyzing trace with hash -979196829, now seen corresponding path program 2 times [2022-11-03 03:00:51,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:00:51,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213120427] [2022-11-03 03:00:51,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:00:51,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:00:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:00:53,947 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-03 03:00:53,947 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:00:53,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213120427] [2022-11-03 03:00:53,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213120427] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:00:53,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887188587] [2022-11-03 03:00:53,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:00:53,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:00:53,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:00:53,949 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:00:53,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:00:55,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:00:55,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:00:55,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-03 03:00:55,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:00:55,256 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 03:00:55,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:00:55,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:00:55,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 03:00:55,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:00:55,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:55,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:55,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:55,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:00:55,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:55,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:55,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:55,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:00:55,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:55,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:55,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:55,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:00:55,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:55,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:55,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:00:55,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:01:01,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:01,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:01,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:01,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:01,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:01:04,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-11-03 03:01:06,149 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-03 03:01:06,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:01:06,175 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3118 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3118 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3118 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3118 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-11-03 03:01:07,198 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse2 (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) 0)) (.cse3 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) (.cse4 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) (.cse5 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11))) (and (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store .cse2 .cse3 v_ArrVal_3110) .cse4 v_ArrVal_3113) .cse5 v_ArrVal_3115)))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= (select (select (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store .cse2 .cse3 v_ArrVal_3110) .cse4 v_ArrVal_3113) .cse5 v_ArrVal_3115)))) (store .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= (select (select (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store .cse2 .cse3 v_ArrVal_3110) .cse4 v_ArrVal_3113) .cse5 v_ArrVal_3115)))) (store .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) is different from false [2022-11-03 03:01:07,281 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse1 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse2 (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| Int)) (or (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 9) v_ArrVal_3110) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 10) v_ArrVal_3113) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 11) v_ArrVal_3115)))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| .cse3))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| .cse3) (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 9) v_ArrVal_3110) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 10) v_ArrVal_3113) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 11) v_ArrVal_3115)))) (store .cse4 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse4 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| .cse3) (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= 0 (select (select (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 9) v_ArrVal_3110) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 10) v_ArrVal_3113) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 11) v_ArrVal_3115)))) (store .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))))))) is different from false [2022-11-03 03:01:07,531 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse3 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5 0)))) (let ((.cse0 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse2 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~#a~1#1.base|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| .cse0) (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= (select (select (store (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse4 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 9) v_ArrVal_3110) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 10) v_ArrVal_3113) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 11) v_ArrVal_3115)))) (store .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| .cse0) (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= (select (select (store (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse4 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 9) v_ArrVal_3110) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 10) v_ArrVal_3113) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 11) v_ArrVal_3115)))) (store .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| .cse0) (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= (select (select (store (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse4 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 9) v_ArrVal_3110) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 10) v_ArrVal_3113) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 11) v_ArrVal_3115)))) (store .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))))))) is different from false [2022-11-03 03:01:15,902 INFO L356 Elim1Store]: treesize reduction 531, result has 28.6 percent of original size [2022-11-03 03:01:15,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 152 treesize of output 225 [2022-11-03 03:01:16,254 INFO L356 Elim1Store]: treesize reduction 50, result has 75.1 percent of original size [2022-11-03 03:01:16,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 238 treesize of output 334 [2022-11-03 03:01:16,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:01:16,814 INFO L356 Elim1Store]: treesize reduction 648, result has 12.9 percent of original size [2022-11-03 03:01:16,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 152 treesize of output 108 [2022-11-03 03:01:16,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:16,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:16,830 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:16,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:16,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:16,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:16,850 INFO L356 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2022-11-03 03:01:16,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 46 [2022-11-03 03:01:16,960 INFO L356 Elim1Store]: treesize reduction 743, result has 0.1 percent of original size [2022-11-03 03:01:16,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 152 treesize of output 1 [2022-11-03 03:01:17,577 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-03 03:01:17,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887188587] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:01:17,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1891198810] [2022-11-03 03:01:17,578 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-03 03:01:17,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:01:17,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 37 [2022-11-03 03:01:17,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774853408] [2022-11-03 03:01:17,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:01:17,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 03:01:17,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:01:17,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 03:01:17,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=981, Unknown=42, NotChecked=276, Total=1482 [2022-11-03 03:01:17,581 INFO L87 Difference]: Start difference. First operand 47483 states and 98220 transitions. Second operand has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 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) [2022-11-03 03:01:25,087 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse6 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse4 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse7 .cse6 0)))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse10 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse3 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse5 (select .cse4 |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse8 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#b1~0#1.base| 3)) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| .cse0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| .cse1) (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= (select (select (store (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse5 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 9) v_ArrVal_3110) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 10) v_ArrVal_3113) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 11) v_ArrVal_3115)))) (store .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6) 0)))) (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#a~1#1.base|) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (<= |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (<= |c_ULTIMATE.start_main_~i~5#1| 0) (<= |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| .cse0) (= (select .cse7 .cse8) 0) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_ULTIMATE.start_main_~#b2~0#1.base|)) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| .cse1) (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= (select (select (store (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse5 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 9) v_ArrVal_3110) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 10) v_ArrVal_3113) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 11) v_ArrVal_3115)))) (store .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse10) 0)))) (= |c_ULTIMATE.start_main_~i~5#1| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#pre~0.base| 3) (= (select .cse7 .cse10) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| .cse1) (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= (select (select (store (let ((.cse11 (store .cse4 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse5 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 9) v_ArrVal_3110) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 10) v_ArrVal_3113) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 11) v_ArrVal_3115)))) (store .cse11 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse11 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse8) 0)))) (not (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_~#pre~0.base|)))))) is different from false [2022-11-03 03:01:27,217 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse7 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse3 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse1 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse2 (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse8 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| Int)) (or (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 9) v_ArrVal_3110) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 10) v_ArrVal_3113) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 11) v_ArrVal_3115)))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| .cse4))) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| .cse4) (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= (select (select (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 9) v_ArrVal_3110) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 10) v_ArrVal_3113) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 11) v_ArrVal_3115)))) (store .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6) 0)))) (= (select .cse7 .cse6) 0) (= (select .cse7 .cse8) 0) (= |c_ULTIMATE.start_main_~i~5#1| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#pre~0.base| 3) (= (select .cse7 .cse3) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| .cse4) (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= 0 (select (select (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 9) v_ArrVal_3110) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 10) v_ArrVal_3113) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 11) v_ArrVal_3115)))) (store .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse8))))))) is different from false [2022-11-03 03:01:29,273 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse5 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse3 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse6 .cse5 0)))) (let ((.cse9 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse2 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse7 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#b1~0#1.base| 3)) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| .cse0) (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= (select (select (store (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse4 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 9) v_ArrVal_3110) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 10) v_ArrVal_3113) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 11) v_ArrVal_3115)))) (store .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5) 0)))) (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#a~1#1.base|) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (<= |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (= (select .cse6 .cse7) 0) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_ULTIMATE.start_main_~#b2~0#1.base|)) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| .cse0) (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= (select (select (store (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse4 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 9) v_ArrVal_3110) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 10) v_ArrVal_3113) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 11) v_ArrVal_3115)))) (store .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse9) 0)))) (= |c_~#pre~0.base| 3) (= (select .cse6 .cse9) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| .cse0) (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= (select (select (store (let ((.cse10 (store .cse3 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse4 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 9) v_ArrVal_3110) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 10) v_ArrVal_3113) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 11) v_ArrVal_3115)))) (store .cse10 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse10 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse7) 0)))))))) is different from false [2022-11-03 03:01:31,336 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse7 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse3 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse1 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse2 (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse8 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| Int)) (or (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 9) v_ArrVal_3110) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 10) v_ArrVal_3113) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 11) v_ArrVal_3115)))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| .cse4))) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| .cse4) (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= (select (select (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 9) v_ArrVal_3110) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 10) v_ArrVal_3113) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 11) v_ArrVal_3115)))) (store .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6) 0)))) (= (select .cse7 .cse6) 0) (= (select .cse7 .cse8) 0) (= |c_~#pre~0.base| 3) (= (select .cse7 .cse3) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| .cse4) (forall ((v_ArrVal_3115 Int) (v_ArrVal_3113 Int) (v_ArrVal_3118 (Array Int Int)) (v_ArrVal_3110 Int)) (= 0 (select (select (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 9) v_ArrVal_3110) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 10) v_ArrVal_3113) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2859| 11) v_ArrVal_3115)))) (store .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3118) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse8))))))) is different from false [2022-11-03 03:01:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:01:38,535 INFO L93 Difference]: Finished difference Result 48167 states and 99604 transitions. [2022-11-03 03:01:38,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 03:01:38,536 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 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) Word has length 21 [2022-11-03 03:01:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:01:38,631 INFO L225 Difference]: With dead ends: 48167 [2022-11-03 03:01:38,631 INFO L226 Difference]: Without dead ends: 48167 [2022-11-03 03:01:38,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 31.6s TimeCoverageRelationStatistics Valid=305, Invalid=1573, Unknown=46, NotChecked=728, Total=2652 [2022-11-03 03:01:38,632 INFO L413 NwaCegarLoop]: 446 mSDtfsCounter, 833 mSDsluCounter, 5474 mSDsCounter, 0 mSdLazyCounter, 4281 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 3656 SdHoareTripleChecker+Invalid, 15311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 4281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10928 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:01:38,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 3656 Invalid, 15311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 4281 Invalid, 0 Unknown, 10928 Unchecked, 9.2s Time] [2022-11-03 03:01:38,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48167 states. [2022-11-03 03:01:39,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48167 to 47493. [2022-11-03 03:01:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47493 states, 46143 states have (on average 2.1290336562425503) internal successors, (98240), 47492 states have internal predecessors, (98240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:01:39,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47493 states to 47493 states and 98240 transitions. [2022-11-03 03:01:39,491 INFO L78 Accepts]: Start accepts. Automaton has 47493 states and 98240 transitions. Word has length 21 [2022-11-03 03:01:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:01:39,491 INFO L495 AbstractCegarLoop]: Abstraction has 47493 states and 98240 transitions. [2022-11-03 03:01:39,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 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) [2022-11-03 03:01:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 47493 states and 98240 transitions. [2022-11-03 03:01:39,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 03:01:39,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:01:39,492 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-03 03:01:39,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:01:39,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 03:01:39,693 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-11-03 03:01:39,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:01:39,693 INFO L85 PathProgramCache]: Analyzing trace with hash -978613719, now seen corresponding path program 3 times [2022-11-03 03:01:39,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:01:39,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225315122] [2022-11-03 03:01:39,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:01:39,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:01:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:01:41,991 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-03 03:01:41,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:01:41,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225315122] [2022-11-03 03:01:41,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225315122] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:01:41,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282271087] [2022-11-03 03:01:41,992 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:01:41,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:01:41,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:01:41,994 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:01:41,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 03:01:45,305 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:01:45,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:01:45,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-03 03:01:45,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:01:45,332 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 03:01:45,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:01:45,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:01:45,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 03:01:45,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:01:45,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:45,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:45,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:45,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:01:45,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:45,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:45,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:45,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:01:45,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:45,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:45,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:45,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:01:45,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:45,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:45,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:45,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:45,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:45,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:45,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:01:54,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-11-03 03:02:02,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:02,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:02,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:02,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:02,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:02,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:02,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:02,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:02,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 70 [2022-11-03 03:02:04,342 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-03 03:02:04,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:02:04,379 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3442 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3442 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3442 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-11-03 03:02:04,591 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)))) (and (forall ((v_ArrVal_3442 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3442 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3442 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) is different from false [2022-11-03 03:02:04,613 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) (.cse2 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) (.cse3 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11))) (and (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store .cse0 .cse1 v_ArrVal_3437) .cse2 0) .cse3 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store .cse0 .cse1 v_ArrVal_3437) .cse2 0) .cse3 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store .cse0 .cse1 v_ArrVal_3437) .cse2 0) .cse3 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) is different from false [2022-11-03 03:02:04,658 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) (.cse2 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) (.cse3 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) (.cse4 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11))) (and (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store .cse0 .cse1 v_ArrVal_3434) .cse2 v_ArrVal_3437) .cse3 0) .cse4 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store .cse0 .cse1 v_ArrVal_3434) .cse2 v_ArrVal_3437) .cse3 0) .cse4 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store .cse0 .cse1 v_ArrVal_3434) .cse2 v_ArrVal_3437) .cse3 0) .cse4 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) is different from false [2022-11-03 03:02:04,720 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse1 (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= 0 (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))))))) is different from false [2022-11-03 03:02:06,863 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0)))) (let ((.cse0 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~#a~1#1.base|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0)))))))) is different from false [2022-11-03 03:02:07,071 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0) .cse4 0)))) (let ((.cse0 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~#a~1#1.base|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))))))) is different from false [2022-11-03 03:02:07,304 INFO L356 Elim1Store]: treesize reduction 478, result has 22.1 percent of original size [2022-11-03 03:02:07,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 case distinctions, treesize of input 77 treesize of output 148 [2022-11-03 03:02:07,321 INFO L356 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2022-11-03 03:02:07,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 141 treesize of output 105 [2022-11-03 03:02:07,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:02:07,483 INFO L356 Elim1Store]: treesize reduction 543, result has 11.6 percent of original size [2022-11-03 03:02:07,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 83 [2022-11-03 03:02:07,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:02:07,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 20 [2022-11-03 03:02:07,555 INFO L356 Elim1Store]: treesize reduction 613, result has 0.2 percent of original size [2022-11-03 03:02:07,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 1 [2022-11-03 03:02:07,714 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-03 03:02:07,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282271087] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:02:07,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [157489486] [2022-11-03 03:02:07,715 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-03 03:02:07,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:02:07,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 15] total 37 [2022-11-03 03:02:07,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120779243] [2022-11-03 03:02:07,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:02:07,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 03:02:07,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:02:07,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 03:02:07,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=831, Unknown=14, NotChecked=462, Total=1482 [2022-11-03 03:02:07,719 INFO L87 Difference]: Start difference. First operand 47493 states and 98240 transitions. Second operand has 39 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 38 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:02:16,606 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse3 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse5 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store .cse7 .cse3 0) .cse5 0)))) (let ((.cse0 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse4 (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse6 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0)))) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| .cse4) (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#a~1#1.base|) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5) 0)))) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (<= |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6) 0)))) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_~#pre~0.base|)) (<= |c_ULTIMATE.start_main_~i~5#1| 0) (<= |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| .cse4) (= (select .cse7 .cse6) 0) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_ULTIMATE.start_main_~#b2~0#1.base|)) (= |c_ULTIMATE.start_main_~i~5#1| 0) (= |c_~#pre~0.base| 3) (not (= |c_ULTIMATE.start_main_~#b1~0#1.base| |c_ULTIMATE.start_main_~#a~1#1.base|)))))) is different from false [2022-11-03 03:02:18,720 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse6 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse5 .cse6 0)))) (let ((.cse4 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~#a~1#1.base|))) (and (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0)))) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4) 0)))) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_~#pre~0.base|)) (= (select .cse5 .cse4) 0) (= |c_ULTIMATE.start_main_~i~5#1| 0) (= |c_~#pre~0.base| 3) (= (select .cse5 .cse3) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6) 0)))))))) is different from false [2022-11-03 03:02:20,772 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse3 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store .cse6 .cse3 0) .cse4 0)))) (let ((.cse0 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse5 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0)))) (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#a~1#1.base|) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4) 0)))) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (<= |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5) 0)))) (= (select .cse6 .cse5) 0) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_ULTIMATE.start_main_~#b2~0#1.base|)) (= |c_~#pre~0.base| 3) (not (= |c_ULTIMATE.start_main_~#b1~0#1.base| |c_ULTIMATE.start_main_~#a~1#1.base|)))))) is different from false [2022-11-03 03:02:22,853 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse1 (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse4 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse5 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2) 0)))) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0)))) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_~#pre~0.base|)) (= (select .cse4 .cse2) 0) (= (select .cse4 .cse3) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= 0 (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5))))) (= |c_ULTIMATE.start_main_~i~5#1| 0) (= |c_~#pre~0.base| 3) (= (select .cse4 .cse5) 0))) is different from false [2022-11-03 03:02:24,886 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse6 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse5 .cse6 0)))) (let ((.cse4 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~#a~1#1.base|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0)))) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4) 0)))) (= (select .cse5 .cse4) 0) (= |c_~#pre~0.base| 3) (= (select .cse5 .cse3) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6) 0)))))))) is different from false [2022-11-03 03:02:26,956 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse1 (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse4 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse5 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2) 0)))) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0)))) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (= (select .cse4 .cse2) 0) (= (select .cse4 .cse3) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| .cse0) (forall ((v_ArrVal_3437 Int) (v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3434 Int)) (= 0 (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 8) v_ArrVal_3434) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 9) v_ArrVal_3437) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2860| 11) 0)) |c_~#pre~0.base| v_ArrVal_3442) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5))))) (= |c_~#pre~0.base| 3) (= (select .cse4 .cse5) 0))) is different from false [2022-11-03 03:02:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:02:33,742 INFO L93 Difference]: Finished difference Result 48553 states and 100389 transitions. [2022-11-03 03:02:33,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 03:02:33,742 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 38 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have 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-03 03:02:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:02:33,850 INFO L225 Difference]: With dead ends: 48553 [2022-11-03 03:02:33,850 INFO L226 Difference]: Without dead ends: 48553 [2022-11-03 03:02:33,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 35.0s TimeCoverageRelationStatistics Valid=254, Invalid=1184, Unknown=20, NotChecked=1092, Total=2550 [2022-11-03 03:02:33,851 INFO L413 NwaCegarLoop]: 446 mSDtfsCounter, 1405 mSDsluCounter, 5574 mSDsCounter, 0 mSdLazyCounter, 5539 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 3487 SdHoareTripleChecker+Invalid, 16202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 5539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10486 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:02:33,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 3487 Invalid, 16202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 5539 Invalid, 0 Unknown, 10486 Unchecked, 12.0s Time] [2022-11-03 03:02:33,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48553 states. [2022-11-03 03:02:34,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48553 to 47507. [2022-11-03 03:02:34,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47507 states, 46157 states have (on average 2.1290161838941004) internal successors, (98269), 47506 states have internal predecessors, (98269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:02:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47507 states to 47507 states and 98269 transitions. [2022-11-03 03:02:34,861 INFO L78 Accepts]: Start accepts. Automaton has 47507 states and 98269 transitions. Word has length 21 [2022-11-03 03:02:34,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:02:34,862 INFO L495 AbstractCegarLoop]: Abstraction has 47507 states and 98269 transitions. [2022-11-03 03:02:34,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 38 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:02:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 47507 states and 98269 transitions. [2022-11-03 03:02:34,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 03:02:34,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:02:34,863 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-03 03:02:34,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 03:02:35,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:02:35,064 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-11-03 03:02:35,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:02:35,065 INFO L85 PathProgramCache]: Analyzing trace with hash -994822689, now seen corresponding path program 4 times [2022-11-03 03:02:35,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:02:35,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847348507] [2022-11-03 03:02:35,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:02:35,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:02:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:02:37,207 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-03 03:02:37,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:02:37,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847348507] [2022-11-03 03:02:37,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847348507] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:02:37,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131619653] [2022-11-03 03:02:37,208 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:02:37,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:02:37,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:02:37,215 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:02:37,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 03:02:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:02:37,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-03 03:02:37,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:02:37,726 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 03:02:37,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:02:37,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:02:37,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 03:02:38,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:02:38,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:38,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:38,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:38,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:02:38,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:38,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:38,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:38,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:02:38,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:38,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:38,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:38,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:02:38,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:38,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:38,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:38,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:02:46,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:46,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:46,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:46,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:46,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:46,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:46,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:46,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:02:46,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 70 [2022-11-03 03:02:48,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2022-11-03 03:02:50,842 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-03 03:02:50,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:02:50,871 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3770 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3770 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3770 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3770 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-11-03 03:02:50,907 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_3770 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_3770 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3770 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3770 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) is different from false [2022-11-03 03:02:51,805 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse2 (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) 0)) (.cse3 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) (.cse4 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) (.cse5 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11))) (and (forall ((v_ArrVal_3770 (Array Int Int)) (v_ArrVal_3764 Int) (v_ArrVal_3762 Int)) (= (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store .cse2 .cse3 v_ArrVal_3762) .cse4 v_ArrVal_3764) .cse5 0)))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3770 (Array Int Int)) (v_ArrVal_3764 Int) (v_ArrVal_3762 Int)) (= (select (select (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store .cse2 .cse3 v_ArrVal_3762) .cse4 v_ArrVal_3764) .cse5 0)))) (store .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3770 (Array Int Int)) (v_ArrVal_3764 Int) (v_ArrVal_3762 Int)) (= (select (select (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store .cse2 .cse3 v_ArrVal_3762) .cse4 v_ArrVal_3764) .cse5 0)))) (store .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) is different from false [2022-11-03 03:02:51,856 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse2 (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ 20 |c_ULTIMATE.start_main_~#a~1#1.offset|) 0)) (.cse3 (+ 21 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse4 (+ 22 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse5 (+ 23 |c_ULTIMATE.start_main_~#a~1#1.offset|))) (and (forall ((v_ArrVal_3770 (Array Int Int)) (v_ArrVal_3764 Int) (v_ArrVal_3762 Int)) (= (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store .cse2 .cse3 v_ArrVal_3762) .cse4 v_ArrVal_3764) .cse5 0)))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3770 (Array Int Int)) (v_ArrVal_3764 Int) (v_ArrVal_3762 Int)) (= (select (select (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store .cse2 .cse3 v_ArrVal_3762) .cse4 v_ArrVal_3764) .cse5 0)))) (store .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3770 (Array Int Int)) (v_ArrVal_3764 Int) (v_ArrVal_3762 Int)) (= (select (select (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store .cse2 .cse3 v_ArrVal_3762) .cse4 v_ArrVal_3764) .cse5 0)))) (store .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) is different from false [2022-11-03 03:02:51,952 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse2 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse9 0)))) (let ((.cse1 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (store (select .cse2 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ 20 |c_ULTIMATE.start_main_~#a~1#1.offset|) 0)) (.cse4 (+ 21 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse5 (+ 22 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse6 (+ 23 |c_ULTIMATE.start_main_~#a~1#1.offset|))) (and (forall ((v_ArrVal_3770 (Array Int Int)) (v_ArrVal_3764 Int) (v_ArrVal_3762 Int)) (= (select (select (store (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store .cse3 .cse4 v_ArrVal_3762) .cse5 v_ArrVal_3764) .cse6 0)))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3770 (Array Int Int)) (v_ArrVal_3764 Int) (v_ArrVal_3762 Int)) (= (select (select (store (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store .cse3 .cse4 v_ArrVal_3762) .cse5 v_ArrVal_3764) .cse6 0)))) (store .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3770 (Array Int Int)) (v_ArrVal_3764 Int) (v_ArrVal_3762 Int)) (= (select (select (store (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store .cse3 .cse4 v_ArrVal_3762) .cse5 v_ArrVal_3764) .cse6 0)))) (store .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse9) 0)))))) is different from false [2022-11-03 03:02:52,026 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse9 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse2 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse7 0) .cse9 0)))) (let ((.cse1 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (store (select .cse2 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ 20 |c_ULTIMATE.start_main_~#a~1#1.offset|) 0)) (.cse4 (+ 21 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse5 (+ 22 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse6 (+ 23 |c_ULTIMATE.start_main_~#a~1#1.offset|))) (and (forall ((v_ArrVal_3770 (Array Int Int)) (v_ArrVal_3764 Int) (v_ArrVal_3762 Int)) (= (select (select (store (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store .cse3 .cse4 v_ArrVal_3762) .cse5 v_ArrVal_3764) .cse6 0)))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse7) 0)) (forall ((v_ArrVal_3770 (Array Int Int)) (v_ArrVal_3764 Int) (v_ArrVal_3762 Int)) (= (select (select (store (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store .cse3 .cse4 v_ArrVal_3762) .cse5 v_ArrVal_3764) .cse6 0)))) (store .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse9) 0)) (forall ((v_ArrVal_3770 (Array Int Int)) (v_ArrVal_3764 Int) (v_ArrVal_3762 Int)) (= 0 (select (select (store (let ((.cse10 (store .cse2 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store .cse3 .cse4 v_ArrVal_3762) .cse5 v_ArrVal_3764) .cse6 0)))) (store .cse10 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse10 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_3770) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))))))) is different from false [2022-11-03 03:02:52,321 INFO L356 Elim1Store]: treesize reduction 592, result has 22.7 percent of original size [2022-11-03 03:02:52,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 152 treesize of output 186 [2022-11-03 03:02:52,514 INFO L356 Elim1Store]: treesize reduction 104, result has 50.2 percent of original size [2022-11-03 03:02:52,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 199 treesize of output 249 [2022-11-03 03:02:52,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:02:52,898 INFO L356 Elim1Store]: treesize reduction 705, result has 8.0 percent of original size [2022-11-03 03:02:52,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 152 treesize of output 73 [2022-11-03 03:02:52,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:02:52,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:02:52,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:02:52,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:02:52,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2022-11-03 03:02:53,113 INFO L356 Elim1Store]: treesize reduction 695, result has 9.3 percent of original size [2022-11-03 03:02:53,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 152 treesize of output 83 [2022-11-03 03:02:53,314 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:02:53,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:02:53,318 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:02:53,318 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:02:53,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:02:53,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:02:53,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:02:53,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 20 [2022-11-03 03:02:53,622 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-03 03:02:53,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131619653] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:02:53,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [837980512] [2022-11-03 03:02:53,622 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-03 03:02:53,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:02:53,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 39 [2022-11-03 03:02:53,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185749709] [2022-11-03 03:02:53,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:02:53,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-03 03:02:53,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:02:53,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-03 03:02:53,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1015, Unknown=17, NotChecked=426, Total=1640 [2022-11-03 03:02:53,625 INFO L87 Difference]: Start difference. First operand 47507 states and 98269 transitions. Second operand has 41 states, 40 states have (on average 1.5) internal successors, (60), 40 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-03 03:03:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:03:27,804 INFO L93 Difference]: Finished difference Result 58711 states and 121290 transitions. [2022-11-03 03:03:27,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 03:03:27,805 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.5) internal successors, (60), 40 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-03 03:03:27,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:03:27,939 INFO L225 Difference]: With dead ends: 58711 [2022-11-03 03:03:27,939 INFO L226 Difference]: Without dead ends: 58711 [2022-11-03 03:03:27,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 19 SyntacticMatches, 10 SemanticMatches, 56 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=438, Invalid=2217, Unknown=21, NotChecked=630, Total=3306 [2022-11-03 03:03:27,941 INFO L413 NwaCegarLoop]: 450 mSDtfsCounter, 2411 mSDsluCounter, 7132 mSDsCounter, 0 mSdLazyCounter, 10353 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2411 SdHoareTripleChecker+Valid, 3896 SdHoareTripleChecker+Invalid, 25056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 10353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14051 IncrementalHoareTripleChecker+Unchecked, 18.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:03:27,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2411 Valid, 3896 Invalid, 25056 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [652 Valid, 10353 Invalid, 0 Unknown, 14051 Unchecked, 18.6s Time] [2022-11-03 03:03:28,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58711 states. [2022-11-03 03:03:28,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58711 to 47537. [2022-11-03 03:03:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47537 states, 46187 states have (on average 2.1289323835711347) internal successors, (98329), 47536 states have internal predecessors, (98329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:03:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47537 states to 47537 states and 98329 transitions. [2022-11-03 03:03:28,946 INFO L78 Accepts]: Start accepts. Automaton has 47537 states and 98329 transitions. Word has length 21 [2022-11-03 03:03:28,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:03:28,946 INFO L495 AbstractCegarLoop]: Abstraction has 47537 states and 98329 transitions. [2022-11-03 03:03:28,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.5) internal successors, (60), 40 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-03 03:03:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 47537 states and 98329 transitions. [2022-11-03 03:03:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 03:03:28,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:03:28,948 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-03 03:03:28,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-03 03:03:29,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:03:29,149 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-11-03 03:03:29,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:03:29,149 INFO L85 PathProgramCache]: Analyzing trace with hash 659935211, now seen corresponding path program 5 times [2022-11-03 03:03:29,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:03:29,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810715827] [2022-11-03 03:03:29,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:03:29,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:03:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:03:31,170 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-03 03:03:31,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:03:31,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810715827] [2022-11-03 03:03:31,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810715827] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:03:31,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79863000] [2022-11-03 03:03:31,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:03:31,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:03:31,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:03:31,174 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:03:31,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 03:03:33,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:03:33,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:03:33,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-03 03:03:33,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:03:33,066 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 03:03:33,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:03:33,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:03:33,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 03:03:33,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:03:33,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:03:33,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:03:33,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:03:33,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:03:33,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:03:33,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:03:33,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:03:33,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:03:33,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:03:33,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:03:33,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:03:33,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:03:33,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:03:37,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:03:37,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:03:37,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:03:37,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:03:37,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:03:40,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-11-03 03:03:42,137 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-03 03:03:42,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:03:42,169 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4096 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4096) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4096 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4096) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4096 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4096) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4096 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4096) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-11-03 03:03:42,195 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_4096 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_4096) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4096 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_4096) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4096 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_4096) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4096 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_4096) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) is different from false [2022-11-03 03:03:43,321 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) (.cse7 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse8 (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) (.cse9 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10))) (and (forall ((v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (let ((.cse2 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store .cse8 .cse5 v_ArrVal_4086) .cse9 v_ArrVal_4088)))) (store .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse7 0))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base|))) (or (forall ((v_ArrVal_4093 Int) (v_ArrVal_4096 (Array Int Int))) (= (select (select (store (let ((.cse0 (store .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store .cse3 .cse4 v_ArrVal_4093)))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_4096) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (not (= (select .cse3 .cse5) 0)))))) (forall ((v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (let ((.cse11 (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store .cse8 .cse5 v_ArrVal_4086) .cse9 v_ArrVal_4088)))) (store .cse13 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse13 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse7 0))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_worker_fn_~a~0#1.base|))) (or (forall ((v_ArrVal_4093 Int) (v_ArrVal_4096 (Array Int Int))) (= (select (select (store (let ((.cse10 (store .cse11 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store .cse12 .cse4 v_ArrVal_4093)))) (store .cse10 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse10 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_4096) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (not (= (select .cse12 .cse5) 0)))))) (forall ((v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (let ((.cse15 (let ((.cse17 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store .cse8 .cse5 v_ArrVal_4086) .cse9 v_ArrVal_4088)))) (store .cse17 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse17 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse7 0))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_worker_fn_~a~0#1.base|))) (or (forall ((v_ArrVal_4093 Int) (v_ArrVal_4096 (Array Int Int))) (= 0 (select (select (store (let ((.cse14 (store .cse15 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store .cse16 .cse4 v_ArrVal_4093)))) (store .cse14 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse14 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_4096) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse7))) (not (= (select .cse16 .cse5) 0)))))))) is different from false [2022-11-03 03:03:46,614 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse9 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5 0)))) (let ((.cse1 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (+ 23 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse8 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse10 (select .cse9 |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse11 (+ 20 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse6 (+ 21 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse12 (+ 22 |c_ULTIMATE.start_main_~#a~1#1.offset|))) (and (forall ((v_ArrVal_4085 Int) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (let ((.cse2 (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store .cse10 .cse11 v_ArrVal_4085) .cse6 v_ArrVal_4086) .cse12 v_ArrVal_4088)))) (store .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse8 0))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#a~1#1.base|))) (or (forall ((v_ArrVal_4093 Int) (v_ArrVal_4096 (Array Int Int))) (= (select (select (store (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#a~1#1.base| (store .cse3 .cse4 v_ArrVal_4093)))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_4096) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5) 0)) (not (= (select .cse3 .cse6) 0)))))) (forall ((v_ArrVal_4085 Int) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (let ((.cse14 (let ((.cse16 (store .cse9 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store .cse10 .cse11 v_ArrVal_4085) .cse6 v_ArrVal_4086) .cse12 v_ArrVal_4088)))) (store .cse16 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse16 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse8 0))))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#a~1#1.base|))) (or (forall ((v_ArrVal_4093 Int) (v_ArrVal_4096 (Array Int Int))) (= (select (select (store (let ((.cse13 (store .cse14 |c_ULTIMATE.start_main_~#a~1#1.base| (store .cse15 .cse4 v_ArrVal_4093)))) (store .cse13 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse13 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_4096) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse8) 0)) (not (= (select .cse15 .cse6) 0)))))) (forall ((v_ArrVal_4085 Int) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (let ((.cse19 (let ((.cse20 (store .cse9 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store .cse10 .cse11 v_ArrVal_4085) .cse6 v_ArrVal_4086) .cse12 v_ArrVal_4088)))) (store .cse20 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse20 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse8 0))))) (let ((.cse17 (select .cse19 |c_ULTIMATE.start_main_~#a~1#1.base|))) (or (not (= (select .cse17 .cse6) 0)) (forall ((v_ArrVal_4093 Int) (v_ArrVal_4096 (Array Int Int))) (= (select (select (store (let ((.cse18 (store .cse19 |c_ULTIMATE.start_main_~#a~1#1.base| (store .cse17 .cse4 v_ArrVal_4093)))) (store .cse18 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse18 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_4096) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))))))))) is different from false [2022-11-03 03:03:47,015 INFO L356 Elim1Store]: treesize reduction 502, result has 31.5 percent of original size [2022-11-03 03:03:47,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 509 treesize of output 269 [2022-11-03 03:03:47,309 INFO L356 Elim1Store]: treesize reduction 42, result has 79.9 percent of original size [2022-11-03 03:03:47,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 256 treesize of output 368 [2022-11-03 03:03:47,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:03:47,815 INFO L356 Elim1Store]: treesize reduction 603, result has 17.7 percent of original size [2022-11-03 03:03:47,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 509 treesize of output 168 [2022-11-03 03:03:47,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:03:47,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:03:47,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:03:47,841 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:03:47,842 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:03:47,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:03:47,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:03:47,878 INFO L356 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-03 03:03:47,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 96 treesize of output 68 [2022-11-03 03:03:48,188 INFO L356 Elim1Store]: treesize reduction 615, result has 16.1 percent of original size [2022-11-03 03:03:48,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 509 treesize of output 156 [2022-11-03 03:03:48,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:03:48,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:03:48,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:03:48,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:03:48,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:03:48,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:03:48,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:03:48,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:03:48,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:03:48,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:03:48,276 INFO L356 Elim1Store]: treesize reduction 10, result has 75.6 percent of original size [2022-11-03 03:03:48,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 104 [2022-11-03 03:03:48,862 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-03 03:03:48,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79863000] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:03:48,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [247628013] [2022-11-03 03:03:48,863 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-03 03:03:48,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:03:48,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 15] total 38 [2022-11-03 03:03:48,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790805033] [2022-11-03 03:03:48,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:03:48,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-03 03:03:48,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:03:48,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-03 03:03:48,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1071, Unknown=40, NotChecked=284, Total=1560 [2022-11-03 03:03:48,867 INFO L87 Difference]: Start difference. First operand 47537 states and 98329 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-03 03:05:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:05:26,859 INFO L93 Difference]: Finished difference Result 106122 states and 219639 transitions. [2022-11-03 03:05:26,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 03:05:26,860 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-03 03:05:26,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:05:27,126 INFO L225 Difference]: With dead ends: 106122 [2022-11-03 03:05:27,126 INFO L226 Difference]: Without dead ends: 106122 [2022-11-03 03:05:27,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 32 SyntacticMatches, 16 SemanticMatches, 58 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 91.4s TimeCoverageRelationStatistics Valid=519, Invalid=2520, Unknown=57, NotChecked=444, Total=3540 [2022-11-03 03:05:27,128 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 4581 mSDsluCounter, 7651 mSDsCounter, 0 mSdLazyCounter, 10481 mSolverCounterSat, 1180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4581 SdHoareTripleChecker+Valid, 4119 SdHoareTripleChecker+Invalid, 28098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1180 IncrementalHoareTripleChecker+Valid, 10481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16437 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:05:27,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4581 Valid, 4119 Invalid, 28098 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1180 Valid, 10481 Invalid, 0 Unknown, 16437 Unchecked, 18.9s Time] [2022-11-03 03:05:27,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106122 states. [2022-11-03 03:05:28,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106122 to 47567. [2022-11-03 03:05:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47567 states, 46217 states have (on average 2.1288486920397256) internal successors, (98389), 47566 states have internal predecessors, (98389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:05:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47567 states to 47567 states and 98389 transitions. [2022-11-03 03:05:28,601 INFO L78 Accepts]: Start accepts. Automaton has 47567 states and 98389 transitions. Word has length 21 [2022-11-03 03:05:28,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:05:28,602 INFO L495 AbstractCegarLoop]: Abstraction has 47567 states and 98389 transitions. [2022-11-03 03:05:28,602 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-03 03:05:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 47567 states and 98389 transitions. [2022-11-03 03:05:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 03:05:28,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:05:28,603 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-03 03:05:28,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 03:05:28,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:05:28,806 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-11-03 03:05:28,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:05:28,806 INFO L85 PathProgramCache]: Analyzing trace with hash 660518321, now seen corresponding path program 6 times [2022-11-03 03:05:28,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:05:28,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378426140] [2022-11-03 03:05:28,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:05:28,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:05:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:05:30,910 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-03 03:05:30,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:05:30,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378426140] [2022-11-03 03:05:30,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378426140] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:05:30,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114699094] [2022-11-03 03:05:30,910 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:05:30,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:05:30,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:05:30,912 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:05:30,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb560150-4691-47df-b68b-e85a4d9e9732/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 03:05:33,294 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:05:33,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:05:33,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-03 03:05:33,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:05:33,328 INFO L356 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2022-11-03 03:05:33,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 37 [2022-11-03 03:05:33,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:05:33,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 03:05:33,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:05:33,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:05:33,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:05:33,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:05:33,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:05:33,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:05:33,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:05:33,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:05:33,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:05:33,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:05:33,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:05:33,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:05:33,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:05:33,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:05:37,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-03 03:05:42,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:05:42,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:05:42,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:05:42,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:05:42,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:05:44,105 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-03 03:05:44,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:05:44,134 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4423 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4423) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4423 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4423) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4423 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4423) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-11-03 03:05:44,226 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)))) (and (forall ((v_ArrVal_4423 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_4423) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4423 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_4423) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4423 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_4423) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) is different from false [2022-11-03 03:05:44,439 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) (.cse3 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10))) (and (forall ((v_ArrVal_4418 Int) (v_ArrVal_4423 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store .cse4 .cse5 v_ArrVal_4418)))) (store .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0))))) (store .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_4423) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_4418 Int) (v_ArrVal_4423 (Array Int Int))) (= (select (select (store (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store .cse4 .cse5 v_ArrVal_4418)))) (store .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0))))) (store .cse6 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse6 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_4423) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4418 Int) (v_ArrVal_4423 (Array Int Int))) (= (select (select (store (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store .cse4 .cse5 v_ArrVal_4418)))) (store .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0))))) (store .cse8 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse8 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_4423) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) is different from false [2022-11-03 03:05:44,492 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) (.cse4 (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) (.cse6 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) (.cse3 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (forall ((v_ArrVal_4418 Int) (v_ArrVal_4416 Int) (v_ArrVal_4423 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store .cse4 .cse5 v_ArrVal_4416) .cse6 v_ArrVal_4418)))) (store .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0))))) (store .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_4423) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4418 Int) (v_ArrVal_4416 Int) (v_ArrVal_4423 (Array Int Int))) (= (select (select (store (let ((.cse7 (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store .cse4 .cse5 v_ArrVal_4416) .cse6 v_ArrVal_4418)))) (store .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0))))) (store .cse7 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse7 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_4423) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4418 Int) (v_ArrVal_4416 Int) (v_ArrVal_4423 (Array Int Int))) (= (select (select (store (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store .cse4 .cse5 v_ArrVal_4416) .cse6 v_ArrVal_4418)))) (store .cse10 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse10 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0))))) (store .cse9 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse9 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_4423) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0)))) is different from false [2022-11-03 03:05:44,559 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) (.cse3 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) (.cse6 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) (.cse7 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10))) (and (forall ((v_ArrVal_4418 Int) (v_ArrVal_4416 Int) (v_ArrVal_4414 Int) (v_ArrVal_4423 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store .cse4 .cse5 v_ArrVal_4414) .cse6 v_ArrVal_4416) .cse7 v_ArrVal_4418)))) (store .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0))))) (store .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_4423) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_4418 Int) (v_ArrVal_4416 Int) (v_ArrVal_4414 Int) (v_ArrVal_4423 (Array Int Int))) (= (select (select (store (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store .cse4 .cse5 v_ArrVal_4414) .cse6 v_ArrVal_4416) .cse7 v_ArrVal_4418)))) (store .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0))))) (store .cse8 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse8 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_4423) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4418 Int) (v_ArrVal_4416 Int) (v_ArrVal_4414 Int) (v_ArrVal_4423 (Array Int Int))) (= 0 (select (select (store (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store .cse4 .cse5 v_ArrVal_4414) .cse6 v_ArrVal_4416) .cse7 v_ArrVal_4418)))) (store .cse11 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse11 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0))))) (store .cse10 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse10 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse1 0))) |c_~#pre~0.base| v_ArrVal_4423) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))))) is different from false [2022-11-03 03:05:44,729 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse3 (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse2 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2863| Int)) (or (forall ((v_ArrVal_4418 Int) (v_ArrVal_4416 Int) (v_ArrVal_4414 Int) (v_ArrVal_4423 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store .cse3 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2863| 8) v_ArrVal_4414) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2863| 9) v_ArrVal_4416) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2863| 10) v_ArrVal_4418)))) (store .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2 0))))) (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2863| 11) 0))) |c_~#pre~0.base| v_ArrVal_4423) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2863| .cse4))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2863| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2863| .cse4) (forall ((v_ArrVal_4418 Int) (v_ArrVal_4416 Int) (v_ArrVal_4414 Int) (v_ArrVal_4423 (Array Int Int))) (= (select (select (store (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store .cse3 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2863| 8) v_ArrVal_4414) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2863| 9) v_ArrVal_4416) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2863| 10) v_ArrVal_4418)))) (store .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2 0))))) (store .cse5 |c_ULTIMATE.start_main_~#a~1#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2863| 11) 0))) |c_~#pre~0.base| v_ArrVal_4423) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2863| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2863| .cse4) (forall ((v_ArrVal_4418 Int) (v_ArrVal_4416 Int) (v_ArrVal_4414 Int) (v_ArrVal_4423 (Array Int Int))) (= (select (select (store (let ((.cse7 (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store .cse3 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2863| 8) v_ArrVal_4414) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2863| 9) v_ArrVal_4416) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2863| 10) v_ArrVal_4418)))) (store .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2 0))))) (store .cse7 |c_ULTIMATE.start_main_~#a~1#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2863| 11) 0))) |c_~#pre~0.base| v_ArrVal_4423) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2) 0)))))) is different from false [2022-11-03 03:06:07,509 WARN L234 SmtUtils]: Spent 9.35s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:06:07,761 INFO L356 Elim1Store]: treesize reduction 386, result has 30.5 percent of original size [2022-11-03 03:06:07,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 case distinctions, treesize of input 242 treesize of output 181 [2022-11-03 03:06:07,955 INFO L356 Elim1Store]: treesize reduction 39, result has 74.2 percent of original size [2022-11-03 03:06:07,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 194 treesize of output 257 [2022-11-03 03:06:08,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:06:08,255 INFO L356 Elim1Store]: treesize reduction 554, result has 0.2 percent of original size [2022-11-03 03:06:08,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 242 treesize of output 1 [2022-11-03 03:06:08,446 INFO L356 Elim1Store]: treesize reduction 494, result has 11.0 percent of original size [2022-11-03 03:06:08,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 242 treesize of output 73 [2022-11-03 03:06:08,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:06:08,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16