./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-more-parray-copy.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427002b2-d7f4-477d-af7b-b5d8bbcd9d34/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427002b2-d7f4-477d-af7b-b5d8bbcd9d34/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427002b2-d7f4-477d-af7b-b5d8bbcd9d34/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427002b2-d7f4-477d-af7b-b5d8bbcd9d34/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-parray-copy.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427002b2-d7f4-477d-af7b-b5d8bbcd9d34/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427002b2-d7f4-477d-af7b-b5d8bbcd9d34/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7aea5f8d9182df5a5d01671c1aa4ef829b038428d2f68272ec4ea6e120e3973d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:04:00,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:04:00,538 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427002b2-d7f4-477d-af7b-b5d8bbcd9d34/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 12:04:00,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:04:00,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:04:00,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:04:00,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:04:00,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:04:00,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:04:00,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:04:00,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:04:00,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:04:00,607 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:04:00,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:04:00,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 12:04:00,610 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:04:00,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:04:00,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:04:00,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:04:00,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 12:04:00,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:04:00,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 12:04:00,613 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 12:04:00,614 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 12:04:00,614 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:04:00,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:04:00,615 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:04:00,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:04:00,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:04:00,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:04:00,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:04:00,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:04:00,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:04:00,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 12:04:00,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:04:00,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:04:00,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:04:00,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:04:00,621 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 12:04:00,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:04:00,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:04:00,622 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_427002b2-d7f4-477d-af7b-b5d8bbcd9d34/bin/uautomizer-verify-VRDe98Ueme/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_427002b2-d7f4-477d-af7b-b5d8bbcd9d34/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Automizer 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 -> 7aea5f8d9182df5a5d01671c1aa4ef829b038428d2f68272ec4ea6e120e3973d [2023-11-26 12:04:00,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:04:00,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:04:00,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:04:00,913 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:04:00,913 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:04:00,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427002b2-d7f4-477d-af7b-b5d8bbcd9d34/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/weaver/popl20-more-parray-copy.wvr.c [2023-11-26 12:04:04,060 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:04:04,350 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:04:04,351 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427002b2-d7f4-477d-af7b-b5d8bbcd9d34/sv-benchmarks/c/weaver/popl20-more-parray-copy.wvr.c [2023-11-26 12:04:04,364 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427002b2-d7f4-477d-af7b-b5d8bbcd9d34/bin/uautomizer-verify-VRDe98Ueme/data/3c33217f6/96b6fd31e5394d2aa63cd6c719bfdd3a/FLAG879359785 [2023-11-26 12:04:04,383 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427002b2-d7f4-477d-af7b-b5d8bbcd9d34/bin/uautomizer-verify-VRDe98Ueme/data/3c33217f6/96b6fd31e5394d2aa63cd6c719bfdd3a [2023-11-26 12:04:04,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:04:04,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:04:04,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:04:04,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:04:04,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:04:04,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:04:04" (1/1) ... [2023-11-26 12:04:04,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@333efa43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:04, skipping insertion in model container [2023-11-26 12:04:04,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:04:04" (1/1) ... [2023-11-26 12:04:04,432 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:04:04,733 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:04:04,746 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:04:04,800 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:04:04,825 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:04:04,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:04 WrapperNode [2023-11-26 12:04:04,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:04:04,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:04:04,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:04:04,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:04:04,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:04" (1/1) ... [2023-11-26 12:04:04,850 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:04" (1/1) ... [2023-11-26 12:04:04,890 INFO L138 Inliner]: procedures = 24, calls = 42, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 226 [2023-11-26 12:04:04,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:04:04,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:04:04,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:04:04,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:04:04,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:04" (1/1) ... [2023-11-26 12:04:04,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:04" (1/1) ... [2023-11-26 12:04:04,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:04" (1/1) ... [2023-11-26 12:04:04,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:04" (1/1) ... [2023-11-26 12:04:04,936 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:04" (1/1) ... [2023-11-26 12:04:04,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:04" (1/1) ... [2023-11-26 12:04:04,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:04" (1/1) ... [2023-11-26 12:04:04,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:04" (1/1) ... [2023-11-26 12:04:04,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:04:04,961 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:04:04,961 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:04:04,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:04:04,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:04" (1/1) ... [2023-11-26 12:04:04,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:04:04,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427002b2-d7f4-477d-af7b-b5d8bbcd9d34/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:04:05,003 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427002b2-d7f4-477d-af7b-b5d8bbcd9d34/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:04:05,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427002b2-d7f4-477d-af7b-b5d8bbcd9d34/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:04:05,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:04:05,054 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-26 12:04:05,054 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-26 12:04:05,054 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-26 12:04:05,054 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-26 12:04:05,055 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-26 12:04:05,055 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-26 12:04:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 12:04:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 12:04:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 12:04:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 12:04:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:04:05,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:04:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 12:04:05,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:04:05,063 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 12:04:05,241 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:04:05,244 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:04:05,921 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:04:05,945 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:04:05,945 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-26 12:04:05,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:04:05 BoogieIcfgContainer [2023-11-26 12:04:05,947 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:04:05,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:04:05,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:04:05,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:04:05,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:04:04" (1/3) ... [2023-11-26 12:04:05,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4901bd20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:04:05, skipping insertion in model container [2023-11-26 12:04:05,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:04" (2/3) ... [2023-11-26 12:04:05,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4901bd20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:04:05, skipping insertion in model container [2023-11-26 12:04:05,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:04:05" (3/3) ... [2023-11-26 12:04:05,957 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-parray-copy.wvr.c [2023-11-26 12:04:05,966 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 12:04:05,978 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:04:05,979 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2023-11-26 12:04:05,979 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 12:04:06,118 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-26 12:04:06,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 386 places, 395 transitions, 811 flow [2023-11-26 12:04:06,377 INFO L124 PetriNetUnfolderBase]: 19/392 cut-off events. [2023-11-26 12:04:06,377 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-26 12:04:06,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 392 events. 19/392 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 546 event pairs, 0 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 262. Up to 2 conditions per place. [2023-11-26 12:04:06,389 INFO L82 GeneralOperation]: Start removeDead. Operand has 386 places, 395 transitions, 811 flow [2023-11-26 12:04:06,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 359 places, 367 transitions, 752 flow [2023-11-26 12:04:06,411 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:04:06,418 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@22cf0643, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:04:06,418 INFO L358 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2023-11-26 12:04:06,423 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:04:06,424 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2023-11-26 12:04:06,424 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:04:06,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:06,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:06,425 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-26 12:04:06,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:06,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1079599212, now seen corresponding path program 1 times [2023-11-26 12:04:06,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:06,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885447747] [2023-11-26 12:04:06,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:06,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:06,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:06,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885447747] [2023-11-26 12:04:06,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885447747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:06,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:06,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:04:06,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496774051] [2023-11-26 12:04:06,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:06,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:04:06,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:06,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:04:06,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:04:06,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 395 [2023-11-26 12:04:06,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 367 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:06,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:06,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 395 [2023-11-26 12:04:06,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:06,949 INFO L124 PetriNetUnfolderBase]: 21/582 cut-off events. [2023-11-26 12:04:06,950 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-11-26 12:04:06,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 582 events. 21/582 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1845 event pairs, 7 based on Foata normal form. 20/511 useless extension candidates. Maximal degree in co-relation 355. Up to 31 conditions per place. [2023-11-26 12:04:06,959 INFO L140 encePairwiseOnDemand]: 381/395 looper letters, 13 selfloop transitions, 2 changer transitions 6/355 dead transitions. [2023-11-26 12:04:06,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 355 transitions, 758 flow [2023-11-26 12:04:06,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:04:06,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:04:06,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1122 transitions. [2023-11-26 12:04:06,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9468354430379747 [2023-11-26 12:04:06,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1122 transitions. [2023-11-26 12:04:06,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1122 transitions. [2023-11-26 12:04:06,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:06,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1122 transitions. [2023-11-26 12:04:06,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 374.0) internal successors, (1122), 3 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:07,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:07,004 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:07,006 INFO L175 Difference]: Start difference. First operand has 359 places, 367 transitions, 752 flow. Second operand 3 states and 1122 transitions. [2023-11-26 12:04:07,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 355 transitions, 758 flow [2023-11-26 12:04:07,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 355 transitions, 746 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-26 12:04:07,023 INFO L231 Difference]: Finished difference. Result has 354 places, 349 transitions, 708 flow [2023-11-26 12:04:07,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=354, PETRI_TRANSITIONS=349} [2023-11-26 12:04:07,029 INFO L281 CegarLoopForPetriNet]: 359 programPoint places, -5 predicate places. [2023-11-26 12:04:07,030 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 349 transitions, 708 flow [2023-11-26 12:04:07,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:07,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:07,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:07,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:04:07,032 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-26 12:04:07,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:07,033 INFO L85 PathProgramCache]: Analyzing trace with hash -534409652, now seen corresponding path program 1 times [2023-11-26 12:04:07,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:07,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458615100] [2023-11-26 12:04:07,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:07,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:07,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:07,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458615100] [2023-11-26 12:04:07,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458615100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:07,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:07,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:04:07,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480338316] [2023-11-26 12:04:07,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:07,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:04:07,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:07,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:04:07,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:04:07,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 395 [2023-11-26 12:04:07,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 349 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:07,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:07,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 395 [2023-11-26 12:04:07,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:07,302 INFO L124 PetriNetUnfolderBase]: 15/476 cut-off events. [2023-11-26 12:04:07,302 INFO L125 PetriNetUnfolderBase]: For 5/8 co-relation queries the response was YES. [2023-11-26 12:04:07,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 476 events. 15/476 cut-off events. For 5/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1315 event pairs, 5 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 487. Up to 29 conditions per place. [2023-11-26 12:04:07,308 INFO L140 encePairwiseOnDemand]: 392/395 looper letters, 15 selfloop transitions, 2 changer transitions 0/348 dead transitions. [2023-11-26 12:04:07,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 348 transitions, 740 flow [2023-11-26 12:04:07,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:04:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:04:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1107 transitions. [2023-11-26 12:04:07,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9341772151898734 [2023-11-26 12:04:07,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1107 transitions. [2023-11-26 12:04:07,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1107 transitions. [2023-11-26 12:04:07,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:07,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1107 transitions. [2023-11-26 12:04:07,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 369.0) internal successors, (1107), 3 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:07,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:07,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:07,324 INFO L175 Difference]: Start difference. First operand has 354 places, 349 transitions, 708 flow. Second operand 3 states and 1107 transitions. [2023-11-26 12:04:07,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 348 transitions, 740 flow [2023-11-26 12:04:07,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 348 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:04:07,335 INFO L231 Difference]: Finished difference. Result has 347 places, 348 transitions, 706 flow [2023-11-26 12:04:07,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=347, PETRI_TRANSITIONS=348} [2023-11-26 12:04:07,337 INFO L281 CegarLoopForPetriNet]: 359 programPoint places, -12 predicate places. [2023-11-26 12:04:07,337 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 348 transitions, 706 flow [2023-11-26 12:04:07,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:07,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:07,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:07,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:04:07,344 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-26 12:04:07,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:07,344 INFO L85 PathProgramCache]: Analyzing trace with hash 472845636, now seen corresponding path program 1 times [2023-11-26 12:04:07,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:07,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212849092] [2023-11-26 12:04:07,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:07,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:07,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:07,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212849092] [2023-11-26 12:04:07,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212849092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:07,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:07,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:04:07,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812011921] [2023-11-26 12:04:07,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:07,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:04:07,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:07,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:04:07,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:04:07,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 395 [2023-11-26 12:04:07,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 348 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 358.0) internal successors, (1074), 3 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:07,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:07,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 395 [2023-11-26 12:04:07,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:07,660 INFO L124 PetriNetUnfolderBase]: 27/607 cut-off events. [2023-11-26 12:04:07,660 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2023-11-26 12:04:07,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 607 events. 27/607 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2153 event pairs, 12 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 633. Up to 50 conditions per place. [2023-11-26 12:04:07,667 INFO L140 encePairwiseOnDemand]: 388/395 looper letters, 18 selfloop transitions, 1 changer transitions 0/342 dead transitions. [2023-11-26 12:04:07,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 342 transitions, 732 flow [2023-11-26 12:04:07,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:04:07,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:04:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1096 transitions. [2023-11-26 12:04:07,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9248945147679325 [2023-11-26 12:04:07,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1096 transitions. [2023-11-26 12:04:07,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1096 transitions. [2023-11-26 12:04:07,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:07,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1096 transitions. [2023-11-26 12:04:07,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:07,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:07,682 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:07,683 INFO L175 Difference]: Start difference. First operand has 347 places, 348 transitions, 706 flow. Second operand 3 states and 1096 transitions. [2023-11-26 12:04:07,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 342 transitions, 732 flow [2023-11-26 12:04:07,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 342 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:04:07,693 INFO L231 Difference]: Finished difference. Result has 341 places, 342 transitions, 692 flow [2023-11-26 12:04:07,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=692, PETRI_PLACES=341, PETRI_TRANSITIONS=342} [2023-11-26 12:04:07,695 INFO L281 CegarLoopForPetriNet]: 359 programPoint places, -18 predicate places. [2023-11-26 12:04:07,695 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 342 transitions, 692 flow [2023-11-26 12:04:07,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.0) internal successors, (1074), 3 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:07,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:07,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:07,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:04:07,698 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-26 12:04:07,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:07,699 INFO L85 PathProgramCache]: Analyzing trace with hash 308164519, now seen corresponding path program 1 times [2023-11-26 12:04:07,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:07,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951752293] [2023-11-26 12:04:07,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:07,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:08,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:08,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:08,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951752293] [2023-11-26 12:04:08,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951752293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:08,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:08,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:04:08,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914729161] [2023-11-26 12:04:08,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:08,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:04:08,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:08,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:04:08,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:04:09,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 395 [2023-11-26 12:04:09,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 342 transitions, 692 flow. Second operand has 6 states, 6 states have (on average 305.5) internal successors, (1833), 6 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:09,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:09,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 395 [2023-11-26 12:04:09,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:16,645 INFO L124 PetriNetUnfolderBase]: 11328/33356 cut-off events. [2023-11-26 12:04:16,645 INFO L125 PetriNetUnfolderBase]: For 182/308 co-relation queries the response was YES. [2023-11-26 12:04:16,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48987 conditions, 33356 events. 11328/33356 cut-off events. For 182/308 co-relation queries the response was YES. Maximal size of possible extension queue 1137. Compared 408127 event pairs, 9904 based on Foata normal form. 0/28573 useless extension candidates. Maximal degree in co-relation 48951. Up to 15527 conditions per place. [2023-11-26 12:04:17,005 INFO L140 encePairwiseOnDemand]: 383/395 looper letters, 66 selfloop transitions, 10 changer transitions 0/340 dead transitions. [2023-11-26 12:04:17,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 340 transitions, 840 flow [2023-11-26 12:04:17,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:04:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:04:17,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1902 transitions. [2023-11-26 12:04:17,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8025316455696202 [2023-11-26 12:04:17,012 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1902 transitions. [2023-11-26 12:04:17,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1902 transitions. [2023-11-26 12:04:17,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:17,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1902 transitions. [2023-11-26 12:04:17,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 317.0) internal successors, (1902), 6 states have internal predecessors, (1902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 395.0) internal successors, (2765), 7 states have internal predecessors, (2765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,029 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 395.0) internal successors, (2765), 7 states have internal predecessors, (2765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,030 INFO L175 Difference]: Start difference. First operand has 341 places, 342 transitions, 692 flow. Second operand 6 states and 1902 transitions. [2023-11-26 12:04:17,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 340 transitions, 840 flow [2023-11-26 12:04:17,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 340 transitions, 839 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:04:17,039 INFO L231 Difference]: Finished difference. Result has 343 places, 340 transitions, 707 flow [2023-11-26 12:04:17,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=707, PETRI_PLACES=343, PETRI_TRANSITIONS=340} [2023-11-26 12:04:17,041 INFO L281 CegarLoopForPetriNet]: 359 programPoint places, -16 predicate places. [2023-11-26 12:04:17,041 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 340 transitions, 707 flow [2023-11-26 12:04:17,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 305.5) internal successors, (1833), 6 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:17,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:17,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:04:17,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-26 12:04:17,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash 392235620, now seen corresponding path program 1 times [2023-11-26 12:04:17,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:17,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379545220] [2023-11-26 12:04:17,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:17,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:17,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:17,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379545220] [2023-11-26 12:04:17,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379545220] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:17,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:17,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:04:17,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646052985] [2023-11-26 12:04:17,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:17,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:04:17,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:17,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:04:17,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:04:17,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 395 [2023-11-26 12:04:17,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 340 transitions, 707 flow. Second operand has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:17,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 395 [2023-11-26 12:04:17,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:17,399 INFO L124 PetriNetUnfolderBase]: 26/576 cut-off events. [2023-11-26 12:04:17,399 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-26 12:04:17,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 576 events. 26/576 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2146 event pairs, 15 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 606. Up to 41 conditions per place. [2023-11-26 12:04:17,406 INFO L140 encePairwiseOnDemand]: 392/395 looper letters, 13 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2023-11-26 12:04:17,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 339 transitions, 735 flow [2023-11-26 12:04:17,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:04:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:04:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1111 transitions. [2023-11-26 12:04:17,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9375527426160337 [2023-11-26 12:04:17,411 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1111 transitions. [2023-11-26 12:04:17,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1111 transitions. [2023-11-26 12:04:17,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:17,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1111 transitions. [2023-11-26 12:04:17,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,421 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,421 INFO L175 Difference]: Start difference. First operand has 343 places, 340 transitions, 707 flow. Second operand 3 states and 1111 transitions. [2023-11-26 12:04:17,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 339 transitions, 735 flow [2023-11-26 12:04:17,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 339 transitions, 715 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-26 12:04:17,430 INFO L231 Difference]: Finished difference. Result has 339 places, 339 transitions, 689 flow [2023-11-26 12:04:17,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=339, PETRI_TRANSITIONS=339} [2023-11-26 12:04:17,433 INFO L281 CegarLoopForPetriNet]: 359 programPoint places, -20 predicate places. [2023-11-26 12:04:17,434 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 339 transitions, 689 flow [2023-11-26 12:04:17,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:17,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:17,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:04:17,437 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-26 12:04:17,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:17,439 INFO L85 PathProgramCache]: Analyzing trace with hash -254416039, now seen corresponding path program 1 times [2023-11-26 12:04:17,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:17,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986167004] [2023-11-26 12:04:17,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:17,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:17,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:17,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986167004] [2023-11-26 12:04:17,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986167004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:17,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:17,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:04:17,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932836863] [2023-11-26 12:04:17,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:17,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:04:17,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:17,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:04:17,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:04:17,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 395 [2023-11-26 12:04:17,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 339 transitions, 689 flow. Second operand has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:17,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 395 [2023-11-26 12:04:17,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:17,661 INFO L124 PetriNetUnfolderBase]: 36/724 cut-off events. [2023-11-26 12:04:17,661 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2023-11-26 12:04:17,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 724 events. 36/724 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2968 event pairs, 15 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 754. Up to 53 conditions per place. [2023-11-26 12:04:17,668 INFO L140 encePairwiseOnDemand]: 392/395 looper letters, 13 selfloop transitions, 2 changer transitions 0/338 dead transitions. [2023-11-26 12:04:17,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 338 transitions, 717 flow [2023-11-26 12:04:17,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:04:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:04:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1111 transitions. [2023-11-26 12:04:17,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9375527426160337 [2023-11-26 12:04:17,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1111 transitions. [2023-11-26 12:04:17,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1111 transitions. [2023-11-26 12:04:17,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:17,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1111 transitions. [2023-11-26 12:04:17,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,681 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,681 INFO L175 Difference]: Start difference. First operand has 339 places, 339 transitions, 689 flow. Second operand 3 states and 1111 transitions. [2023-11-26 12:04:17,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 338 transitions, 717 flow [2023-11-26 12:04:17,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 338 transitions, 713 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:04:17,690 INFO L231 Difference]: Finished difference. Result has 338 places, 338 transitions, 687 flow [2023-11-26 12:04:17,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=687, PETRI_PLACES=338, PETRI_TRANSITIONS=338} [2023-11-26 12:04:17,691 INFO L281 CegarLoopForPetriNet]: 359 programPoint places, -21 predicate places. [2023-11-26 12:04:17,692 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 338 transitions, 687 flow [2023-11-26 12:04:17,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:17,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:17,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 12:04:17,693 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-26 12:04:17,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:17,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1945908270, now seen corresponding path program 1 times [2023-11-26 12:04:17,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:17,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865496714] [2023-11-26 12:04:17,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:17,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:17,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:17,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865496714] [2023-11-26 12:04:17,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865496714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:17,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:17,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:04:17,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702871075] [2023-11-26 12:04:17,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:17,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:04:17,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:17,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:04:17,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:04:17,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 395 [2023-11-26 12:04:17,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 338 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:17,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 395 [2023-11-26 12:04:17,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:17,885 INFO L124 PetriNetUnfolderBase]: 39/673 cut-off events. [2023-11-26 12:04:17,885 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-26 12:04:17,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 741 conditions, 673 events. 39/673 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2711 event pairs, 20 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 704. Up to 56 conditions per place. [2023-11-26 12:04:17,892 INFO L140 encePairwiseOnDemand]: 390/395 looper letters, 14 selfloop transitions, 1 changer transitions 0/334 dead transitions. [2023-11-26 12:04:17,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 334 transitions, 709 flow [2023-11-26 12:04:17,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:04:17,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:04:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1108 transitions. [2023-11-26 12:04:17,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9350210970464135 [2023-11-26 12:04:17,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1108 transitions. [2023-11-26 12:04:17,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1108 transitions. [2023-11-26 12:04:17,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:17,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1108 transitions. [2023-11-26 12:04:17,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,905 INFO L175 Difference]: Start difference. First operand has 338 places, 338 transitions, 687 flow. Second operand 3 states and 1108 transitions. [2023-11-26 12:04:17,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 334 transitions, 709 flow [2023-11-26 12:04:17,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 334 transitions, 705 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:04:17,913 INFO L231 Difference]: Finished difference. Result has 334 places, 334 transitions, 677 flow [2023-11-26 12:04:17,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=677, PETRI_PLACES=334, PETRI_TRANSITIONS=334} [2023-11-26 12:04:17,914 INFO L281 CegarLoopForPetriNet]: 359 programPoint places, -25 predicate places. [2023-11-26 12:04:17,915 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 334 transitions, 677 flow [2023-11-26 12:04:17,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:17,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:17,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:17,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 12:04:17,916 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-26 12:04:17,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:17,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1172369455, now seen corresponding path program 1 times [2023-11-26 12:04:17,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:17,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130995147] [2023-11-26 12:04:17,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:17,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:17,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:17,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130995147] [2023-11-26 12:04:17,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130995147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:17,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:17,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:04:17,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650620639] [2023-11-26 12:04:17,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:17,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:04:17,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:17,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:04:17,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:04:18,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 395 [2023-11-26 12:04:18,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 334 transitions, 677 flow. Second operand has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:18,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:18,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 395 [2023-11-26 12:04:18,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:18,226 INFO L124 PetriNetUnfolderBase]: 118/1301 cut-off events. [2023-11-26 12:04:18,226 INFO L125 PetriNetUnfolderBase]: For 28/32 co-relation queries the response was YES. [2023-11-26 12:04:18,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1490 conditions, 1301 events. 118/1301 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 8154 event pairs, 22 based on Foata normal form. 1/1147 useless extension candidates. Maximal degree in co-relation 1454. Up to 164 conditions per place. [2023-11-26 12:04:18,240 INFO L140 encePairwiseOnDemand]: 387/395 looper letters, 20 selfloop transitions, 4 changer transitions 0/339 dead transitions. [2023-11-26 12:04:18,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 339 transitions, 740 flow [2023-11-26 12:04:18,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:04:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:04:18,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1117 transitions. [2023-11-26 12:04:18,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9426160337552743 [2023-11-26 12:04:18,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1117 transitions. [2023-11-26 12:04:18,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1117 transitions. [2023-11-26 12:04:18,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:18,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1117 transitions. [2023-11-26 12:04:18,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:18,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:18,254 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:18,254 INFO L175 Difference]: Start difference. First operand has 334 places, 334 transitions, 677 flow. Second operand 3 states and 1117 transitions. [2023-11-26 12:04:18,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 339 transitions, 740 flow [2023-11-26 12:04:18,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 339 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:04:18,263 INFO L231 Difference]: Finished difference. Result has 332 places, 334 transitions, 696 flow [2023-11-26 12:04:18,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=332, PETRI_TRANSITIONS=334} [2023-11-26 12:04:18,266 INFO L281 CegarLoopForPetriNet]: 359 programPoint places, -27 predicate places. [2023-11-26 12:04:18,266 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 334 transitions, 696 flow [2023-11-26 12:04:18,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:18,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:18,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:18,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 12:04:18,268 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-26 12:04:18,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:18,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1365585453, now seen corresponding path program 1 times [2023-11-26 12:04:18,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:18,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324098021] [2023-11-26 12:04:18,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:18,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:18,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:18,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324098021] [2023-11-26 12:04:18,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324098021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:18,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:18,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:04:18,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438272677] [2023-11-26 12:04:18,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:18,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:04:18,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:18,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:04:18,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:04:18,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 395 [2023-11-26 12:04:18,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 334 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:18,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:18,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 395 [2023-11-26 12:04:18,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:18,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([958] L64-->L64-1: Formula: (= |v_#race~B~0_7| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_7|} AuxVars[] AssignedVars[#race~B~0][227], [418#(= |#race~M~0| 0), 427#(= |#race~A~0| 0), 268#L56-1true, 399#(= |#race~N~0| 0), Black: 420#true, 84#L48-3true, 149#L64-1true, 422#(= |#race~B~0| 0), 273#L84-4true]) [2023-11-26 12:04:18,778 INFO L294 olderBase$Statistics]: this new event has 198 ancestors and is cut-off event [2023-11-26 12:04:18,778 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-26 12:04:18,778 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2023-11-26 12:04:18,778 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2023-11-26 12:04:18,780 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([958] L64-->L64-1: Formula: (= |v_#race~B~0_7| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_7|} AuxVars[] AssignedVars[#race~B~0][227], [418#(= |#race~M~0| 0), 427#(= |#race~A~0| 0), 156#L48-4true, 268#L56-1true, 399#(= |#race~N~0| 0), Black: 420#true, 149#L64-1true, 422#(= |#race~B~0| 0), 273#L84-4true]) [2023-11-26 12:04:18,780 INFO L294 olderBase$Statistics]: this new event has 199 ancestors and is cut-off event [2023-11-26 12:04:18,781 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2023-11-26 12:04:18,781 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2023-11-26 12:04:18,781 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2023-11-26 12:04:18,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([958] L64-->L64-1: Formula: (= |v_#race~B~0_7| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_7|} AuxVars[] AssignedVars[#race~B~0][227], [418#(= |#race~M~0| 0), 427#(= |#race~A~0| 0), 268#L56-1true, 241#L85-7true, 399#(= |#race~N~0| 0), Black: 420#true, 149#L64-1true, 422#(= |#race~B~0| 0)]) [2023-11-26 12:04:18,792 INFO L294 olderBase$Statistics]: this new event has 207 ancestors and is cut-off event [2023-11-26 12:04:18,792 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2023-11-26 12:04:18,792 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2023-11-26 12:04:18,793 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2023-11-26 12:04:18,798 INFO L124 PetriNetUnfolderBase]: 190/1719 cut-off events. [2023-11-26 12:04:18,798 INFO L125 PetriNetUnfolderBase]: For 35/39 co-relation queries the response was YES. [2023-11-26 12:04:18,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2046 conditions, 1719 events. 190/1719 cut-off events. For 35/39 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 11977 event pairs, 45 based on Foata normal form. 0/1528 useless extension candidates. Maximal degree in co-relation 2010. Up to 207 conditions per place. [2023-11-26 12:04:18,821 INFO L140 encePairwiseOnDemand]: 387/395 looper letters, 20 selfloop transitions, 4 changer transitions 0/339 dead transitions. [2023-11-26 12:04:18,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 339 transitions, 759 flow [2023-11-26 12:04:18,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:04:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:04:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1117 transitions. [2023-11-26 12:04:18,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9426160337552743 [2023-11-26 12:04:18,827 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1117 transitions. [2023-11-26 12:04:18,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1117 transitions. [2023-11-26 12:04:18,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:18,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1117 transitions. [2023-11-26 12:04:18,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:18,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:18,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:18,837 INFO L175 Difference]: Start difference. First operand has 332 places, 334 transitions, 696 flow. Second operand 3 states and 1117 transitions. [2023-11-26 12:04:18,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 339 transitions, 759 flow [2023-11-26 12:04:18,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 339 transitions, 759 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 12:04:18,847 INFO L231 Difference]: Finished difference. Result has 331 places, 334 transitions, 716 flow [2023-11-26 12:04:18,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=716, PETRI_PLACES=331, PETRI_TRANSITIONS=334} [2023-11-26 12:04:18,849 INFO L281 CegarLoopForPetriNet]: 359 programPoint places, -28 predicate places. [2023-11-26 12:04:18,849 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 334 transitions, 716 flow [2023-11-26 12:04:18,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:18,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:18,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:18,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 12:04:18,860 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-26 12:04:18,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:18,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1270819977, now seen corresponding path program 1 times [2023-11-26 12:04:18,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:18,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462730006] [2023-11-26 12:04:18,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:18,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:19,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:19,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462730006] [2023-11-26 12:04:19,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462730006] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:19,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:19,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:04:19,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359815191] [2023-11-26 12:04:19,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:19,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:04:19,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:19,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:04:19,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:04:19,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 395 [2023-11-26 12:04:19,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 334 transitions, 716 flow. Second operand has 7 states, 7 states have (on average 355.0) internal successors, (2485), 7 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:19,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:19,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 395 [2023-11-26 12:04:19,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:19,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] thread3EXIT-->L87-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem27#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_6|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_6|} AuxVars[] AssignedVars[][348], [418#(= |#race~M~0| 0), 427#(= |#race~A~0| 0), 399#(= |#race~N~0| 0), Black: 420#true, 430#true, 422#(= |#race~B~0| 0), 68#L87-7true, Black: 425#true]) [2023-11-26 12:04:19,859 INFO L294 olderBase$Statistics]: this new event has 282 ancestors and is cut-off event [2023-11-26 12:04:19,860 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2023-11-26 12:04:19,860 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2023-11-26 12:04:19,860 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2023-11-26 12:04:19,861 INFO L124 PetriNetUnfolderBase]: 110/1441 cut-off events. [2023-11-26 12:04:19,861 INFO L125 PetriNetUnfolderBase]: For 26/45 co-relation queries the response was YES. [2023-11-26 12:04:19,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 1441 events. 110/1441 cut-off events. For 26/45 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8044 event pairs, 28 based on Foata normal form. 5/1342 useless extension candidates. Maximal degree in co-relation 1731. Up to 86 conditions per place. [2023-11-26 12:04:19,875 INFO L140 encePairwiseOnDemand]: 374/395 looper letters, 31 selfloop transitions, 28 changer transitions 0/363 dead transitions. [2023-11-26 12:04:19,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 363 transitions, 900 flow [2023-11-26 12:04:19,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 12:04:19,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 12:04:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3580 transitions. [2023-11-26 12:04:19,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9063291139240506 [2023-11-26 12:04:19,889 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 3580 transitions. [2023-11-26 12:04:19,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 3580 transitions. [2023-11-26 12:04:19,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:19,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 3580 transitions. [2023-11-26 12:04:19,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 358.0) internal successors, (3580), 10 states have internal predecessors, (3580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:19,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 395.0) internal successors, (4345), 11 states have internal predecessors, (4345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:19,916 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 395.0) internal successors, (4345), 11 states have internal predecessors, (4345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:19,917 INFO L175 Difference]: Start difference. First operand has 331 places, 334 transitions, 716 flow. Second operand 10 states and 3580 transitions. [2023-11-26 12:04:19,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 363 transitions, 900 flow [2023-11-26 12:04:19,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 363 transitions, 900 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 12:04:19,929 INFO L231 Difference]: Finished difference. Result has 344 places, 350 transitions, 845 flow [2023-11-26 12:04:19,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=845, PETRI_PLACES=344, PETRI_TRANSITIONS=350} [2023-11-26 12:04:19,932 INFO L281 CegarLoopForPetriNet]: 359 programPoint places, -15 predicate places. [2023-11-26 12:04:19,932 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 350 transitions, 845 flow [2023-11-26 12:04:19,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 355.0) internal successors, (2485), 7 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:19,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:19,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:19,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 12:04:19,934 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-26 12:04:19,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash 769321967, now seen corresponding path program 1 times [2023-11-26 12:04:19,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:19,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130546851] [2023-11-26 12:04:19,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:19,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:20,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:20,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130546851] [2023-11-26 12:04:20,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130546851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:20,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:20,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:04:20,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317252937] [2023-11-26 12:04:20,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:20,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:04:20,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:20,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:04:20,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:04:21,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 395 [2023-11-26 12:04:21,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 350 transitions, 845 flow. Second operand has 6 states, 6 states have (on average 347.6666666666667) internal successors, (2086), 6 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:21,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:21,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 395 [2023-11-26 12:04:21,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:26,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([973] L64-12-->L64-13: Formula: (= (store |v_#race_53| v_~B~0.base_17 (store (select |v_#race_53| v_~B~0.base_17) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_25) v_~B~0.offset_17) |v_thread3Thread1of1ForFork0_#t~nondet9_3|)) |v_#race_52|) InVars {#race=|v_#race_53|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_17, ~B~0.offset=v_~B~0.offset_17, thread3Thread1of1ForFork0_#t~nondet9=|v_thread3Thread1of1ForFork0_#t~nondet9_3|} OutVars{#race=|v_#race_52|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_17, ~B~0.offset=v_~B~0.offset_17, thread3Thread1of1ForFork0_#t~nondet9=|v_thread3Thread1of1ForFork0_#t~nondet9_3|} AuxVars[] AssignedVars[#race][263], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), 452#true, Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 418#(= |#race~M~0| 0), 399#(= |#race~N~0| 0), Black: 420#true, 422#(= |#race~B~0| 0), 173#L56-14true, Black: 425#true, 427#(= |#race~A~0| 0), 241#L85-7true, 430#true, 129#L64-13true]) [2023-11-26 12:04:26,070 INFO L294 olderBase$Statistics]: this new event has 237 ancestors and is cut-off event [2023-11-26 12:04:26,070 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2023-11-26 12:04:26,070 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2023-11-26 12:04:26,070 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-11-26 12:04:26,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([973] L64-12-->L64-13: Formula: (= (store |v_#race_53| v_~B~0.base_17 (store (select |v_#race_53| v_~B~0.base_17) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_25) v_~B~0.offset_17) |v_thread3Thread1of1ForFork0_#t~nondet9_3|)) |v_#race_52|) InVars {#race=|v_#race_53|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_17, ~B~0.offset=v_~B~0.offset_17, thread3Thread1of1ForFork0_#t~nondet9=|v_thread3Thread1of1ForFork0_#t~nondet9_3|} OutVars{#race=|v_#race_52|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_17, ~B~0.offset=v_~B~0.offset_17, thread3Thread1of1ForFork0_#t~nondet9=|v_thread3Thread1of1ForFork0_#t~nondet9_3|} AuxVars[] AssignedVars[#race][263], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), 452#true, Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 418#(= |#race~M~0| 0), 399#(= |#race~N~0| 0), Black: 420#true, 422#(= |#race~B~0| 0), Black: 425#true, 427#(= |#race~A~0| 0), 241#L85-7true, 430#true, 129#L64-13true, 126#L56-15true]) [2023-11-26 12:04:26,134 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2023-11-26 12:04:26,134 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-11-26 12:04:26,134 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2023-11-26 12:04:26,134 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2023-11-26 12:04:26,194 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([973] L64-12-->L64-13: Formula: (= (store |v_#race_53| v_~B~0.base_17 (store (select |v_#race_53| v_~B~0.base_17) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_25) v_~B~0.offset_17) |v_thread3Thread1of1ForFork0_#t~nondet9_3|)) |v_#race_52|) InVars {#race=|v_#race_53|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_17, ~B~0.offset=v_~B~0.offset_17, thread3Thread1of1ForFork0_#t~nondet9=|v_thread3Thread1of1ForFork0_#t~nondet9_3|} OutVars{#race=|v_#race_52|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_17, ~B~0.offset=v_~B~0.offset_17, thread3Thread1of1ForFork0_#t~nondet9=|v_thread3Thread1of1ForFork0_#t~nondet9_3|} AuxVars[] AssignedVars[#race][263], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), 452#true, Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 418#(= |#race~M~0| 0), 399#(= |#race~N~0| 0), 3#L56-16true, Black: 420#true, 422#(= |#race~B~0| 0), Black: 425#true, 427#(= |#race~A~0| 0), 241#L85-7true, 430#true, 129#L64-13true]) [2023-11-26 12:04:26,194 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2023-11-26 12:04:26,194 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-11-26 12:04:26,194 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-26 12:04:26,195 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-26 12:04:26,683 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([973] L64-12-->L64-13: Formula: (= (store |v_#race_53| v_~B~0.base_17 (store (select |v_#race_53| v_~B~0.base_17) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_25) v_~B~0.offset_17) |v_thread3Thread1of1ForFork0_#t~nondet9_3|)) |v_#race_52|) InVars {#race=|v_#race_53|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_17, ~B~0.offset=v_~B~0.offset_17, thread3Thread1of1ForFork0_#t~nondet9=|v_thread3Thread1of1ForFork0_#t~nondet9_3|} OutVars{#race=|v_#race_52|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_17, ~B~0.offset=v_~B~0.offset_17, thread3Thread1of1ForFork0_#t~nondet9=|v_thread3Thread1of1ForFork0_#t~nondet9_3|} AuxVars[] AssignedVars[#race][263], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), 452#true, Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 418#(= |#race~M~0| 0), 399#(= |#race~N~0| 0), Black: 420#true, 422#(= |#race~B~0| 0), Black: 425#true, 427#(= |#race~A~0| 0), 241#L85-7true, 138#L56-3true, 430#true, 129#L64-13true]) [2023-11-26 12:04:26,683 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2023-11-26 12:04:26,684 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2023-11-26 12:04:26,684 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2023-11-26 12:04:26,684 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2023-11-26 12:04:26,795 INFO L124 PetriNetUnfolderBase]: 7836/24304 cut-off events. [2023-11-26 12:04:26,795 INFO L125 PetriNetUnfolderBase]: For 234/446 co-relation queries the response was YES. [2023-11-26 12:04:26,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37076 conditions, 24304 events. 7836/24304 cut-off events. For 234/446 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 267349 event pairs, 2232 based on Foata normal form. 171/22329 useless extension candidates. Maximal degree in co-relation 37029. Up to 8805 conditions per place. [2023-11-26 12:04:27,114 INFO L140 encePairwiseOnDemand]: 377/395 looper letters, 36 selfloop transitions, 53 changer transitions 0/405 dead transitions. [2023-11-26 12:04:27,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 405 transitions, 1136 flow [2023-11-26 12:04:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:04:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:04:27,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2166 transitions. [2023-11-26 12:04:27,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9139240506329114 [2023-11-26 12:04:27,128 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2166 transitions. [2023-11-26 12:04:27,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2166 transitions. [2023-11-26 12:04:27,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:27,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2166 transitions. [2023-11-26 12:04:27,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:27,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 395.0) internal successors, (2765), 7 states have internal predecessors, (2765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:27,146 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 395.0) internal successors, (2765), 7 states have internal predecessors, (2765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:27,146 INFO L175 Difference]: Start difference. First operand has 344 places, 350 transitions, 845 flow. Second operand 6 states and 2166 transitions. [2023-11-26 12:04:27,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 405 transitions, 1136 flow [2023-11-26 12:04:27,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 405 transitions, 1136 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 12:04:27,246 INFO L231 Difference]: Finished difference. Result has 354 places, 402 transitions, 1195 flow [2023-11-26 12:04:27,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1195, PETRI_PLACES=354, PETRI_TRANSITIONS=402} [2023-11-26 12:04:27,247 INFO L281 CegarLoopForPetriNet]: 359 programPoint places, -5 predicate places. [2023-11-26 12:04:27,248 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 402 transitions, 1195 flow [2023-11-26 12:04:27,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 347.6666666666667) internal successors, (2086), 6 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:27,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:27,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:27,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 12:04:27,250 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-26 12:04:27,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:27,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1552897370, now seen corresponding path program 1 times [2023-11-26 12:04:27,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:27,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885161763] [2023-11-26 12:04:27,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:27,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:27,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:27,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885161763] [2023-11-26 12:04:27,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885161763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:27,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:27,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:04:27,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000633642] [2023-11-26 12:04:27,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:27,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:04:27,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:27,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:04:27,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:04:27,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 395 [2023-11-26 12:04:27,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 402 transitions, 1195 flow. Second operand has 5 states, 5 states have (on average 365.0) internal successors, (1825), 5 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:27,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:27,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 395 [2023-11-26 12:04:27,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:31,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([990] thread1EXIT-->L85-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem25#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][237], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 418#(= |#race~M~0| 0), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 399#(= |#race~N~0| 0), Black: 420#true, 243#L56true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 452#true, 422#(= |#race~B~0| 0), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 425#true, Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 427#(= |#race~A~0| 0), 241#L85-7true, 430#true, 464#true, 129#L64-13true]) [2023-11-26 12:04:31,499 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2023-11-26 12:04:31,499 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2023-11-26 12:04:31,499 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2023-11-26 12:04:31,499 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2023-11-26 12:04:31,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([990] thread1EXIT-->L85-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem25#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][237], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 418#(= |#race~M~0| 0), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 399#(= |#race~N~0| 0), Black: 420#true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 452#true, 422#(= |#race~B~0| 0), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 425#true, Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 427#(= |#race~A~0| 0), 241#L85-7true, 464#true, 430#true, 13#L59true, 129#L64-13true]) [2023-11-26 12:04:31,500 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2023-11-26 12:04:31,500 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2023-11-26 12:04:31,500 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2023-11-26 12:04:31,500 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2023-11-26 12:04:31,554 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([990] thread1EXIT-->L85-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem25#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][237], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 418#(= |#race~M~0| 0), 378#L64-14true, 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 399#(= |#race~N~0| 0), Black: 420#true, 243#L56true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 452#true, 422#(= |#race~B~0| 0), Black: 425#true, Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 427#(= |#race~A~0| 0), 241#L85-7true, 464#true, 430#true]) [2023-11-26 12:04:31,555 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2023-11-26 12:04:31,555 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2023-11-26 12:04:31,555 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2023-11-26 12:04:31,555 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2023-11-26 12:04:31,555 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([990] thread1EXIT-->L85-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem25#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][237], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 418#(= |#race~M~0| 0), 378#L64-14true, 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 399#(= |#race~N~0| 0), Black: 420#true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 452#true, 422#(= |#race~B~0| 0), Black: 425#true, Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 427#(= |#race~A~0| 0), 241#L85-7true, 464#true, 430#true, 13#L59true]) [2023-11-26 12:04:31,556 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2023-11-26 12:04:31,556 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2023-11-26 12:04:31,556 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2023-11-26 12:04:31,556 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2023-11-26 12:04:31,609 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([990] thread1EXIT-->L85-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem25#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][237], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 418#(= |#race~M~0| 0), 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 399#(= |#race~N~0| 0), Black: 420#true, 243#L56true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 422#(= |#race~B~0| 0), Black: 452#true, Black: 425#true, Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 227#L64-15true, 427#(= |#race~A~0| 0), 241#L85-7true, 464#true, 430#true]) [2023-11-26 12:04:31,609 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2023-11-26 12:04:31,609 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2023-11-26 12:04:31,610 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2023-11-26 12:04:31,610 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2023-11-26 12:04:31,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([990] thread1EXIT-->L85-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem25#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][237], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 418#(= |#race~M~0| 0), 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 399#(= |#race~N~0| 0), Black: 420#true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 422#(= |#race~B~0| 0), Black: 452#true, Black: 425#true, Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 227#L64-15true, 427#(= |#race~A~0| 0), 241#L85-7true, 464#true, 430#true, 13#L59true]) [2023-11-26 12:04:31,610 INFO L294 olderBase$Statistics]: this new event has 256 ancestors and is cut-off event [2023-11-26 12:04:31,611 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2023-11-26 12:04:31,611 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2023-11-26 12:04:31,611 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2023-11-26 12:04:31,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([990] thread1EXIT-->L85-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem25#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][237], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 418#(= |#race~M~0| 0), 361#L64-16true, 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 399#(= |#race~N~0| 0), Black: 420#true, 243#L56true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 452#true, 422#(= |#race~B~0| 0), Black: 425#true, Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 427#(= |#race~A~0| 0), 241#L85-7true, 430#true, 464#true]) [2023-11-26 12:04:31,644 INFO L294 olderBase$Statistics]: this new event has 256 ancestors and is cut-off event [2023-11-26 12:04:31,645 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2023-11-26 12:04:31,645 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2023-11-26 12:04:31,645 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2023-11-26 12:04:31,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([990] thread1EXIT-->L85-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem25#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][237], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 418#(= |#race~M~0| 0), 361#L64-16true, 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 399#(= |#race~N~0| 0), Black: 420#true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 452#true, 422#(= |#race~B~0| 0), Black: 425#true, Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 427#(= |#race~A~0| 0), 241#L85-7true, 430#true, 464#true, 13#L59true]) [2023-11-26 12:04:31,645 INFO L294 olderBase$Statistics]: this new event has 257 ancestors and is cut-off event [2023-11-26 12:04:31,645 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2023-11-26 12:04:31,645 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2023-11-26 12:04:31,645 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2023-11-26 12:04:31,779 INFO L124 PetriNetUnfolderBase]: 6918/25919 cut-off events. [2023-11-26 12:04:31,779 INFO L125 PetriNetUnfolderBase]: For 3350/4322 co-relation queries the response was YES. [2023-11-26 12:04:31,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43124 conditions, 25919 events. 6918/25919 cut-off events. For 3350/4322 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 313752 event pairs, 1894 based on Foata normal form. 24/24055 useless extension candidates. Maximal degree in co-relation 43071. Up to 6791 conditions per place. [2023-11-26 12:04:32,094 INFO L140 encePairwiseOnDemand]: 389/395 looper letters, 24 selfloop transitions, 5 changer transitions 0/413 dead transitions. [2023-11-26 12:04:32,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 413 transitions, 1283 flow [2023-11-26 12:04:32,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:04:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:04:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1845 transitions. [2023-11-26 12:04:32,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9341772151898734 [2023-11-26 12:04:32,105 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1845 transitions. [2023-11-26 12:04:32,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1845 transitions. [2023-11-26 12:04:32,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:32,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1845 transitions. [2023-11-26 12:04:32,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:32,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 395.0) internal successors, (2370), 6 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:32,127 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 395.0) internal successors, (2370), 6 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:32,127 INFO L175 Difference]: Start difference. First operand has 354 places, 402 transitions, 1195 flow. Second operand 5 states and 1845 transitions. [2023-11-26 12:04:32,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 413 transitions, 1283 flow [2023-11-26 12:04:32,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 413 transitions, 1283 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 12:04:32,368 INFO L231 Difference]: Finished difference. Result has 360 places, 404 transitions, 1220 flow [2023-11-26 12:04:32,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1220, PETRI_PLACES=360, PETRI_TRANSITIONS=404} [2023-11-26 12:04:32,370 INFO L281 CegarLoopForPetriNet]: 359 programPoint places, 1 predicate places. [2023-11-26 12:04:32,370 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 404 transitions, 1220 flow [2023-11-26 12:04:32,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 365.0) internal successors, (1825), 5 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:32,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:32,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:32,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 12:04:32,372 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-26 12:04:32,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:32,372 INFO L85 PathProgramCache]: Analyzing trace with hash -2073572412, now seen corresponding path program 1 times [2023-11-26 12:04:32,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:32,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398280927] [2023-11-26 12:04:32,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:32,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:32,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:32,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:32,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398280927] [2023-11-26 12:04:32,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398280927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:32,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:32,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:04:32,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463494261] [2023-11-26 12:04:32,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:32,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:04:32,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:32,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:04:32,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:04:33,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 345 out of 395 [2023-11-26 12:04:33,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 404 transitions, 1220 flow. Second operand has 6 states, 6 states have (on average 346.6666666666667) internal successors, (2080), 6 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:33,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:33,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 395 [2023-11-26 12:04:33,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:42,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([958] L64-->L64-1: Formula: (= |v_#race~B~0_7| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_7|} AuxVars[] AssignedVars[#race~B~0][231], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 452#true, 418#(= |#race~M~0| 0), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 399#(= |#race~N~0| 0), Black: 420#true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 149#L64-1true, 422#(= |#race~B~0| 0), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 273#L84-4true, Black: 425#true, Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 268#L56-1true, 427#(= |#race~A~0| 0), Black: 467#(<= (+ ~M~0 1) 0), Black: 468#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork2_~i~1 0)), 472#true, 464#true, 430#true, 55#L48-1true]) [2023-11-26 12:04:42,859 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2023-11-26 12:04:42,859 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2023-11-26 12:04:42,859 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2023-11-26 12:04:42,859 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2023-11-26 12:04:44,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([958] L64-->L64-1: Formula: (= |v_#race~B~0_7| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_7|} AuxVars[] AssignedVars[#race~B~0][231], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), 452#true, Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 418#(= |#race~M~0| 0), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 399#(= |#race~N~0| 0), Black: 420#true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 149#L64-1true, 422#(= |#race~B~0| 0), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 425#true, Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 268#L56-1true, 427#(= |#race~A~0| 0), Black: 467#(<= (+ ~M~0 1) 0), Black: 468#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork2_~i~1 0)), 472#true, 180#L85-2true, 464#true, 430#true, 55#L48-1true]) [2023-11-26 12:04:44,066 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2023-11-26 12:04:44,066 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-11-26 12:04:44,066 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-11-26 12:04:44,066 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-11-26 12:04:44,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([958] L64-->L64-1: Formula: (= |v_#race~B~0_7| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_7|} AuxVars[] AssignedVars[#race~B~0][231], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 452#true, 418#(= |#race~M~0| 0), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 399#(= |#race~N~0| 0), Black: 420#true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 149#L64-1true, 422#(= |#race~B~0| 0), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 425#true, Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 268#L56-1true, 427#(= |#race~A~0| 0), Black: 467#(<= (+ ~M~0 1) 0), Black: 468#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork2_~i~1 0)), 472#true, 464#true, 430#true, 342#L85-3true, 55#L48-1true]) [2023-11-26 12:04:44,475 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2023-11-26 12:04:44,475 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-11-26 12:04:44,475 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-11-26 12:04:44,475 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-11-26 12:04:44,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([958] L64-->L64-1: Formula: (= |v_#race~B~0_7| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_7|} AuxVars[] AssignedVars[#race~B~0][231], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 452#true, 418#(= |#race~M~0| 0), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 399#(= |#race~N~0| 0), Black: 420#true, 149#L64-1true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 422#(= |#race~B~0| 0), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 425#true, Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 253#L85-4true, 268#L56-1true, 427#(= |#race~A~0| 0), Black: 467#(<= (+ ~M~0 1) 0), Black: 468#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork2_~i~1 0)), 472#true, 464#true, 430#true, 55#L48-1true]) [2023-11-26 12:04:44,708 INFO L294 olderBase$Statistics]: this new event has 237 ancestors and is cut-off event [2023-11-26 12:04:44,708 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-11-26 12:04:44,708 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-11-26 12:04:44,708 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-11-26 12:04:44,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([958] L64-->L64-1: Formula: (= |v_#race~B~0_7| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_7|} AuxVars[] AssignedVars[#race~B~0][231], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), 452#true, Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 418#(= |#race~M~0| 0), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 161#L85-5true, 399#(= |#race~N~0| 0), Black: 420#true, 149#L64-1true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 422#(= |#race~B~0| 0), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 425#true, Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 268#L56-1true, 427#(= |#race~A~0| 0), Black: 467#(<= (+ ~M~0 1) 0), Black: 468#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork2_~i~1 0)), 472#true, 464#true, 430#true, 55#L48-1true]) [2023-11-26 12:04:44,880 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2023-11-26 12:04:44,880 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-11-26 12:04:44,881 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-11-26 12:04:44,881 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-11-26 12:04:45,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([958] L64-->L64-1: Formula: (= |v_#race~B~0_7| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_7|} AuxVars[] AssignedVars[#race~B~0][231], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9#L85-6true, 452#true, 418#(= |#race~M~0| 0), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 399#(= |#race~N~0| 0), Black: 420#true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 149#L64-1true, 422#(= |#race~B~0| 0), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 425#true, Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 268#L56-1true, 427#(= |#race~A~0| 0), Black: 467#(<= (+ ~M~0 1) 0), Black: 468#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork2_~i~1 0)), 472#true, 464#true, 430#true, 55#L48-1true]) [2023-11-26 12:04:45,042 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2023-11-26 12:04:45,043 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-11-26 12:04:45,043 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-11-26 12:04:45,043 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-11-26 12:04:45,526 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([973] L64-12-->L64-13: Formula: (= (store |v_#race_53| v_~B~0.base_17 (store (select |v_#race_53| v_~B~0.base_17) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_25) v_~B~0.offset_17) |v_thread3Thread1of1ForFork0_#t~nondet9_3|)) |v_#race_52|) InVars {#race=|v_#race_53|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_17, ~B~0.offset=v_~B~0.offset_17, thread3Thread1of1ForFork0_#t~nondet9=|v_thread3Thread1of1ForFork0_#t~nondet9_3|} OutVars{#race=|v_#race_52|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_17, ~B~0.offset=v_~B~0.offset_17, thread3Thread1of1ForFork0_#t~nondet9=|v_thread3Thread1of1ForFork0_#t~nondet9_3|} AuxVars[] AssignedVars[#race][260], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), 452#true, Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 418#(= |#race~M~0| 0), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 262#L56-13true, 399#(= |#race~N~0| 0), Black: 420#true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 422#(= |#race~B~0| 0), Black: 425#true, Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 427#(= |#race~A~0| 0), Black: 467#(<= (+ ~M~0 1) 0), 241#L85-7true, Black: 468#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork2_~i~1 0)), 472#true, 464#true, 430#true, 129#L64-13true]) [2023-11-26 12:04:45,526 INFO L294 olderBase$Statistics]: this new event has 241 ancestors and is cut-off event [2023-11-26 12:04:45,526 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 12:04:45,526 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 12:04:45,526 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2023-11-26 12:04:45,638 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([973] L64-12-->L64-13: Formula: (= (store |v_#race_53| v_~B~0.base_17 (store (select |v_#race_53| v_~B~0.base_17) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_25) v_~B~0.offset_17) |v_thread3Thread1of1ForFork0_#t~nondet9_3|)) |v_#race_52|) InVars {#race=|v_#race_53|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_17, ~B~0.offset=v_~B~0.offset_17, thread3Thread1of1ForFork0_#t~nondet9=|v_thread3Thread1of1ForFork0_#t~nondet9_3|} OutVars{#race=|v_#race_52|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_17, ~B~0.offset=v_~B~0.offset_17, thread3Thread1of1ForFork0_#t~nondet9=|v_thread3Thread1of1ForFork0_#t~nondet9_3|} AuxVars[] AssignedVars[#race][260], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), 452#true, Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 418#(= |#race~M~0| 0), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 399#(= |#race~N~0| 0), Black: 420#true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 422#(= |#race~B~0| 0), 173#L56-14true, Black: 425#true, Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 427#(= |#race~A~0| 0), 241#L85-7true, Black: 467#(<= (+ ~M~0 1) 0), Black: 468#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork2_~i~1 0)), 472#true, 464#true, 430#true, 129#L64-13true]) [2023-11-26 12:04:45,638 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2023-11-26 12:04:45,638 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2023-11-26 12:04:45,638 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 12:04:45,638 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 12:04:45,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([973] L64-12-->L64-13: Formula: (= (store |v_#race_53| v_~B~0.base_17 (store (select |v_#race_53| v_~B~0.base_17) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_25) v_~B~0.offset_17) |v_thread3Thread1of1ForFork0_#t~nondet9_3|)) |v_#race_52|) InVars {#race=|v_#race_53|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_17, ~B~0.offset=v_~B~0.offset_17, thread3Thread1of1ForFork0_#t~nondet9=|v_thread3Thread1of1ForFork0_#t~nondet9_3|} OutVars{#race=|v_#race_52|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_17, ~B~0.offset=v_~B~0.offset_17, thread3Thread1of1ForFork0_#t~nondet9=|v_thread3Thread1of1ForFork0_#t~nondet9_3|} AuxVars[] AssignedVars[#race][260], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 452#true, 418#(= |#race~M~0| 0), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 399#(= |#race~N~0| 0), Black: 420#true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 422#(= |#race~B~0| 0), Black: 425#true, Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 427#(= |#race~A~0| 0), Black: 467#(<= (+ ~M~0 1) 0), 241#L85-7true, Black: 468#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork2_~i~1 0)), 472#true, 464#true, 430#true, 129#L64-13true, 126#L56-15true]) [2023-11-26 12:04:45,723 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2023-11-26 12:04:45,723 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2023-11-26 12:04:45,723 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-26 12:04:45,723 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-26 12:04:45,796 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([973] L64-12-->L64-13: Formula: (= (store |v_#race_53| v_~B~0.base_17 (store (select |v_#race_53| v_~B~0.base_17) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_25) v_~B~0.offset_17) |v_thread3Thread1of1ForFork0_#t~nondet9_3|)) |v_#race_52|) InVars {#race=|v_#race_53|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_17, ~B~0.offset=v_~B~0.offset_17, thread3Thread1of1ForFork0_#t~nondet9=|v_thread3Thread1of1ForFork0_#t~nondet9_3|} OutVars{#race=|v_#race_52|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_17, ~B~0.offset=v_~B~0.offset_17, thread3Thread1of1ForFork0_#t~nondet9=|v_thread3Thread1of1ForFork0_#t~nondet9_3|} AuxVars[] AssignedVars[#race][260], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 452#true, 418#(= |#race~M~0| 0), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 399#(= |#race~N~0| 0), Black: 420#true, 3#L56-16true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 422#(= |#race~B~0| 0), Black: 425#true, Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 427#(= |#race~A~0| 0), 241#L85-7true, Black: 467#(<= (+ ~M~0 1) 0), Black: 468#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork2_~i~1 0)), 472#true, 464#true, 430#true, 129#L64-13true]) [2023-11-26 12:04:45,796 INFO L294 olderBase$Statistics]: this new event has 244 ancestors and is cut-off event [2023-11-26 12:04:45,797 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2023-11-26 12:04:45,797 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2023-11-26 12:04:45,797 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2023-11-26 12:04:46,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([973] L64-12-->L64-13: Formula: (= (store |v_#race_53| v_~B~0.base_17 (store (select |v_#race_53| v_~B~0.base_17) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_25) v_~B~0.offset_17) |v_thread3Thread1of1ForFork0_#t~nondet9_3|)) |v_#race_52|) InVars {#race=|v_#race_53|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_17, ~B~0.offset=v_~B~0.offset_17, thread3Thread1of1ForFork0_#t~nondet9=|v_thread3Thread1of1ForFork0_#t~nondet9_3|} OutVars{#race=|v_#race_52|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_17, ~B~0.offset=v_~B~0.offset_17, thread3Thread1of1ForFork0_#t~nondet9=|v_thread3Thread1of1ForFork0_#t~nondet9_3|} AuxVars[] AssignedVars[#race][260], [Black: 440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(<= ~N~0 0), Black: 442#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 452#true, 418#(= |#race~M~0| 0), Black: 436#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 399#(= |#race~N~0| 0), Black: 420#true, Black: 455#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 422#(= |#race~B~0| 0), Black: 425#true, Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 454#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 183#L55-7true, 427#(= |#race~A~0| 0), Black: 467#(<= (+ ~M~0 1) 0), 241#L85-7true, Black: 468#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork2_~i~1 0)), 472#true, 464#true, 430#true, 129#L64-13true]) [2023-11-26 12:04:46,205 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2023-11-26 12:04:46,205 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 12:04:46,205 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2023-11-26 12:04:46,205 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 12:04:46,330 INFO L124 PetriNetUnfolderBase]: 19928/61258 cut-off events. [2023-11-26 12:04:46,330 INFO L125 PetriNetUnfolderBase]: For 31354/43888 co-relation queries the response was YES. [2023-11-26 12:04:46,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125873 conditions, 61258 events. 19928/61258 cut-off events. For 31354/43888 co-relation queries the response was YES. Maximal size of possible extension queue 1753. Compared 804842 event pairs, 4532 based on Foata normal form. 140/56697 useless extension candidates. Maximal degree in co-relation 125819. Up to 21177 conditions per place. [2023-11-26 12:04:47,033 INFO L140 encePairwiseOnDemand]: 380/395 looper letters, 94 selfloop transitions, 170 changer transitions 0/581 dead transitions. [2023-11-26 12:04:47,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 581 transitions, 2704 flow [2023-11-26 12:04:47,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:04:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:04:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2153 transitions. [2023-11-26 12:04:47,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9084388185654009 [2023-11-26 12:04:47,041 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2153 transitions. [2023-11-26 12:04:47,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2153 transitions. [2023-11-26 12:04:47,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:47,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2153 transitions. [2023-11-26 12:04:47,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 358.8333333333333) internal successors, (2153), 6 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:47,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 395.0) internal successors, (2765), 7 states have internal predecessors, (2765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:47,057 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 395.0) internal successors, (2765), 7 states have internal predecessors, (2765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:47,058 INFO L175 Difference]: Start difference. First operand has 360 places, 404 transitions, 1220 flow. Second operand 6 states and 2153 transitions. [2023-11-26 12:04:47,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 581 transitions, 2704 flow [2023-11-26 12:04:47,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 581 transitions, 2699 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:04:47,669 INFO L231 Difference]: Finished difference. Result has 368 places, 573 transitions, 2927 flow [2023-11-26 12:04:47,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=1215, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2927, PETRI_PLACES=368, PETRI_TRANSITIONS=573} [2023-11-26 12:04:47,671 INFO L281 CegarLoopForPetriNet]: 359 programPoint places, 9 predicate places. [2023-11-26 12:04:47,671 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 573 transitions, 2927 flow [2023-11-26 12:04:47,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 346.6666666666667) internal successors, (2080), 6 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:47,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:47,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:47,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 12:04:47,779 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-26 12:04:47,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1980603477, now seen corresponding path program 1 times [2023-11-26 12:04:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:47,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149041260] [2023-11-26 12:04:47,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:48,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:48,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:48,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149041260] [2023-11-26 12:04:48,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149041260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:48,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:48,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:04:48,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036994157] [2023-11-26 12:04:48,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:48,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:04:48,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:48,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:04:48,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:04:48,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 345 out of 395 [2023-11-26 12:04:48,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 573 transitions, 2927 flow. Second operand has 6 states, 6 states have (on average 346.8333333333333) internal successors, (2081), 6 states have internal predecessors, (2081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:48,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:48,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 395 [2023-11-26 12:04:48,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand