./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-nzb-file-symm.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_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/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_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/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_468ed0d3-6151-4993-b728-fea56c90cc80/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 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:44:52,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:44:52,496 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 11:44:52,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:44:52,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:44:52,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:44:52,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:44:52,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:44:52,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:44:52,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:44:52,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:44:52,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:44:52,557 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:44:52,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:44:52,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:44:52,560 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:44:52,561 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:44:52,561 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:44:52,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:44:52,562 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:44:52,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:44:52,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:44:52,564 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 11:44:52,564 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:44:52,565 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:44:52,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:44:52,566 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:44:52,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:44:52,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:44:52,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:44:52,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:44:52,569 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:44:52,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:44:52,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:44:52,570 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:44:52,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:44:52,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:44:52,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:44:52,571 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:44:52,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:44:52,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:44:52,572 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_468ed0d3-6151-4993-b728-fea56c90cc80/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_468ed0d3-6151-4993-b728-fea56c90cc80/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 -> 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 [2023-11-26 11:44:52,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:44:52,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:44:52,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:44:52,929 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:44:52,929 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:44:52,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2023-11-26 11:44:56,052 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:44:56,271 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:44:56,272 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2023-11-26 11:44:56,285 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/data/8361a78ef/2015ae8608d54aaa85f3f599d9870a58/FLAG766c364bc [2023-11-26 11:44:56,298 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/data/8361a78ef/2015ae8608d54aaa85f3f599d9870a58 [2023-11-26 11:44:56,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:44:56,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:44:56,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:44:56,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:44:56,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:44:56,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:44:56" (1/1) ... [2023-11-26 11:44:56,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e8f955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:56, skipping insertion in model container [2023-11-26 11:44:56,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:44:56" (1/1) ... [2023-11-26 11:44:56,354 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:44:56,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:44:56,607 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:44:56,691 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:44:56,708 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:44:56,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:56 WrapperNode [2023-11-26 11:44:56,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:44:56,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:44:56,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:44:56,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:44:56,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:56" (1/1) ... [2023-11-26 11:44:56,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:56" (1/1) ... [2023-11-26 11:44:56,809 INFO L138 Inliner]: procedures = 25, calls = 56, calls flagged for inlining = 22, calls inlined = 30, statements flattened = 905 [2023-11-26 11:44:56,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:44:56,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:44:56,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:44:56,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:44:56,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:56" (1/1) ... [2023-11-26 11:44:56,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:56" (1/1) ... [2023-11-26 11:44:56,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:56" (1/1) ... [2023-11-26 11:44:56,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:56" (1/1) ... [2023-11-26 11:44:56,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:56" (1/1) ... [2023-11-26 11:44:56,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:56" (1/1) ... [2023-11-26 11:44:56,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:56" (1/1) ... [2023-11-26 11:44:56,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:56" (1/1) ... [2023-11-26 11:44:56,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:44:56,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:44:56,946 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:44:56,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:44:56,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:56" (1/1) ... [2023-11-26 11:44:56,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:44:56,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:57,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:57,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:44:57,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:44:57,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:44:57,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 11:44:57,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 11:44:57,071 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-26 11:44:57,071 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-26 11:44:57,071 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-26 11:44:57,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-26 11:44:57,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 11:44:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 11:44:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:44:57,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:44:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:44:57,075 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 11:44:57,281 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:44:57,283 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:44:58,598 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:44:58,624 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:44:58,624 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-26 11:44:58,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:44:58 BoogieIcfgContainer [2023-11-26 11:44:58,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:44:58,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:44:58,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:44:58,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:44:58,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:44:56" (1/3) ... [2023-11-26 11:44:58,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa0b465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:44:58, skipping insertion in model container [2023-11-26 11:44:58,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:56" (2/3) ... [2023-11-26 11:44:58,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa0b465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:44:58, skipping insertion in model container [2023-11-26 11:44:58,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:44:58" (3/3) ... [2023-11-26 11:44:58,636 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2023-11-26 11:44:58,646 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 11:44:58,658 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:44:58,658 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 154 error locations. [2023-11-26 11:44:58,658 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:44:58,917 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-26 11:44:58,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1142 places, 1210 transitions, 2434 flow [2023-11-26 11:44:59,921 INFO L124 PetriNetUnfolderBase]: 75/1208 cut-off events. [2023-11-26 11:44:59,921 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-26 11:44:59,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 1208 events. 75/1208 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4299 event pairs, 0 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 927. Up to 2 conditions per place. [2023-11-26 11:44:59,966 INFO L82 GeneralOperation]: Start removeDead. Operand has 1142 places, 1210 transitions, 2434 flow [2023-11-26 11:45:00,011 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1116 places, 1182 transitions, 2376 flow [2023-11-26 11:45:00,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:45:00,029 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;@7bb2d1eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:45:00,029 INFO L358 AbstractCegarLoop]: Starting to check reachability of 288 error locations. [2023-11-26 11:45:00,034 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:45:00,034 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2023-11-26 11:45:00,034 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:45:00,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:00,035 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] [2023-11-26 11:45:00,035 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:00,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:00,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1272888381, now seen corresponding path program 1 times [2023-11-26 11:45:00,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:00,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361504755] [2023-11-26 11:45:00,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:00,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:00,258 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 11:45:00,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:00,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361504755] [2023-11-26 11:45:00,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361504755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:00,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:00,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:00,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397601512] [2023-11-26 11:45:00,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:00,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:00,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:00,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:00,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:00,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1171 out of 1210 [2023-11-26 11:45:00,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1116 places, 1182 transitions, 2376 flow. Second operand has 3 states, 3 states have (on average 1172.3333333333333) internal successors, (3517), 3 states have internal predecessors, (3517), 0 states have call successors, (0), 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 11:45:00,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:00,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1171 of 1210 [2023-11-26 11:45:00,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:01,412 INFO L124 PetriNetUnfolderBase]: 75/1624 cut-off events. [2023-11-26 11:45:01,412 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2023-11-26 11:45:01,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1654 conditions, 1624 events. 75/1624 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7147 event pairs, 3 based on Foata normal form. 50/1352 useless extension candidates. Maximal degree in co-relation 1373. Up to 16 conditions per place. [2023-11-26 11:45:01,495 INFO L140 encePairwiseOnDemand]: 1183/1210 looper letters, 9 selfloop transitions, 2 changer transitions 4/1157 dead transitions. [2023-11-26 11:45:01,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1117 places, 1157 transitions, 2348 flow [2023-11-26 11:45:01,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:01,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3549 transitions. [2023-11-26 11:45:01,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9776859504132231 [2023-11-26 11:45:01,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3549 transitions. [2023-11-26 11:45:01,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3549 transitions. [2023-11-26 11:45:01,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:01,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3549 transitions. [2023-11-26 11:45:01,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1183.0) internal successors, (3549), 3 states have internal predecessors, (3549), 0 states have call successors, (0), 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 11:45:01,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:01,599 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:01,601 INFO L175 Difference]: Start difference. First operand has 1116 places, 1182 transitions, 2376 flow. Second operand 3 states and 3549 transitions. [2023-11-26 11:45:01,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1117 places, 1157 transitions, 2348 flow [2023-11-26 11:45:01,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1113 places, 1157 transitions, 2340 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 11:45:01,656 INFO L231 Difference]: Finished difference. Result has 1113 places, 1153 transitions, 2314 flow [2023-11-26 11:45:01,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2318, PETRI_DIFFERENCE_MINUEND_PLACES=1111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2314, PETRI_PLACES=1113, PETRI_TRANSITIONS=1153} [2023-11-26 11:45:01,666 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -3 predicate places. [2023-11-26 11:45:01,666 INFO L495 AbstractCegarLoop]: Abstraction has has 1113 places, 1153 transitions, 2314 flow [2023-11-26 11:45:01,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1172.3333333333333) internal successors, (3517), 3 states have internal predecessors, (3517), 0 states have call successors, (0), 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 11:45:01,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:01,670 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] [2023-11-26 11:45:01,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:45:01,671 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:01,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:01,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1113382079, now seen corresponding path program 1 times [2023-11-26 11:45:01,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:01,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890096007] [2023-11-26 11:45:01,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:01,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:01,825 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 11:45:01,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:01,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890096007] [2023-11-26 11:45:01,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890096007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:01,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:01,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:01,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82856213] [2023-11-26 11:45:01,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:01,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:01,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:01,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:01,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:01,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1171 out of 1210 [2023-11-26 11:45:01,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1113 places, 1153 transitions, 2314 flow. Second operand has 3 states, 3 states have (on average 1172.3333333333333) internal successors, (3517), 3 states have internal predecessors, (3517), 0 states have call successors, (0), 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 11:45:01,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:01,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1171 of 1210 [2023-11-26 11:45:01,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:02,791 INFO L124 PetriNetUnfolderBase]: 75/1619 cut-off events. [2023-11-26 11:45:02,792 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2023-11-26 11:45:02,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1644 conditions, 1619 events. 75/1619 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7411 event pairs, 3 based on Foata normal form. 0/1303 useless extension candidates. Maximal degree in co-relation 1606. Up to 16 conditions per place. [2023-11-26 11:45:02,858 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 9 selfloop transitions, 2 changer transitions 0/1152 dead transitions. [2023-11-26 11:45:02,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1110 places, 1152 transitions, 2334 flow [2023-11-26 11:45:02,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:02,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3525 transitions. [2023-11-26 11:45:02,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9710743801652892 [2023-11-26 11:45:02,871 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3525 transitions. [2023-11-26 11:45:02,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3525 transitions. [2023-11-26 11:45:02,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:02,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3525 transitions. [2023-11-26 11:45:02,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1175.0) internal successors, (3525), 3 states have internal predecessors, (3525), 0 states have call successors, (0), 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 11:45:02,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:02,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:02,906 INFO L175 Difference]: Start difference. First operand has 1113 places, 1153 transitions, 2314 flow. Second operand 3 states and 3525 transitions. [2023-11-26 11:45:02,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1110 places, 1152 transitions, 2334 flow [2023-11-26 11:45:02,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1108 places, 1152 transitions, 2330 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:02,933 INFO L231 Difference]: Finished difference. Result has 1108 places, 1152 transitions, 2312 flow [2023-11-26 11:45:02,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2308, PETRI_DIFFERENCE_MINUEND_PLACES=1106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2312, PETRI_PLACES=1108, PETRI_TRANSITIONS=1152} [2023-11-26 11:45:02,936 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -8 predicate places. [2023-11-26 11:45:02,937 INFO L495 AbstractCegarLoop]: Abstraction has has 1108 places, 1152 transitions, 2312 flow [2023-11-26 11:45:02,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1172.3333333333333) internal successors, (3517), 3 states have internal predecessors, (3517), 0 states have call successors, (0), 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 11:45:02,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:02,941 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] [2023-11-26 11:45:02,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:45:02,941 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:02,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:02,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1832690889, now seen corresponding path program 1 times [2023-11-26 11:45:02,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:02,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092175147] [2023-11-26 11:45:02,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:02,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:03,011 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 11:45:03,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:03,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092175147] [2023-11-26 11:45:03,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092175147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:03,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:03,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:03,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213483925] [2023-11-26 11:45:03,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:03,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:03,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:03,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:03,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:03,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1171 out of 1210 [2023-11-26 11:45:03,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1108 places, 1152 transitions, 2312 flow. Second operand has 3 states, 3 states have (on average 1172.3333333333333) internal successors, (3517), 3 states have internal predecessors, (3517), 0 states have call successors, (0), 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 11:45:03,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:03,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1171 of 1210 [2023-11-26 11:45:03,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:03,773 INFO L124 PetriNetUnfolderBase]: 75/1618 cut-off events. [2023-11-26 11:45:03,773 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2023-11-26 11:45:03,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1643 conditions, 1618 events. 75/1618 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 7165 event pairs, 3 based on Foata normal form. 0/1302 useless extension candidates. Maximal degree in co-relation 1597. Up to 16 conditions per place. [2023-11-26 11:45:03,835 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 9 selfloop transitions, 2 changer transitions 0/1151 dead transitions. [2023-11-26 11:45:03,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1109 places, 1151 transitions, 2332 flow [2023-11-26 11:45:03,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3525 transitions. [2023-11-26 11:45:03,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9710743801652892 [2023-11-26 11:45:03,847 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3525 transitions. [2023-11-26 11:45:03,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3525 transitions. [2023-11-26 11:45:03,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:03,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3525 transitions. [2023-11-26 11:45:03,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1175.0) internal successors, (3525), 3 states have internal predecessors, (3525), 0 states have call successors, (0), 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 11:45:03,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:03,882 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:03,882 INFO L175 Difference]: Start difference. First operand has 1108 places, 1152 transitions, 2312 flow. Second operand 3 states and 3525 transitions. [2023-11-26 11:45:03,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1109 places, 1151 transitions, 2332 flow [2023-11-26 11:45:03,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1107 places, 1151 transitions, 2328 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:03,910 INFO L231 Difference]: Finished difference. Result has 1107 places, 1151 transitions, 2310 flow [2023-11-26 11:45:03,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2306, PETRI_DIFFERENCE_MINUEND_PLACES=1105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2310, PETRI_PLACES=1107, PETRI_TRANSITIONS=1151} [2023-11-26 11:45:03,914 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -9 predicate places. [2023-11-26 11:45:03,914 INFO L495 AbstractCegarLoop]: Abstraction has has 1107 places, 1151 transitions, 2310 flow [2023-11-26 11:45:03,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1172.3333333333333) internal successors, (3517), 3 states have internal predecessors, (3517), 0 states have call successors, (0), 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 11:45:03,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:03,918 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] [2023-11-26 11:45:03,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:45:03,918 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:03,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:03,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1003627711, now seen corresponding path program 1 times [2023-11-26 11:45:03,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:03,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457412519] [2023-11-26 11:45:03,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:03,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:03,987 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 11:45:03,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:03,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457412519] [2023-11-26 11:45:03,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457412519] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:03,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:03,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:03,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469845867] [2023-11-26 11:45:03,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:03,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:03,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:03,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:03,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:04,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1171 out of 1210 [2023-11-26 11:45:04,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1107 places, 1151 transitions, 2310 flow. Second operand has 3 states, 3 states have (on average 1172.3333333333333) internal successors, (3517), 3 states have internal predecessors, (3517), 0 states have call successors, (0), 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 11:45:04,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:04,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1171 of 1210 [2023-11-26 11:45:04,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:04,706 INFO L124 PetriNetUnfolderBase]: 76/1654 cut-off events. [2023-11-26 11:45:04,707 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2023-11-26 11:45:04,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 1654 events. 76/1654 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7636 event pairs, 3 based on Foata normal form. 0/1335 useless extension candidates. Maximal degree in co-relation 1626. Up to 17 conditions per place. [2023-11-26 11:45:04,781 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 9 selfloop transitions, 2 changer transitions 0/1150 dead transitions. [2023-11-26 11:45:04,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1108 places, 1150 transitions, 2330 flow [2023-11-26 11:45:04,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:04,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3525 transitions. [2023-11-26 11:45:04,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9710743801652892 [2023-11-26 11:45:04,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3525 transitions. [2023-11-26 11:45:04,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3525 transitions. [2023-11-26 11:45:04,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:04,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3525 transitions. [2023-11-26 11:45:04,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1175.0) internal successors, (3525), 3 states have internal predecessors, (3525), 0 states have call successors, (0), 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 11:45:04,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:04,820 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:04,820 INFO L175 Difference]: Start difference. First operand has 1107 places, 1151 transitions, 2310 flow. Second operand 3 states and 3525 transitions. [2023-11-26 11:45:04,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1108 places, 1150 transitions, 2330 flow [2023-11-26 11:45:04,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1106 places, 1150 transitions, 2326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:04,846 INFO L231 Difference]: Finished difference. Result has 1106 places, 1150 transitions, 2308 flow [2023-11-26 11:45:04,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2304, PETRI_DIFFERENCE_MINUEND_PLACES=1104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2308, PETRI_PLACES=1106, PETRI_TRANSITIONS=1150} [2023-11-26 11:45:04,851 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -10 predicate places. [2023-11-26 11:45:04,851 INFO L495 AbstractCegarLoop]: Abstraction has has 1106 places, 1150 transitions, 2308 flow [2023-11-26 11:45:04,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1172.3333333333333) internal successors, (3517), 3 states have internal predecessors, (3517), 0 states have call successors, (0), 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 11:45:04,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:04,853 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] [2023-11-26 11:45:04,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:45:04,854 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:04,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:04,854 INFO L85 PathProgramCache]: Analyzing trace with hash 584902917, now seen corresponding path program 1 times [2023-11-26 11:45:04,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:04,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079432844] [2023-11-26 11:45:04,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:04,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:04,963 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 11:45:04,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:04,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079432844] [2023-11-26 11:45:04,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079432844] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:04,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:04,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:04,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484965383] [2023-11-26 11:45:04,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:04,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:04,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:04,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:04,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:05,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1162 out of 1210 [2023-11-26 11:45:05,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1106 places, 1150 transitions, 2308 flow. Second operand has 3 states, 3 states have (on average 1163.3333333333333) internal successors, (3490), 3 states have internal predecessors, (3490), 0 states have call successors, (0), 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 11:45:05,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:05,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1162 of 1210 [2023-11-26 11:45:05,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:06,438 INFO L124 PetriNetUnfolderBase]: 265/5253 cut-off events. [2023-11-26 11:45:06,438 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2023-11-26 11:45:06,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5307 conditions, 5253 events. 265/5253 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 38188 event pairs, 9 based on Foata normal form. 0/4150 useless extension candidates. Maximal degree in co-relation 5245. Up to 37 conditions per place. [2023-11-26 11:45:06,517 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 18 selfloop transitions, 2 changer transitions 0/1149 dead transitions. [2023-11-26 11:45:06,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1107 places, 1149 transitions, 2346 flow [2023-11-26 11:45:06,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3507 transitions. [2023-11-26 11:45:06,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9661157024793389 [2023-11-26 11:45:06,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3507 transitions. [2023-11-26 11:45:06,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3507 transitions. [2023-11-26 11:45:06,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:06,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3507 transitions. [2023-11-26 11:45:06,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1169.0) internal successors, (3507), 3 states have internal predecessors, (3507), 0 states have call successors, (0), 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 11:45:06,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:06,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:06,558 INFO L175 Difference]: Start difference. First operand has 1106 places, 1150 transitions, 2308 flow. Second operand 3 states and 3507 transitions. [2023-11-26 11:45:06,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1107 places, 1149 transitions, 2346 flow [2023-11-26 11:45:06,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1105 places, 1149 transitions, 2342 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:06,582 INFO L231 Difference]: Finished difference. Result has 1105 places, 1149 transitions, 2306 flow [2023-11-26 11:45:06,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2302, PETRI_DIFFERENCE_MINUEND_PLACES=1103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2306, PETRI_PLACES=1105, PETRI_TRANSITIONS=1149} [2023-11-26 11:45:06,588 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -11 predicate places. [2023-11-26 11:45:06,588 INFO L495 AbstractCegarLoop]: Abstraction has has 1105 places, 1149 transitions, 2306 flow [2023-11-26 11:45:06,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1163.3333333333333) internal successors, (3490), 3 states have internal predecessors, (3490), 0 states have call successors, (0), 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 11:45:06,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:06,590 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] [2023-11-26 11:45:06,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:45:06,591 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:06,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:06,592 INFO L85 PathProgramCache]: Analyzing trace with hash 738446062, now seen corresponding path program 1 times [2023-11-26 11:45:06,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:06,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062367801] [2023-11-26 11:45:06,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:06,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:06,677 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 11:45:06,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:06,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062367801] [2023-11-26 11:45:06,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062367801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:06,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:06,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:06,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537598084] [2023-11-26 11:45:06,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:06,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:06,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:06,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:06,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:06,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1158 out of 1210 [2023-11-26 11:45:06,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1105 places, 1149 transitions, 2306 flow. Second operand has 3 states, 3 states have (on average 1159.3333333333333) internal successors, (3478), 3 states have internal predecessors, (3478), 0 states have call successors, (0), 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 11:45:06,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:06,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1158 of 1210 [2023-11-26 11:45:06,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:08,902 INFO L124 PetriNetUnfolderBase]: 409/7988 cut-off events. [2023-11-26 11:45:08,902 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2023-11-26 11:45:08,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8064 conditions, 7988 events. 409/7988 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 66318 event pairs, 15 based on Foata normal form. 0/6292 useless extension candidates. Maximal degree in co-relation 7994. Up to 53 conditions per place. [2023-11-26 11:45:08,997 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 22 selfloop transitions, 2 changer transitions 0/1148 dead transitions. [2023-11-26 11:45:08,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1106 places, 1148 transitions, 2352 flow [2023-11-26 11:45:08,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:09,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3499 transitions. [2023-11-26 11:45:09,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9639118457300275 [2023-11-26 11:45:09,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3499 transitions. [2023-11-26 11:45:09,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3499 transitions. [2023-11-26 11:45:09,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:09,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3499 transitions. [2023-11-26 11:45:09,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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 11:45:09,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:09,047 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:09,047 INFO L175 Difference]: Start difference. First operand has 1105 places, 1149 transitions, 2306 flow. Second operand 3 states and 3499 transitions. [2023-11-26 11:45:09,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1106 places, 1148 transitions, 2352 flow [2023-11-26 11:45:09,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1104 places, 1148 transitions, 2348 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:09,077 INFO L231 Difference]: Finished difference. Result has 1104 places, 1148 transitions, 2304 flow [2023-11-26 11:45:09,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=1102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2304, PETRI_PLACES=1104, PETRI_TRANSITIONS=1148} [2023-11-26 11:45:09,081 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -12 predicate places. [2023-11-26 11:45:09,081 INFO L495 AbstractCegarLoop]: Abstraction has has 1104 places, 1148 transitions, 2304 flow [2023-11-26 11:45:09,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1159.3333333333333) internal successors, (3478), 3 states have internal predecessors, (3478), 0 states have call successors, (0), 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 11:45:09,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:09,083 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] [2023-11-26 11:45:09,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:45:09,084 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:09,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:09,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1446297600, now seen corresponding path program 1 times [2023-11-26 11:45:09,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:09,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932332526] [2023-11-26 11:45:09,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:09,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:09,175 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 11:45:09,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:09,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932332526] [2023-11-26 11:45:09,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932332526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:09,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:09,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:09,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391210365] [2023-11-26 11:45:09,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:09,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:09,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:09,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:09,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:09,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1162 out of 1210 [2023-11-26 11:45:09,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1104 places, 1148 transitions, 2304 flow. Second operand has 3 states, 3 states have (on average 1163.3333333333333) internal successors, (3490), 3 states have internal predecessors, (3490), 0 states have call successors, (0), 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 11:45:09,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:09,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1162 of 1210 [2023-11-26 11:45:09,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:10,018 INFO L124 PetriNetUnfolderBase]: 58/1239 cut-off events. [2023-11-26 11:45:10,018 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2023-11-26 11:45:10,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 1239 events. 58/1239 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 5458 event pairs, 9 based on Foata normal form. 0/1015 useless extension candidates. Maximal degree in co-relation 1206. Up to 37 conditions per place. [2023-11-26 11:45:10,059 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 18 selfloop transitions, 2 changer transitions 0/1147 dead transitions. [2023-11-26 11:45:10,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1105 places, 1147 transitions, 2342 flow [2023-11-26 11:45:10,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:10,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3507 transitions. [2023-11-26 11:45:10,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9661157024793389 [2023-11-26 11:45:10,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3507 transitions. [2023-11-26 11:45:10,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3507 transitions. [2023-11-26 11:45:10,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:10,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3507 transitions. [2023-11-26 11:45:10,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1169.0) internal successors, (3507), 3 states have internal predecessors, (3507), 0 states have call successors, (0), 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 11:45:10,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:10,097 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:10,098 INFO L175 Difference]: Start difference. First operand has 1104 places, 1148 transitions, 2304 flow. Second operand 3 states and 3507 transitions. [2023-11-26 11:45:10,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1105 places, 1147 transitions, 2342 flow [2023-11-26 11:45:10,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1103 places, 1147 transitions, 2338 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:10,123 INFO L231 Difference]: Finished difference. Result has 1103 places, 1147 transitions, 2302 flow [2023-11-26 11:45:10,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2298, PETRI_DIFFERENCE_MINUEND_PLACES=1101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2302, PETRI_PLACES=1103, PETRI_TRANSITIONS=1147} [2023-11-26 11:45:10,126 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -13 predicate places. [2023-11-26 11:45:10,127 INFO L495 AbstractCegarLoop]: Abstraction has has 1103 places, 1147 transitions, 2302 flow [2023-11-26 11:45:10,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1163.3333333333333) internal successors, (3490), 3 states have internal predecessors, (3490), 0 states have call successors, (0), 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 11:45:10,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:10,129 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] [2023-11-26 11:45:10,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:45:10,129 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:10,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:10,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2144874012, now seen corresponding path program 1 times [2023-11-26 11:45:10,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:10,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897456910] [2023-11-26 11:45:10,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:10,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:10,216 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 11:45:10,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:10,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897456910] [2023-11-26 11:45:10,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897456910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:10,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:10,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:10,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707160559] [2023-11-26 11:45:10,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:10,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:10,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:10,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:10,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:10,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1158 out of 1210 [2023-11-26 11:45:10,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1103 places, 1147 transitions, 2302 flow. Second operand has 3 states, 3 states have (on average 1159.3333333333333) internal successors, (3478), 3 states have internal predecessors, (3478), 0 states have call successors, (0), 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 11:45:10,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:10,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1158 of 1210 [2023-11-26 11:45:10,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:10,824 INFO L124 PetriNetUnfolderBase]: 81/1494 cut-off events. [2023-11-26 11:45:10,824 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2023-11-26 11:45:10,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1556 conditions, 1494 events. 81/1494 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 7315 event pairs, 15 based on Foata normal form. 0/1208 useless extension candidates. Maximal degree in co-relation 1470. Up to 54 conditions per place. [2023-11-26 11:45:10,888 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 22 selfloop transitions, 2 changer transitions 0/1146 dead transitions. [2023-11-26 11:45:10,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1104 places, 1146 transitions, 2348 flow [2023-11-26 11:45:10,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3499 transitions. [2023-11-26 11:45:10,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9639118457300275 [2023-11-26 11:45:10,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3499 transitions. [2023-11-26 11:45:10,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3499 transitions. [2023-11-26 11:45:10,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:10,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3499 transitions. [2023-11-26 11:45:10,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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 11:45:10,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:10,923 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:10,924 INFO L175 Difference]: Start difference. First operand has 1103 places, 1147 transitions, 2302 flow. Second operand 3 states and 3499 transitions. [2023-11-26 11:45:10,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1104 places, 1146 transitions, 2348 flow [2023-11-26 11:45:10,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1102 places, 1146 transitions, 2344 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:10,950 INFO L231 Difference]: Finished difference. Result has 1102 places, 1146 transitions, 2300 flow [2023-11-26 11:45:10,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2296, PETRI_DIFFERENCE_MINUEND_PLACES=1100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2300, PETRI_PLACES=1102, PETRI_TRANSITIONS=1146} [2023-11-26 11:45:10,953 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -14 predicate places. [2023-11-26 11:45:10,953 INFO L495 AbstractCegarLoop]: Abstraction has has 1102 places, 1146 transitions, 2300 flow [2023-11-26 11:45:10,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1159.3333333333333) internal successors, (3478), 3 states have internal predecessors, (3478), 0 states have call successors, (0), 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 11:45:10,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:10,956 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] [2023-11-26 11:45:10,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:45:10,956 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:10,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:10,957 INFO L85 PathProgramCache]: Analyzing trace with hash 912171597, now seen corresponding path program 1 times [2023-11-26 11:45:10,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:10,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093461685] [2023-11-26 11:45:10,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:10,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:11,044 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 11:45:11,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:11,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093461685] [2023-11-26 11:45:11,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093461685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:11,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:11,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:11,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762274083] [2023-11-26 11:45:11,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:11,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:11,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:11,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:11,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:11,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1165 out of 1210 [2023-11-26 11:45:11,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1102 places, 1146 transitions, 2300 flow. Second operand has 3 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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 11:45:11,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:11,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1165 of 1210 [2023-11-26 11:45:11,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:11,871 INFO L124 PetriNetUnfolderBase]: 188/3400 cut-off events. [2023-11-26 11:45:11,871 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-26 11:45:11,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3476 conditions, 3400 events. 188/3400 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 24046 event pairs, 24 based on Foata normal form. 0/2696 useless extension candidates. Maximal degree in co-relation 3382. Up to 64 conditions per place. [2023-11-26 11:45:11,930 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 15 selfloop transitions, 2 changer transitions 0/1145 dead transitions. [2023-11-26 11:45:11,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1103 places, 1145 transitions, 2332 flow [2023-11-26 11:45:11,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:11,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3513 transitions. [2023-11-26 11:45:11,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9677685950413223 [2023-11-26 11:45:11,940 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3513 transitions. [2023-11-26 11:45:11,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3513 transitions. [2023-11-26 11:45:11,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:11,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3513 transitions. [2023-11-26 11:45:11,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1171.0) internal successors, (3513), 3 states have internal predecessors, (3513), 0 states have call successors, (0), 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 11:45:11,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:11,961 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:11,961 INFO L175 Difference]: Start difference. First operand has 1102 places, 1146 transitions, 2300 flow. Second operand 3 states and 3513 transitions. [2023-11-26 11:45:11,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1103 places, 1145 transitions, 2332 flow [2023-11-26 11:45:11,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1101 places, 1145 transitions, 2328 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:11,986 INFO L231 Difference]: Finished difference. Result has 1101 places, 1145 transitions, 2298 flow [2023-11-26 11:45:11,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2294, PETRI_DIFFERENCE_MINUEND_PLACES=1099, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2298, PETRI_PLACES=1101, PETRI_TRANSITIONS=1145} [2023-11-26 11:45:11,990 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -15 predicate places. [2023-11-26 11:45:11,990 INFO L495 AbstractCegarLoop]: Abstraction has has 1101 places, 1145 transitions, 2298 flow [2023-11-26 11:45:11,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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 11:45:11,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:11,991 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] [2023-11-26 11:45:11,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:45:11,992 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:11,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:11,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1962596976, now seen corresponding path program 1 times [2023-11-26 11:45:11,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:11,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672830656] [2023-11-26 11:45:11,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:11,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:12,032 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 11:45:12,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:12,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672830656] [2023-11-26 11:45:12,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672830656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:12,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:12,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:12,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152447210] [2023-11-26 11:45:12,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:12,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:12,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:12,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:12,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:12,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1165 out of 1210 [2023-11-26 11:45:12,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1101 places, 1145 transitions, 2298 flow. Second operand has 3 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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 11:45:12,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:12,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1165 of 1210 [2023-11-26 11:45:12,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:12,876 INFO L124 PetriNetUnfolderBase]: 188/3427 cut-off events. [2023-11-26 11:45:12,876 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2023-11-26 11:45:12,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3503 conditions, 3427 events. 188/3427 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 23982 event pairs, 24 based on Foata normal form. 0/2718 useless extension candidates. Maximal degree in co-relation 3402. Up to 64 conditions per place. [2023-11-26 11:45:12,913 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 15 selfloop transitions, 2 changer transitions 0/1144 dead transitions. [2023-11-26 11:45:12,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1102 places, 1144 transitions, 2330 flow [2023-11-26 11:45:12,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:12,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3513 transitions. [2023-11-26 11:45:12,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9677685950413223 [2023-11-26 11:45:12,923 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3513 transitions. [2023-11-26 11:45:12,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3513 transitions. [2023-11-26 11:45:12,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:12,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3513 transitions. [2023-11-26 11:45:12,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1171.0) internal successors, (3513), 3 states have internal predecessors, (3513), 0 states have call successors, (0), 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 11:45:12,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:12,939 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:12,940 INFO L175 Difference]: Start difference. First operand has 1101 places, 1145 transitions, 2298 flow. Second operand 3 states and 3513 transitions. [2023-11-26 11:45:12,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1102 places, 1144 transitions, 2330 flow [2023-11-26 11:45:12,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1100 places, 1144 transitions, 2326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:12,964 INFO L231 Difference]: Finished difference. Result has 1100 places, 1144 transitions, 2296 flow [2023-11-26 11:45:12,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2292, PETRI_DIFFERENCE_MINUEND_PLACES=1098, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2296, PETRI_PLACES=1100, PETRI_TRANSITIONS=1144} [2023-11-26 11:45:12,968 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -16 predicate places. [2023-11-26 11:45:12,968 INFO L495 AbstractCegarLoop]: Abstraction has has 1100 places, 1144 transitions, 2296 flow [2023-11-26 11:45:12,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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 11:45:12,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:12,969 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] [2023-11-26 11:45:12,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:45:12,970 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:12,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:12,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1409736677, now seen corresponding path program 1 times [2023-11-26 11:45:12,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:12,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106658777] [2023-11-26 11:45:12,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:12,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:13,015 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 11:45:13,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:13,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106658777] [2023-11-26 11:45:13,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106658777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:13,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:13,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:13,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263011478] [2023-11-26 11:45:13,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:13,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:13,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:13,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:13,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:13,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1159 out of 1210 [2023-11-26 11:45:13,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1100 places, 1144 transitions, 2296 flow. Second operand has 3 states, 3 states have (on average 1160.3333333333333) internal successors, (3481), 3 states have internal predecessors, (3481), 0 states have call successors, (0), 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 11:45:13,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:13,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1159 of 1210 [2023-11-26 11:45:13,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:14,669 INFO L124 PetriNetUnfolderBase]: 385/7527 cut-off events. [2023-11-26 11:45:14,669 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2023-11-26 11:45:14,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7599 conditions, 7527 events. 385/7527 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 61827 event pairs, 14 based on Foata normal form. 0/5937 useless extension candidates. Maximal degree in co-relation 7491. Up to 50 conditions per place. [2023-11-26 11:45:14,734 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 21 selfloop transitions, 2 changer transitions 0/1143 dead transitions. [2023-11-26 11:45:14,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1101 places, 1143 transitions, 2340 flow [2023-11-26 11:45:14,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:14,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3501 transitions. [2023-11-26 11:45:14,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9644628099173553 [2023-11-26 11:45:14,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3501 transitions. [2023-11-26 11:45:14,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3501 transitions. [2023-11-26 11:45:14,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:14,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3501 transitions. [2023-11-26 11:45:14,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1167.0) internal successors, (3501), 3 states have internal predecessors, (3501), 0 states have call successors, (0), 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 11:45:14,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:14,765 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:14,765 INFO L175 Difference]: Start difference. First operand has 1100 places, 1144 transitions, 2296 flow. Second operand 3 states and 3501 transitions. [2023-11-26 11:45:14,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1101 places, 1143 transitions, 2340 flow [2023-11-26 11:45:14,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1099 places, 1143 transitions, 2336 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:14,795 INFO L231 Difference]: Finished difference. Result has 1099 places, 1143 transitions, 2294 flow [2023-11-26 11:45:14,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2290, PETRI_DIFFERENCE_MINUEND_PLACES=1097, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2294, PETRI_PLACES=1099, PETRI_TRANSITIONS=1143} [2023-11-26 11:45:14,798 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -17 predicate places. [2023-11-26 11:45:14,799 INFO L495 AbstractCegarLoop]: Abstraction has has 1099 places, 1143 transitions, 2294 flow [2023-11-26 11:45:14,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1160.3333333333333) internal successors, (3481), 3 states have internal predecessors, (3481), 0 states have call successors, (0), 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 11:45:14,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:14,800 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] [2023-11-26 11:45:14,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:45:14,800 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:14,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:14,801 INFO L85 PathProgramCache]: Analyzing trace with hash 495694408, now seen corresponding path program 1 times [2023-11-26 11:45:14,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:14,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300735399] [2023-11-26 11:45:14,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:14,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:14,852 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 11:45:14,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:14,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300735399] [2023-11-26 11:45:14,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300735399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:14,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:14,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:14,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805109744] [2023-11-26 11:45:14,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:14,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:14,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:14,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:14,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:14,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1159 out of 1210 [2023-11-26 11:45:14,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1099 places, 1143 transitions, 2294 flow. Second operand has 3 states, 3 states have (on average 1160.3333333333333) internal successors, (3481), 3 states have internal predecessors, (3481), 0 states have call successors, (0), 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 11:45:14,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:14,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1159 of 1210 [2023-11-26 11:45:14,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:15,614 INFO L124 PetriNetUnfolderBase]: 80/1483 cut-off events. [2023-11-26 11:45:15,614 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2023-11-26 11:45:15,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1542 conditions, 1483 events. 80/1483 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 7237 event pairs, 14 based on Foata normal form. 0/1202 useless extension candidates. Maximal degree in co-relation 1427. Up to 51 conditions per place. [2023-11-26 11:45:15,657 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 21 selfloop transitions, 2 changer transitions 0/1142 dead transitions. [2023-11-26 11:45:15,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1100 places, 1142 transitions, 2338 flow [2023-11-26 11:45:15,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:15,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3501 transitions. [2023-11-26 11:45:15,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9644628099173553 [2023-11-26 11:45:15,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3501 transitions. [2023-11-26 11:45:15,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3501 transitions. [2023-11-26 11:45:15,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:15,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3501 transitions. [2023-11-26 11:45:15,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1167.0) internal successors, (3501), 3 states have internal predecessors, (3501), 0 states have call successors, (0), 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 11:45:15,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:15,683 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:15,684 INFO L175 Difference]: Start difference. First operand has 1099 places, 1143 transitions, 2294 flow. Second operand 3 states and 3501 transitions. [2023-11-26 11:45:15,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1100 places, 1142 transitions, 2338 flow [2023-11-26 11:45:15,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1098 places, 1142 transitions, 2334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:15,715 INFO L231 Difference]: Finished difference. Result has 1098 places, 1142 transitions, 2292 flow [2023-11-26 11:45:15,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2288, PETRI_DIFFERENCE_MINUEND_PLACES=1096, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2292, PETRI_PLACES=1098, PETRI_TRANSITIONS=1142} [2023-11-26 11:45:15,718 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -18 predicate places. [2023-11-26 11:45:15,718 INFO L495 AbstractCegarLoop]: Abstraction has has 1098 places, 1142 transitions, 2292 flow [2023-11-26 11:45:15,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1160.3333333333333) internal successors, (3481), 3 states have internal predecessors, (3481), 0 states have call successors, (0), 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 11:45:15,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:15,720 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] [2023-11-26 11:45:15,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:45:15,720 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:15,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:15,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1958662170, now seen corresponding path program 1 times [2023-11-26 11:45:15,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:15,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322888681] [2023-11-26 11:45:15,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:15,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:15,894 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 11:45:15,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:15,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322888681] [2023-11-26 11:45:15,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322888681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:15,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:15,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:15,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019133217] [2023-11-26 11:45:15,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:15,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:15,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:15,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:15,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:16,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1134 out of 1210 [2023-11-26 11:45:16,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1098 places, 1142 transitions, 2292 flow. Second operand has 3 states, 3 states have (on average 1136.0) internal successors, (3408), 3 states have internal predecessors, (3408), 0 states have call successors, (0), 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 11:45:16,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:16,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1134 of 1210 [2023-11-26 11:45:16,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:17,667 INFO L124 PetriNetUnfolderBase]: 921/5972 cut-off events. [2023-11-26 11:45:17,667 INFO L125 PetriNetUnfolderBase]: For 10/15 co-relation queries the response was YES. [2023-11-26 11:45:17,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7155 conditions, 5972 events. 921/5972 cut-off events. For 10/15 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 56754 event pairs, 688 based on Foata normal form. 0/4562 useless extension candidates. Maximal degree in co-relation 7034. Up to 1165 conditions per place. [2023-11-26 11:45:17,755 INFO L140 encePairwiseOnDemand]: 1204/1210 looper letters, 44 selfloop transitions, 4 changer transitions 0/1140 dead transitions. [2023-11-26 11:45:17,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1098 places, 1140 transitions, 2384 flow [2023-11-26 11:45:17,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3452 transitions. [2023-11-26 11:45:17,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9509641873278237 [2023-11-26 11:45:17,763 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3452 transitions. [2023-11-26 11:45:17,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3452 transitions. [2023-11-26 11:45:17,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:17,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3452 transitions. [2023-11-26 11:45:17,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1150.6666666666667) internal successors, (3452), 3 states have internal predecessors, (3452), 0 states have call successors, (0), 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 11:45:17,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:17,773 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:17,773 INFO L175 Difference]: Start difference. First operand has 1098 places, 1142 transitions, 2292 flow. Second operand 3 states and 3452 transitions. [2023-11-26 11:45:17,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1098 places, 1140 transitions, 2384 flow [2023-11-26 11:45:17,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1096 places, 1140 transitions, 2380 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:17,794 INFO L231 Difference]: Finished difference. Result has 1096 places, 1140 transitions, 2292 flow [2023-11-26 11:45:17,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2284, PETRI_DIFFERENCE_MINUEND_PLACES=1094, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2292, PETRI_PLACES=1096, PETRI_TRANSITIONS=1140} [2023-11-26 11:45:17,797 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -20 predicate places. [2023-11-26 11:45:17,798 INFO L495 AbstractCegarLoop]: Abstraction has has 1096 places, 1140 transitions, 2292 flow [2023-11-26 11:45:17,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1136.0) internal successors, (3408), 3 states have internal predecessors, (3408), 0 states have call successors, (0), 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 11:45:17,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:17,799 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, 1, 1, 1] [2023-11-26 11:45:17,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:45:17,799 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:17,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:17,800 INFO L85 PathProgramCache]: Analyzing trace with hash -303711332, now seen corresponding path program 1 times [2023-11-26 11:45:17,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:17,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007218658] [2023-11-26 11:45:17,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:17,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:17,855 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 11:45:17,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:17,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007218658] [2023-11-26 11:45:17,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007218658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:17,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:17,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:17,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635865512] [2023-11-26 11:45:17,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:17,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:17,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:17,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:17,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:17,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1165 out of 1210 [2023-11-26 11:45:17,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1096 places, 1140 transitions, 2292 flow. Second operand has 3 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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 11:45:17,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:17,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1165 of 1210 [2023-11-26 11:45:17,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:18,618 INFO L124 PetriNetUnfolderBase]: 165/3019 cut-off events. [2023-11-26 11:45:18,618 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2023-11-26 11:45:18,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3097 conditions, 3019 events. 165/3019 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 18982 event pairs, 24 based on Foata normal form. 0/2412 useless extension candidates. Maximal degree in co-relation 3076. Up to 64 conditions per place. [2023-11-26 11:45:18,666 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 15 selfloop transitions, 2 changer transitions 0/1139 dead transitions. [2023-11-26 11:45:18,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1097 places, 1139 transitions, 2324 flow [2023-11-26 11:45:18,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3513 transitions. [2023-11-26 11:45:18,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9677685950413223 [2023-11-26 11:45:18,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3513 transitions. [2023-11-26 11:45:18,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3513 transitions. [2023-11-26 11:45:18,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:18,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3513 transitions. [2023-11-26 11:45:18,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1171.0) internal successors, (3513), 3 states have internal predecessors, (3513), 0 states have call successors, (0), 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 11:45:18,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:18,684 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:18,684 INFO L175 Difference]: Start difference. First operand has 1096 places, 1140 transitions, 2292 flow. Second operand 3 states and 3513 transitions. [2023-11-26 11:45:18,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1097 places, 1139 transitions, 2324 flow [2023-11-26 11:45:18,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1095 places, 1139 transitions, 2316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:18,702 INFO L231 Difference]: Finished difference. Result has 1095 places, 1139 transitions, 2286 flow [2023-11-26 11:45:18,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2282, PETRI_DIFFERENCE_MINUEND_PLACES=1093, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2286, PETRI_PLACES=1095, PETRI_TRANSITIONS=1139} [2023-11-26 11:45:18,705 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -21 predicate places. [2023-11-26 11:45:18,705 INFO L495 AbstractCegarLoop]: Abstraction has has 1095 places, 1139 transitions, 2286 flow [2023-11-26 11:45:18,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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 11:45:18,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:18,706 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:18,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 11:45:18,706 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:18,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:18,706 INFO L85 PathProgramCache]: Analyzing trace with hash 226602223, now seen corresponding path program 1 times [2023-11-26 11:45:18,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:18,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157249010] [2023-11-26 11:45:18,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:18,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:18,774 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 11:45:18,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:18,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157249010] [2023-11-26 11:45:18,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157249010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:18,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:18,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:18,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6488007] [2023-11-26 11:45:18,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:18,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:18,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:18,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:18,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:18,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1165 out of 1210 [2023-11-26 11:45:18,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1095 places, 1139 transitions, 2286 flow. Second operand has 3 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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 11:45:18,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:18,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1165 of 1210 [2023-11-26 11:45:18,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:19,991 INFO L124 PetriNetUnfolderBase]: 165/3018 cut-off events. [2023-11-26 11:45:19,992 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2023-11-26 11:45:20,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3094 conditions, 3018 events. 165/3018 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 18895 event pairs, 24 based on Foata normal form. 0/2405 useless extension candidates. Maximal degree in co-relation 2929. Up to 64 conditions per place. [2023-11-26 11:45:20,071 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 15 selfloop transitions, 2 changer transitions 0/1138 dead transitions. [2023-11-26 11:45:20,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1096 places, 1138 transitions, 2318 flow [2023-11-26 11:45:20,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:20,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3513 transitions. [2023-11-26 11:45:20,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9677685950413223 [2023-11-26 11:45:20,081 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3513 transitions. [2023-11-26 11:45:20,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3513 transitions. [2023-11-26 11:45:20,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:20,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3513 transitions. [2023-11-26 11:45:20,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1171.0) internal successors, (3513), 3 states have internal predecessors, (3513), 0 states have call successors, (0), 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 11:45:20,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:20,093 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:20,094 INFO L175 Difference]: Start difference. First operand has 1095 places, 1139 transitions, 2286 flow. Second operand 3 states and 3513 transitions. [2023-11-26 11:45:20,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1096 places, 1138 transitions, 2318 flow [2023-11-26 11:45:20,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1094 places, 1138 transitions, 2314 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:20,116 INFO L231 Difference]: Finished difference. Result has 1094 places, 1138 transitions, 2284 flow [2023-11-26 11:45:20,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2280, PETRI_DIFFERENCE_MINUEND_PLACES=1092, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2284, PETRI_PLACES=1094, PETRI_TRANSITIONS=1138} [2023-11-26 11:45:20,120 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -22 predicate places. [2023-11-26 11:45:20,120 INFO L495 AbstractCegarLoop]: Abstraction has has 1094 places, 1138 transitions, 2284 flow [2023-11-26 11:45:20,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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 11:45:20,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:20,122 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:20,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 11:45:20,122 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err57ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:20,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:20,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1419851932, now seen corresponding path program 1 times [2023-11-26 11:45:20,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:20,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37325683] [2023-11-26 11:45:20,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:20,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:20,207 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 11:45:20,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:20,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37325683] [2023-11-26 11:45:20,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37325683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:20,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:20,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:20,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581787790] [2023-11-26 11:45:20,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:20,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:20,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:20,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:20,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:20,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1155 out of 1210 [2023-11-26 11:45:20,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1094 places, 1138 transitions, 2284 flow. Second operand has 3 states, 3 states have (on average 1156.3333333333333) internal successors, (3469), 3 states have internal predecessors, (3469), 0 states have call successors, (0), 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 11:45:20,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:20,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1155 of 1210 [2023-11-26 11:45:20,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:21,773 INFO L124 PetriNetUnfolderBase]: 412/6351 cut-off events. [2023-11-26 11:45:21,773 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-26 11:45:21,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6573 conditions, 6351 events. 412/6351 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 57902 event pairs, 56 based on Foata normal form. 0/5072 useless extension candidates. Maximal degree in co-relation 6365. Up to 204 conditions per place. [2023-11-26 11:45:21,852 INFO L140 encePairwiseOnDemand]: 1196/1210 looper letters, 22 selfloop transitions, 6 changer transitions 0/1137 dead transitions. [2023-11-26 11:45:21,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1088 places, 1137 transitions, 2339 flow [2023-11-26 11:45:21,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:21,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3501 transitions. [2023-11-26 11:45:21,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9644628099173553 [2023-11-26 11:45:21,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3501 transitions. [2023-11-26 11:45:21,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3501 transitions. [2023-11-26 11:45:21,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:21,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3501 transitions. [2023-11-26 11:45:21,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1167.0) internal successors, (3501), 3 states have internal predecessors, (3501), 0 states have call successors, (0), 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 11:45:21,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:21,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:21,874 INFO L175 Difference]: Start difference. First operand has 1094 places, 1138 transitions, 2284 flow. Second operand 3 states and 3501 transitions. [2023-11-26 11:45:21,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1088 places, 1137 transitions, 2339 flow [2023-11-26 11:45:21,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1086 places, 1137 transitions, 2335 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:21,897 INFO L231 Difference]: Finished difference. Result has 1087 places, 1136 transitions, 2306 flow [2023-11-26 11:45:21,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2264, PETRI_DIFFERENCE_MINUEND_PLACES=1084, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2306, PETRI_PLACES=1087, PETRI_TRANSITIONS=1136} [2023-11-26 11:45:21,900 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -29 predicate places. [2023-11-26 11:45:21,900 INFO L495 AbstractCegarLoop]: Abstraction has has 1087 places, 1136 transitions, 2306 flow [2023-11-26 11:45:21,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1156.3333333333333) internal successors, (3469), 3 states have internal predecessors, (3469), 0 states have call successors, (0), 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 11:45:21,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:21,901 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:21,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 11:45:21,902 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err58ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:21,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:21,902 INFO L85 PathProgramCache]: Analyzing trace with hash -885352819, now seen corresponding path program 1 times [2023-11-26 11:45:21,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:21,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314972674] [2023-11-26 11:45:21,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:21,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:21,969 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 11:45:21,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:21,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314972674] [2023-11-26 11:45:21,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314972674] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:21,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:21,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:21,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571521618] [2023-11-26 11:45:21,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:21,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:21,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:21,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:21,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:22,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1155 out of 1210 [2023-11-26 11:45:22,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1087 places, 1136 transitions, 2306 flow. Second operand has 3 states, 3 states have (on average 1156.3333333333333) internal successors, (3469), 3 states have internal predecessors, (3469), 0 states have call successors, (0), 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 11:45:22,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:22,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1155 of 1210 [2023-11-26 11:45:22,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:22,808 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][439], [1207#(= |#race~is_null_1~0| 0), 721#L96-2true, 1212#(= |#race~is_null_5~0| 0), Black: 1205#true, 1017#L124-7true]) [2023-11-26 11:45:22,808 INFO L294 olderBase$Statistics]: this new event has 258 ancestors and is cut-off event [2023-11-26 11:45:22,808 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2023-11-26 11:45:22,808 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2023-11-26 11:45:22,808 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 11:45:22,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][439], [1207#(= |#race~is_null_1~0| 0), 843#L96-12true, 1212#(= |#race~is_null_5~0| 0), Black: 1205#true, 1017#L124-7true]) [2023-11-26 11:45:22,873 INFO L294 olderBase$Statistics]: this new event has 262 ancestors and is cut-off event [2023-11-26 11:45:22,874 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2023-11-26 11:45:22,874 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2023-11-26 11:45:22,874 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2023-11-26 11:45:22,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][439], [17#L96-13true, 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1205#true, 1017#L124-7true]) [2023-11-26 11:45:22,874 INFO L294 olderBase$Statistics]: this new event has 263 ancestors and is cut-off event [2023-11-26 11:45:22,874 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-26 11:45:22,874 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2023-11-26 11:45:22,874 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2023-11-26 11:45:24,023 INFO L124 PetriNetUnfolderBase]: 513/7607 cut-off events. [2023-11-26 11:45:24,023 INFO L125 PetriNetUnfolderBase]: For 26/27 co-relation queries the response was YES. [2023-11-26 11:45:24,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7932 conditions, 7607 events. 513/7607 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 73053 event pairs, 40 based on Foata normal form. 0/6113 useless extension candidates. Maximal degree in co-relation 6714. Up to 243 conditions per place. [2023-11-26 11:45:24,199 INFO L140 encePairwiseOnDemand]: 1196/1210 looper letters, 23 selfloop transitions, 6 changer transitions 0/1136 dead transitions. [2023-11-26 11:45:24,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1081 places, 1136 transitions, 2366 flow [2023-11-26 11:45:24,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:24,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3502 transitions. [2023-11-26 11:45:24,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9647382920110192 [2023-11-26 11:45:24,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3502 transitions. [2023-11-26 11:45:24,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3502 transitions. [2023-11-26 11:45:24,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:24,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3502 transitions. [2023-11-26 11:45:24,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1167.3333333333333) internal successors, (3502), 3 states have internal predecessors, (3502), 0 states have call successors, (0), 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 11:45:24,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:24,218 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:24,218 INFO L175 Difference]: Start difference. First operand has 1087 places, 1136 transitions, 2306 flow. Second operand 3 states and 3502 transitions. [2023-11-26 11:45:24,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1081 places, 1136 transitions, 2366 flow [2023-11-26 11:45:24,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1081 places, 1136 transitions, 2366 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:45:24,243 INFO L231 Difference]: Finished difference. Result has 1082 places, 1134 transitions, 2332 flow [2023-11-26 11:45:24,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2290, PETRI_DIFFERENCE_MINUEND_PLACES=1079, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2332, PETRI_PLACES=1082, PETRI_TRANSITIONS=1134} [2023-11-26 11:45:24,246 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -34 predicate places. [2023-11-26 11:45:24,246 INFO L495 AbstractCegarLoop]: Abstraction has has 1082 places, 1134 transitions, 2332 flow [2023-11-26 11:45:24,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1156.3333333333333) internal successors, (3469), 3 states have internal predecessors, (3469), 0 states have call successors, (0), 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 11:45:24,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:24,248 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:24,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 11:45:24,248 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:24,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:24,249 INFO L85 PathProgramCache]: Analyzing trace with hash -772323677, now seen corresponding path program 1 times [2023-11-26 11:45:24,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:24,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333720298] [2023-11-26 11:45:24,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:24,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:24,443 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 11:45:24,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:24,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333720298] [2023-11-26 11:45:24,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333720298] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:24,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:24,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:45:24,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701551668] [2023-11-26 11:45:24,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:24,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:45:24,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:24,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:45:24,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:45:24,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1162 out of 1210 [2023-11-26 11:45:24,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1082 places, 1134 transitions, 2332 flow. Second operand has 5 states, 5 states have (on average 1165.6) internal successors, (5828), 5 states have internal predecessors, (5828), 0 states have call successors, (0), 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 11:45:24,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:24,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1162 of 1210 [2023-11-26 11:45:24,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:25,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][665], [1207#(= |#race~is_null_1~0| 0), 444#L125-7true, 1212#(= |#race~is_null_5~0| 0), 1215#true, Black: 1205#true, Black: 1210#true]) [2023-11-26 11:45:25,431 INFO L294 olderBase$Statistics]: this new event has 295 ancestors and is not cut-off event [2023-11-26 11:45:25,431 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is not cut-off event [2023-11-26 11:45:25,431 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is not cut-off event [2023-11-26 11:45:25,431 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is not cut-off event [2023-11-26 11:45:26,017 INFO L124 PetriNetUnfolderBase]: 208/3846 cut-off events. [2023-11-26 11:45:26,017 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2023-11-26 11:45:26,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3958 conditions, 3846 events. 208/3846 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 29267 event pairs, 0 based on Foata normal form. 2/3113 useless extension candidates. Maximal degree in co-relation 3633. Up to 36 conditions per place. [2023-11-26 11:45:26,155 INFO L140 encePairwiseOnDemand]: 1196/1210 looper letters, 12 selfloop transitions, 12 changer transitions 0/1136 dead transitions. [2023-11-26 11:45:26,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1086 places, 1136 transitions, 2384 flow [2023-11-26 11:45:26,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:45:26,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:45:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5836 transitions. [2023-11-26 11:45:26,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9646280991735537 [2023-11-26 11:45:26,165 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 5836 transitions. [2023-11-26 11:45:26,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 5836 transitions. [2023-11-26 11:45:26,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:26,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 5836 transitions. [2023-11-26 11:45:26,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 1167.2) internal successors, (5836), 5 states have internal predecessors, (5836), 0 states have call successors, (0), 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 11:45:26,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1210.0) internal successors, (7260), 6 states have internal predecessors, (7260), 0 states have call successors, (0), 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 11:45:26,184 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1210.0) internal successors, (7260), 6 states have internal predecessors, (7260), 0 states have call successors, (0), 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 11:45:26,184 INFO L175 Difference]: Start difference. First operand has 1082 places, 1134 transitions, 2332 flow. Second operand 5 states and 5836 transitions. [2023-11-26 11:45:26,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1086 places, 1136 transitions, 2384 flow [2023-11-26 11:45:26,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1086 places, 1136 transitions, 2384 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:45:26,206 INFO L231 Difference]: Finished difference. Result has 1087 places, 1136 transitions, 2372 flow [2023-11-26 11:45:26,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2332, PETRI_DIFFERENCE_MINUEND_PLACES=1082, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2372, PETRI_PLACES=1087, PETRI_TRANSITIONS=1136} [2023-11-26 11:45:26,209 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -29 predicate places. [2023-11-26 11:45:26,209 INFO L495 AbstractCegarLoop]: Abstraction has has 1087 places, 1136 transitions, 2372 flow [2023-11-26 11:45:26,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1165.6) internal successors, (5828), 5 states have internal predecessors, (5828), 0 states have call successors, (0), 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 11:45:26,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:26,210 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:26,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 11:45:26,211 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:26,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:26,211 INFO L85 PathProgramCache]: Analyzing trace with hash -370427839, now seen corresponding path program 1 times [2023-11-26 11:45:26,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:26,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345609915] [2023-11-26 11:45:26,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:26,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 11:45:26,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:26,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345609915] [2023-11-26 11:45:26,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345609915] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:45:26,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511985524] [2023-11-26 11:45:26,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:26,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:45:26,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:45:26,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:45:26,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:45:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:26,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-26 11:45:26,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:45:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 11:45:26,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:45:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 11:45:26,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511985524] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:45:26,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:45:26,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2023-11-26 11:45:26,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633742937] [2023-11-26 11:45:26,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:45:26,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-26 11:45:26,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:26,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-26 11:45:26,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-11-26 11:45:27,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1156 out of 1210 [2023-11-26 11:45:27,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1087 places, 1136 transitions, 2372 flow. Second operand has 15 states, 15 states have (on average 1158.7333333333333) internal successors, (17381), 15 states have internal predecessors, (17381), 0 states have call successors, (0), 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 11:45:27,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:27,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1156 of 1210 [2023-11-26 11:45:27,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:28,523 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][681], [1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 444#L125-7true, 1215#true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 1205#true, 1226#true, Black: 1210#true]) [2023-11-26 11:45:28,523 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is not cut-off event [2023-11-26 11:45:28,524 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is not cut-off event [2023-11-26 11:45:28,524 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is not cut-off event [2023-11-26 11:45:28,524 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is not cut-off event [2023-11-26 11:45:29,272 INFO L124 PetriNetUnfolderBase]: 208/3872 cut-off events. [2023-11-26 11:45:29,272 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2023-11-26 11:45:29,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4028 conditions, 3872 events. 208/3872 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 29301 event pairs, 0 based on Foata normal form. 4/3141 useless extension candidates. Maximal degree in co-relation 3728. Up to 36 conditions per place. [2023-11-26 11:45:29,437 INFO L140 encePairwiseOnDemand]: 1190/1210 looper letters, 20 selfloop transitions, 26 changer transitions 0/1152 dead transitions. [2023-11-26 11:45:29,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1097 places, 1152 transitions, 2500 flow [2023-11-26 11:45:29,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 11:45:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-26 11:45:29,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12766 transitions. [2023-11-26 11:45:29,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9591284748309542 [2023-11-26 11:45:29,586 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 12766 transitions. [2023-11-26 11:45:29,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12766 transitions. [2023-11-26 11:45:29,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:29,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 12766 transitions. [2023-11-26 11:45:29,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 1160.5454545454545) internal successors, (12766), 11 states have internal predecessors, (12766), 0 states have call successors, (0), 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 11:45:29,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 1210.0) internal successors, (14520), 12 states have internal predecessors, (14520), 0 states have call successors, (0), 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 11:45:29,620 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 1210.0) internal successors, (14520), 12 states have internal predecessors, (14520), 0 states have call successors, (0), 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 11:45:29,620 INFO L175 Difference]: Start difference. First operand has 1087 places, 1136 transitions, 2372 flow. Second operand 11 states and 12766 transitions. [2023-11-26 11:45:29,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1097 places, 1152 transitions, 2500 flow [2023-11-26 11:45:29,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1094 places, 1152 transitions, 2480 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 11:45:29,641 INFO L231 Difference]: Finished difference. Result has 1097 places, 1148 transitions, 2472 flow [2023-11-26 11:45:29,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2352, PETRI_DIFFERENCE_MINUEND_PLACES=1084, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2472, PETRI_PLACES=1097, PETRI_TRANSITIONS=1148} [2023-11-26 11:45:29,644 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -19 predicate places. [2023-11-26 11:45:29,644 INFO L495 AbstractCegarLoop]: Abstraction has has 1097 places, 1148 transitions, 2472 flow [2023-11-26 11:45:29,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1158.7333333333333) internal successors, (17381), 15 states have internal predecessors, (17381), 0 states have call successors, (0), 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 11:45:29,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:29,647 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:29,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:45:29,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:45:29,855 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:29,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:29,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2006547199, now seen corresponding path program 2 times [2023-11-26 11:45:29,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:29,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549439911] [2023-11-26 11:45:29,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:29,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:30,300 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-26 11:45:30,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:30,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549439911] [2023-11-26 11:45:30,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549439911] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:45:30,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206409816] [2023-11-26 11:45:30,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 11:45:30,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:45:30,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:45:30,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:45:30,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 11:45:30,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-26 11:45:30,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:45:30,513 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-26 11:45:30,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:45:30,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-26 11:45:30,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-26 11:45:31,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:45:31,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-26 11:45:31,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:45:31,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-26 11:45:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-26 11:45:31,102 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:45:31,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206409816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:31,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 11:45:31,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2023-11-26 11:45:31,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354762492] [2023-11-26 11:45:31,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:31,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:45:31,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:31,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:45:31,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-11-26 11:45:31,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1168 out of 1210 [2023-11-26 11:45:31,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1097 places, 1148 transitions, 2472 flow. Second operand has 7 states, 7 states have (on average 1169.5714285714287) internal successors, (8187), 7 states have internal predecessors, (8187), 0 states have call successors, (0), 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 11:45:31,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:31,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1168 of 1210 [2023-11-26 11:45:31,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:32,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][676], [3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 1207#(= |#race~is_null_1~0| 0), 444#L125-7true, 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 1205#true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 1226#true, Black: 1210#true, Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|))]) [2023-11-26 11:45:32,624 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is not cut-off event [2023-11-26 11:45:32,624 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is not cut-off event [2023-11-26 11:45:32,624 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is not cut-off event [2023-11-26 11:45:32,624 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is not cut-off event [2023-11-26 11:45:33,361 INFO L124 PetriNetUnfolderBase]: 208/3871 cut-off events. [2023-11-26 11:45:33,361 INFO L125 PetriNetUnfolderBase]: For 20/42 co-relation queries the response was YES. [2023-11-26 11:45:33,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4041 conditions, 3871 events. 208/3871 cut-off events. For 20/42 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 29276 event pairs, 0 based on Foata normal form. 16/3153 useless extension candidates. Maximal degree in co-relation 3730. Up to 36 conditions per place. [2023-11-26 11:45:33,518 INFO L140 encePairwiseOnDemand]: 1204/1210 looper letters, 8 selfloop transitions, 5 changer transitions 0/1147 dead transitions. [2023-11-26 11:45:33,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1102 places, 1147 transitions, 2496 flow [2023-11-26 11:45:33,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:45:33,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 11:45:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8190 transitions. [2023-11-26 11:45:33,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9669421487603306 [2023-11-26 11:45:33,526 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 8190 transitions. [2023-11-26 11:45:33,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8190 transitions. [2023-11-26 11:45:33,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:33,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 8190 transitions. [2023-11-26 11:45:33,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 1170.0) internal successors, (8190), 7 states have internal predecessors, (8190), 0 states have call successors, (0), 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 11:45:33,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 1210.0) internal successors, (9680), 8 states have internal predecessors, (9680), 0 states have call successors, (0), 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 11:45:33,542 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 1210.0) internal successors, (9680), 8 states have internal predecessors, (9680), 0 states have call successors, (0), 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 11:45:33,542 INFO L175 Difference]: Start difference. First operand has 1097 places, 1148 transitions, 2472 flow. Second operand 7 states and 8190 transitions. [2023-11-26 11:45:33,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1102 places, 1147 transitions, 2496 flow [2023-11-26 11:45:33,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1099 places, 1147 transitions, 2472 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-26 11:45:33,565 INFO L231 Difference]: Finished difference. Result has 1099 places, 1147 transitions, 2456 flow [2023-11-26 11:45:33,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2446, PETRI_DIFFERENCE_MINUEND_PLACES=1093, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2456, PETRI_PLACES=1099, PETRI_TRANSITIONS=1147} [2023-11-26 11:45:33,567 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -17 predicate places. [2023-11-26 11:45:33,567 INFO L495 AbstractCegarLoop]: Abstraction has has 1099 places, 1147 transitions, 2456 flow [2023-11-26 11:45:33,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1169.5714285714287) internal successors, (8187), 7 states have internal predecessors, (8187), 0 states have call successors, (0), 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 11:45:33,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:33,570 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:33,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:45:33,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_468ed0d3-6151-4993-b728-fea56c90cc80/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:45:33,776 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:33,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:33,776 INFO L85 PathProgramCache]: Analyzing trace with hash 509297894, now seen corresponding path program 1 times [2023-11-26 11:45:33,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:33,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989409179] [2023-11-26 11:45:33,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:33,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-26 11:45:33,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:33,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989409179] [2023-11-26 11:45:33,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989409179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:33,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:33,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:33,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819922304] [2023-11-26 11:45:33,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:33,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:33,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:33,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:33,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:33,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1160 out of 1210 [2023-11-26 11:45:33,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1099 places, 1147 transitions, 2456 flow. Second operand has 3 states, 3 states have (on average 1161.6666666666667) internal successors, (3485), 3 states have internal predecessors, (3485), 0 states have call successors, (0), 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 11:45:33,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:33,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1160 of 1210 [2023-11-26 11:45:33,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:34,753 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][676], [3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 444#L125-7true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 1205#true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 1210#true, 3381#true]) [2023-11-26 11:45:34,753 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is not cut-off event [2023-11-26 11:45:34,753 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is not cut-off event [2023-11-26 11:45:34,754 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is not cut-off event [2023-11-26 11:45:34,754 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is not cut-off event [2023-11-26 11:45:35,288 INFO L124 PetriNetUnfolderBase]: 303/5032 cut-off events. [2023-11-26 11:45:35,288 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2023-11-26 11:45:35,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5347 conditions, 5032 events. 303/5032 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 42079 event pairs, 32 based on Foata normal form. 0/4060 useless extension candidates. Maximal degree in co-relation 5218. Up to 110 conditions per place. [2023-11-26 11:45:35,366 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 22 selfloop transitions, 2 changer transitions 0/1147 dead transitions. [2023-11-26 11:45:35,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1100 places, 1147 transitions, 2505 flow [2023-11-26 11:45:35,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3505 transitions. [2023-11-26 11:45:35,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9655647382920111 [2023-11-26 11:45:35,371 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3505 transitions. [2023-11-26 11:45:35,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3505 transitions. [2023-11-26 11:45:35,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:35,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3505 transitions. [2023-11-26 11:45:35,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1168.3333333333333) internal successors, (3505), 3 states have internal predecessors, (3505), 0 states have call successors, (0), 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 11:45:35,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:35,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:35,380 INFO L175 Difference]: Start difference. First operand has 1099 places, 1147 transitions, 2456 flow. Second operand 3 states and 3505 transitions. [2023-11-26 11:45:35,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1100 places, 1147 transitions, 2505 flow [2023-11-26 11:45:35,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1095 places, 1147 transitions, 2496 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-26 11:45:35,398 INFO L231 Difference]: Finished difference. Result has 1095 places, 1146 transitions, 2449 flow [2023-11-26 11:45:35,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2445, PETRI_DIFFERENCE_MINUEND_PLACES=1093, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2449, PETRI_PLACES=1095, PETRI_TRANSITIONS=1146} [2023-11-26 11:45:35,400 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -21 predicate places. [2023-11-26 11:45:35,400 INFO L495 AbstractCegarLoop]: Abstraction has has 1095 places, 1146 transitions, 2449 flow [2023-11-26 11:45:35,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1161.6666666666667) internal successors, (3485), 3 states have internal predecessors, (3485), 0 states have call successors, (0), 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 11:45:35,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:35,401 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:35,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-26 11:45:35,402 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:35,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:35,402 INFO L85 PathProgramCache]: Analyzing trace with hash -727975071, now seen corresponding path program 1 times [2023-11-26 11:45:35,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:35,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95360729] [2023-11-26 11:45:35,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:35,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-26 11:45:35,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:35,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95360729] [2023-11-26 11:45:35,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95360729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:35,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:35,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583927310] [2023-11-26 11:45:35,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:35,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:35,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:35,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:35,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:35,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1161 out of 1210 [2023-11-26 11:45:35,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1095 places, 1146 transitions, 2449 flow. Second operand has 3 states, 3 states have (on average 1162.6666666666667) internal successors, (3488), 3 states have internal predecessors, (3488), 0 states have call successors, (0), 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 11:45:35,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:35,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1161 of 1210 [2023-11-26 11:45:35,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:36,455 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][675], [3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 1207#(= |#race~is_null_1~0| 0), 444#L125-7true, 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 1205#true, 3385#true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3381#true, Black: 1210#true]) [2023-11-26 11:45:36,456 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is not cut-off event [2023-11-26 11:45:36,456 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is not cut-off event [2023-11-26 11:45:36,456 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is not cut-off event [2023-11-26 11:45:36,456 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is not cut-off event [2023-11-26 11:45:37,142 INFO L124 PetriNetUnfolderBase]: 301/5016 cut-off events. [2023-11-26 11:45:37,142 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2023-11-26 11:45:37,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5317 conditions, 5016 events. 301/5016 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 41735 event pairs, 30 based on Foata normal form. 0/4048 useless extension candidates. Maximal degree in co-relation 5023. Up to 104 conditions per place. [2023-11-26 11:45:37,242 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 21 selfloop transitions, 2 changer transitions 0/1146 dead transitions. [2023-11-26 11:45:37,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1096 places, 1146 transitions, 2496 flow [2023-11-26 11:45:37,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:37,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:37,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3507 transitions. [2023-11-26 11:45:37,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9661157024793389 [2023-11-26 11:45:37,248 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3507 transitions. [2023-11-26 11:45:37,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3507 transitions. [2023-11-26 11:45:37,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:37,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3507 transitions. [2023-11-26 11:45:37,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1169.0) internal successors, (3507), 3 states have internal predecessors, (3507), 0 states have call successors, (0), 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 11:45:37,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:37,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:37,257 INFO L175 Difference]: Start difference. First operand has 1095 places, 1146 transitions, 2449 flow. Second operand 3 states and 3507 transitions. [2023-11-26 11:45:37,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1096 places, 1146 transitions, 2496 flow [2023-11-26 11:45:37,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1094 places, 1146 transitions, 2492 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:37,284 INFO L231 Difference]: Finished difference. Result has 1094 places, 1145 transitions, 2447 flow [2023-11-26 11:45:37,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2443, PETRI_DIFFERENCE_MINUEND_PLACES=1092, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2447, PETRI_PLACES=1094, PETRI_TRANSITIONS=1145} [2023-11-26 11:45:37,287 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -22 predicate places. [2023-11-26 11:45:37,287 INFO L495 AbstractCegarLoop]: Abstraction has has 1094 places, 1145 transitions, 2447 flow [2023-11-26 11:45:37,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1162.6666666666667) internal successors, (3488), 3 states have internal predecessors, (3488), 0 states have call successors, (0), 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 11:45:37,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:37,289 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:37,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-26 11:45:37,289 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err65ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:37,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:37,290 INFO L85 PathProgramCache]: Analyzing trace with hash -344813227, now seen corresponding path program 1 times [2023-11-26 11:45:37,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:37,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755992100] [2023-11-26 11:45:37,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:37,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:37,429 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-26 11:45:37,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:37,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755992100] [2023-11-26 11:45:37,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755992100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:37,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:37,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:45:37,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881009052] [2023-11-26 11:45:37,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:37,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:37,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:37,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:37,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:37,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1173 out of 1210 [2023-11-26 11:45:37,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1094 places, 1145 transitions, 2447 flow. Second operand has 3 states, 3 states have (on average 1174.3333333333333) internal successors, (3523), 3 states have internal predecessors, (3523), 0 states have call successors, (0), 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 11:45:37,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:37,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1173 of 1210 [2023-11-26 11:45:37,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:38,856 INFO L124 PetriNetUnfolderBase]: 247/4484 cut-off events. [2023-11-26 11:45:38,856 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-26 11:45:38,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4710 conditions, 4484 events. 247/4484 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 35852 event pairs, 8 based on Foata normal form. 0/3647 useless extension candidates. Maximal degree in co-relation 4417. Up to 43 conditions per place. [2023-11-26 11:45:38,986 INFO L140 encePairwiseOnDemand]: 1206/1210 looper letters, 11 selfloop transitions, 3 changer transitions 0/1148 dead transitions. [2023-11-26 11:45:38,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1096 places, 1148 transitions, 2482 flow [2023-11-26 11:45:38,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3534 transitions. [2023-11-26 11:45:38,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9735537190082645 [2023-11-26 11:45:38,990 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3534 transitions. [2023-11-26 11:45:38,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3534 transitions. [2023-11-26 11:45:38,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:38,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3534 transitions. [2023-11-26 11:45:38,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1178.0) internal successors, (3534), 3 states have internal predecessors, (3534), 0 states have call successors, (0), 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 11:45:38,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:38,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:38,996 INFO L175 Difference]: Start difference. First operand has 1094 places, 1145 transitions, 2447 flow. Second operand 3 states and 3534 transitions. [2023-11-26 11:45:38,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1096 places, 1148 transitions, 2482 flow [2023-11-26 11:45:39,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1094 places, 1148 transitions, 2478 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:39,017 INFO L231 Difference]: Finished difference. Result has 1096 places, 1147 transitions, 2465 flow [2023-11-26 11:45:39,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2443, PETRI_DIFFERENCE_MINUEND_PLACES=1092, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2465, PETRI_PLACES=1096, PETRI_TRANSITIONS=1147} [2023-11-26 11:45:39,019 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -20 predicate places. [2023-11-26 11:45:39,019 INFO L495 AbstractCegarLoop]: Abstraction has has 1096 places, 1147 transitions, 2465 flow [2023-11-26 11:45:39,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1174.3333333333333) internal successors, (3523), 3 states have internal predecessors, (3523), 0 states have call successors, (0), 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 11:45:39,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:39,021 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:39,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-26 11:45:39,021 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:39,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:39,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1650706898, now seen corresponding path program 1 times [2023-11-26 11:45:39,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:39,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434013020] [2023-11-26 11:45:39,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:39,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:39,115 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-26 11:45:39,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:39,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434013020] [2023-11-26 11:45:39,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434013020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:39,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:39,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:39,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555286698] [2023-11-26 11:45:39,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:39,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:39,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:39,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:39,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:39,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1160 out of 1210 [2023-11-26 11:45:39,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1096 places, 1147 transitions, 2465 flow. Second operand has 3 states, 3 states have (on average 1162.0) internal successors, (3486), 3 states have internal predecessors, (3486), 0 states have call successors, (0), 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 11:45:39,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:39,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1160 of 1210 [2023-11-26 11:45:39,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:39,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 94#L78-2true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:39,627 INFO L294 olderBase$Statistics]: this new event has 318 ancestors and is cut-off event [2023-11-26 11:45:39,627 INFO L297 olderBase$Statistics]: existing Event has 324 ancestors and is cut-off event [2023-11-26 11:45:39,627 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2023-11-26 11:45:39,627 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2023-11-26 11:45:39,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3229] L78-1-->L78-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet48#1=|v_thread2Thread1of1ForFork0_#t~nondet48#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet48#1][343], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 94#L78-2true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:39,768 INFO L294 olderBase$Statistics]: this new event has 318 ancestors and is not cut-off event [2023-11-26 11:45:39,768 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is not cut-off event [2023-11-26 11:45:39,768 INFO L297 olderBase$Statistics]: existing Event has 324 ancestors and is not cut-off event [2023-11-26 11:45:39,768 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is not cut-off event [2023-11-26 11:45:39,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][507], [3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 3397#(= |thread2Thread1of1ForFork0_#t~nondet48#1| |#race~i_12~0|), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 812#L78-3true, Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:39,769 INFO L294 olderBase$Statistics]: this new event has 319 ancestors and is cut-off event [2023-11-26 11:45:39,769 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2023-11-26 11:45:39,769 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2023-11-26 11:45:39,769 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2023-11-26 11:45:39,781 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][507], [3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 3397#(= |thread2Thread1of1ForFork0_#t~nondet48#1| |#race~i_12~0|), 1212#(= |#race~is_null_5~0| 0), 650#L78-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:39,781 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2023-11-26 11:45:39,781 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2023-11-26 11:45:39,781 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2023-11-26 11:45:39,782 INFO L297 olderBase$Statistics]: existing Event has 326 ancestors and is cut-off event [2023-11-26 11:45:39,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 1116#L79true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:39,793 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2023-11-26 11:45:39,793 INFO L297 olderBase$Statistics]: existing Event has 324 ancestors and is cut-off event [2023-11-26 11:45:39,793 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2023-11-26 11:45:39,793 INFO L297 olderBase$Statistics]: existing Event has 324 ancestors and is cut-off event [2023-11-26 11:45:39,869 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 11#L91true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:39,869 INFO L294 olderBase$Statistics]: this new event has 330 ancestors and is cut-off event [2023-11-26 11:45:39,869 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2023-11-26 11:45:39,869 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2023-11-26 11:45:39,869 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2023-11-26 11:45:39,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 611#L82-1true, Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:39,870 INFO L294 olderBase$Statistics]: this new event has 330 ancestors and is cut-off event [2023-11-26 11:45:39,870 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2023-11-26 11:45:39,870 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2023-11-26 11:45:39,870 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2023-11-26 11:45:39,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 612#L83-3true, 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:39,988 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2023-11-26 11:45:39,988 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2023-11-26 11:45:39,988 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2023-11-26 11:45:39,988 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2023-11-26 11:45:39,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][724], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 444#L125-7true, Black: 1205#true, Black: 1210#true]) [2023-11-26 11:45:39,989 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is not cut-off event [2023-11-26 11:45:39,989 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is not cut-off event [2023-11-26 11:45:39,989 INFO L297 olderBase$Statistics]: existing Event has 348 ancestors and is not cut-off event [2023-11-26 11:45:39,989 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is not cut-off event [2023-11-26 11:45:40,068 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 1100#L83-12true, Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:40,068 INFO L294 olderBase$Statistics]: this new event has 352 ancestors and is cut-off event [2023-11-26 11:45:40,068 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2023-11-26 11:45:40,068 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2023-11-26 11:45:40,068 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2023-11-26 11:45:40,112 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][724], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 444#L125-7true, Black: 1205#true, Black: 1210#true]) [2023-11-26 11:45:40,112 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2023-11-26 11:45:40,112 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2023-11-26 11:45:40,112 INFO L297 olderBase$Statistics]: existing Event has 348 ancestors and is cut-off event [2023-11-26 11:45:40,112 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is cut-off event [2023-11-26 11:45:40,112 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2023-11-26 11:45:40,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 782#L84-3true, Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:40,174 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2023-11-26 11:45:40,174 INFO L297 olderBase$Statistics]: existing Event has 366 ancestors and is cut-off event [2023-11-26 11:45:40,174 INFO L297 olderBase$Statistics]: existing Event has 369 ancestors and is cut-off event [2023-11-26 11:45:40,174 INFO L297 olderBase$Statistics]: existing Event has 366 ancestors and is cut-off event [2023-11-26 11:45:40,281 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 940#L84-12true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:40,281 INFO L294 olderBase$Statistics]: this new event has 372 ancestors and is cut-off event [2023-11-26 11:45:40,281 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2023-11-26 11:45:40,281 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2023-11-26 11:45:40,281 INFO L297 olderBase$Statistics]: existing Event has 378 ancestors and is cut-off event [2023-11-26 11:45:40,440 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 243#L85-15true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:40,440 INFO L294 olderBase$Statistics]: this new event has 386 ancestors and is cut-off event [2023-11-26 11:45:40,440 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2023-11-26 11:45:40,440 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2023-11-26 11:45:40,440 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2023-11-26 11:45:40,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 934#L85-7true, Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:40,456 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2023-11-26 11:45:40,456 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2023-11-26 11:45:40,456 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2023-11-26 11:45:40,456 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2023-11-26 11:45:40,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 45#L86-7true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:40,633 INFO L294 olderBase$Statistics]: this new event has 403 ancestors and is cut-off event [2023-11-26 11:45:40,633 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is cut-off event [2023-11-26 11:45:40,633 INFO L297 olderBase$Statistics]: existing Event has 409 ancestors and is cut-off event [2023-11-26 11:45:40,633 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is cut-off event [2023-11-26 11:45:40,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), 619#L87-15true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:40,672 INFO L294 olderBase$Statistics]: this new event has 416 ancestors and is cut-off event [2023-11-26 11:45:40,672 INFO L297 olderBase$Statistics]: existing Event has 419 ancestors and is cut-off event [2023-11-26 11:45:40,672 INFO L297 olderBase$Statistics]: existing Event has 422 ancestors and is cut-off event [2023-11-26 11:45:40,672 INFO L297 olderBase$Statistics]: existing Event has 419 ancestors and is cut-off event [2023-11-26 11:45:40,674 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), 567#L87-7true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:40,674 INFO L294 olderBase$Statistics]: this new event has 417 ancestors and is cut-off event [2023-11-26 11:45:40,674 INFO L297 olderBase$Statistics]: existing Event has 420 ancestors and is cut-off event [2023-11-26 11:45:40,674 INFO L297 olderBase$Statistics]: existing Event has 420 ancestors and is cut-off event [2023-11-26 11:45:40,674 INFO L297 olderBase$Statistics]: existing Event has 423 ancestors and is cut-off event [2023-11-26 11:45:40,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 735#L88-7true, Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:40,680 INFO L294 olderBase$Statistics]: this new event has 433 ancestors and is cut-off event [2023-11-26 11:45:40,680 INFO L297 olderBase$Statistics]: existing Event has 436 ancestors and is cut-off event [2023-11-26 11:45:40,680 INFO L297 olderBase$Statistics]: existing Event has 439 ancestors and is cut-off event [2023-11-26 11:45:40,680 INFO L297 olderBase$Statistics]: existing Event has 436 ancestors and is cut-off event [2023-11-26 11:45:40,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 314#L89-1true, 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:40,686 INFO L294 olderBase$Statistics]: this new event has 441 ancestors and is cut-off event [2023-11-26 11:45:40,686 INFO L297 olderBase$Statistics]: existing Event has 444 ancestors and is cut-off event [2023-11-26 11:45:40,687 INFO L297 olderBase$Statistics]: existing Event has 447 ancestors and is cut-off event [2023-11-26 11:45:40,687 INFO L297 olderBase$Statistics]: existing Event has 444 ancestors and is cut-off event [2023-11-26 11:45:40,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 413#L89-6true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:40,689 INFO L294 olderBase$Statistics]: this new event has 446 ancestors and is cut-off event [2023-11-26 11:45:40,690 INFO L297 olderBase$Statistics]: existing Event has 449 ancestors and is cut-off event [2023-11-26 11:45:40,690 INFO L297 olderBase$Statistics]: existing Event has 449 ancestors and is cut-off event [2023-11-26 11:45:40,690 INFO L297 olderBase$Statistics]: existing Event has 452 ancestors and is cut-off event [2023-11-26 11:45:40,691 INFO L124 PetriNetUnfolderBase]: 299/4286 cut-off events. [2023-11-26 11:45:40,691 INFO L125 PetriNetUnfolderBase]: For 98/100 co-relation queries the response was YES. [2023-11-26 11:45:40,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4662 conditions, 4286 events. 299/4286 cut-off events. For 98/100 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 33881 event pairs, 16 based on Foata normal form. 0/3445 useless extension candidates. Maximal degree in co-relation 4367. Up to 192 conditions per place. [2023-11-26 11:45:40,895 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 22 selfloop transitions, 2 changer transitions 0/1147 dead transitions. [2023-11-26 11:45:40,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1097 places, 1147 transitions, 2514 flow [2023-11-26 11:45:40,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:40,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3505 transitions. [2023-11-26 11:45:40,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9655647382920111 [2023-11-26 11:45:40,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3505 transitions. [2023-11-26 11:45:40,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3505 transitions. [2023-11-26 11:45:40,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:40,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3505 transitions. [2023-11-26 11:45:40,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1168.3333333333333) internal successors, (3505), 3 states have internal predecessors, (3505), 0 states have call successors, (0), 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 11:45:40,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:40,910 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:40,910 INFO L175 Difference]: Start difference. First operand has 1096 places, 1147 transitions, 2465 flow. Second operand 3 states and 3505 transitions. [2023-11-26 11:45:40,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1097 places, 1147 transitions, 2514 flow [2023-11-26 11:45:40,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1095 places, 1147 transitions, 2508 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:40,932 INFO L231 Difference]: Finished difference. Result has 1095 places, 1146 transitions, 2461 flow [2023-11-26 11:45:40,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2457, PETRI_DIFFERENCE_MINUEND_PLACES=1093, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2461, PETRI_PLACES=1095, PETRI_TRANSITIONS=1146} [2023-11-26 11:45:40,934 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -21 predicate places. [2023-11-26 11:45:40,934 INFO L495 AbstractCegarLoop]: Abstraction has has 1095 places, 1146 transitions, 2461 flow [2023-11-26 11:45:40,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1162.0) internal successors, (3486), 3 states have internal predecessors, (3486), 0 states have call successors, (0), 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 11:45:40,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:40,935 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:40,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-26 11:45:40,936 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err63ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:40,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:40,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2035620093, now seen corresponding path program 1 times [2023-11-26 11:45:40,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:40,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722892404] [2023-11-26 11:45:40,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:40,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:41,026 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-26 11:45:41,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:41,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722892404] [2023-11-26 11:45:41,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722892404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:41,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:41,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:41,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965201573] [2023-11-26 11:45:41,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:41,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:41,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:41,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:41,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:41,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1173 out of 1210 [2023-11-26 11:45:41,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1095 places, 1146 transitions, 2461 flow. Second operand has 3 states, 3 states have (on average 1174.3333333333333) internal successors, (3523), 3 states have internal predecessors, (3523), 0 states have call successors, (0), 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 11:45:41,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:41,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1173 of 1210 [2023-11-26 11:45:41,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:41,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2818] L69-22-->L69-23: Formula: (= |v_#race~get_subject_3~0_1| 0) InVars {} OutVars{#race~get_subject_3~0=|v_#race~get_subject_3~0_1|} AuxVars[] AssignedVars[#race~get_subject_3~0][467], [3395#true, Black: 3389#true, 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 1105#L123-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 882#L96-25true, 65#L69-23true, Black: 1205#true, Black: 1210#true]) [2023-11-26 11:45:41,294 INFO L294 olderBase$Statistics]: this new event has 313 ancestors and is cut-off event [2023-11-26 11:45:41,294 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is cut-off event [2023-11-26 11:45:41,294 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2023-11-26 11:45:41,294 INFO L297 olderBase$Statistics]: existing Event has 310 ancestors and is cut-off event [2023-11-26 11:45:41,454 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][508], [3395#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 882#L96-25true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:41,454 INFO L294 olderBase$Statistics]: this new event has 329 ancestors and is cut-off event [2023-11-26 11:45:41,454 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2023-11-26 11:45:41,454 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2023-11-26 11:45:41,454 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2023-11-26 11:45:41,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3286] L96-24-->L96-25: Formula: (= |v_#race~get_subject_3~0_4| 0) InVars {} OutVars{#race~get_subject_3~0=|v_#race~get_subject_3~0_4|} AuxVars[] AssignedVars[#race~get_subject_3~0][456], [3395#true, Black: 3389#true, 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 1105#L123-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 882#L96-25true, 65#L69-23true, Black: 1205#true, Black: 1210#true]) [2023-11-26 11:45:41,519 INFO L294 olderBase$Statistics]: this new event has 310 ancestors and is not cut-off event [2023-11-26 11:45:41,519 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is not cut-off event [2023-11-26 11:45:41,519 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is not cut-off event [2023-11-26 11:45:41,519 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is not cut-off event [2023-11-26 11:45:41,519 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3286] L96-24-->L96-25: Formula: (= |v_#race~get_subject_3~0_4| 0) InVars {} OutVars{#race~get_subject_3~0=|v_#race~get_subject_3~0_4|} AuxVars[] AssignedVars[#race~get_subject_3~0][456], [3395#true, Black: 3389#true, 691#L69-24true, 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 1105#L123-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), 3401#(= |#race~get_subject_3~0| 0), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 882#L96-25true, Black: 1205#true, Black: 1210#true]) [2023-11-26 11:45:41,519 INFO L294 olderBase$Statistics]: this new event has 311 ancestors and is cut-off event [2023-11-26 11:45:41,519 INFO L297 olderBase$Statistics]: existing Event has 317 ancestors and is cut-off event [2023-11-26 11:45:41,519 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2023-11-26 11:45:41,520 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2023-11-26 11:45:41,520 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2818] L69-22-->L69-23: Formula: (= |v_#race~get_subject_3~0_1| 0) InVars {} OutVars{#race~get_subject_3~0=|v_#race~get_subject_3~0_1|} AuxVars[] AssignedVars[#race~get_subject_3~0][467], [3395#true, Black: 3389#true, 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 1105#L123-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 150#L96-26true, 65#L69-23true, Black: 1205#true, Black: 1210#true]) [2023-11-26 11:45:41,520 INFO L294 olderBase$Statistics]: this new event has 311 ancestors and is cut-off event [2023-11-26 11:45:41,520 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2023-11-26 11:45:41,520 INFO L297 olderBase$Statistics]: existing Event has 317 ancestors and is cut-off event [2023-11-26 11:45:41,520 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2023-11-26 11:45:41,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3286] L96-24-->L96-25: Formula: (= |v_#race~get_subject_3~0_4| 0) InVars {} OutVars{#race~get_subject_3~0=|v_#race~get_subject_3~0_4|} AuxVars[] AssignedVars[#race~get_subject_3~0][455], [3395#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 882#L96-25true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:41,791 INFO L294 olderBase$Statistics]: this new event has 329 ancestors and is not cut-off event [2023-11-26 11:45:41,791 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is not cut-off event [2023-11-26 11:45:41,791 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is not cut-off event [2023-11-26 11:45:41,791 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is not cut-off event [2023-11-26 11:45:41,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][508], [3395#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), 3401#(= |#race~get_subject_3~0| 0), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 150#L96-26true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:41,791 INFO L294 olderBase$Statistics]: this new event has 330 ancestors and is cut-off event [2023-11-26 11:45:41,791 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2023-11-26 11:45:41,791 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2023-11-26 11:45:41,792 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2023-11-26 11:45:41,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3286] L96-24-->L96-25: Formula: (= |v_#race~get_subject_3~0_4| 0) InVars {} OutVars{#race~get_subject_3~0=|v_#race~get_subject_3~0_4|} AuxVars[] AssignedVars[#race~get_subject_3~0][456], [3395#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 882#L96-25true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:41,900 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2023-11-26 11:45:41,900 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2023-11-26 11:45:41,900 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2023-11-26 11:45:41,900 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2023-11-26 11:45:41,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][725], [3395#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 444#L125-7true, 3399#true, Black: 1205#true, Black: 1210#true]) [2023-11-26 11:45:41,949 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is not cut-off event [2023-11-26 11:45:41,949 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is not cut-off event [2023-11-26 11:45:41,949 INFO L297 olderBase$Statistics]: existing Event has 348 ancestors and is not cut-off event [2023-11-26 11:45:41,949 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is not cut-off event [2023-11-26 11:45:42,012 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][508], [3395#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 150#L96-26true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:42,012 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2023-11-26 11:45:42,013 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2023-11-26 11:45:42,013 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2023-11-26 11:45:42,013 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2023-11-26 11:45:42,013 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is cut-off event [2023-11-26 11:45:42,013 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][508], [3395#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 882#L96-25true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:42,013 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2023-11-26 11:45:42,013 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2023-11-26 11:45:42,013 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2023-11-26 11:45:42,013 INFO L297 olderBase$Statistics]: existing Event has 329 ancestors and is cut-off event [2023-11-26 11:45:42,013 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2023-11-26 11:45:42,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][858], [3395#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), 3401#(= |#race~get_subject_3~0| 0), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 444#L125-7true, Black: 1205#true, Black: 1210#true]) [2023-11-26 11:45:42,175 INFO L294 olderBase$Statistics]: this new event has 374 ancestors and is cut-off event [2023-11-26 11:45:42,176 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2023-11-26 11:45:42,176 INFO L297 olderBase$Statistics]: existing Event has 374 ancestors and is cut-off event [2023-11-26 11:45:42,176 INFO L297 olderBase$Statistics]: existing Event has 374 ancestors and is cut-off event [2023-11-26 11:45:42,247 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][858], [3395#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 444#L125-7true, Black: 1205#true, Black: 1210#true]) [2023-11-26 11:45:42,247 INFO L294 olderBase$Statistics]: this new event has 371 ancestors and is not cut-off event [2023-11-26 11:45:42,247 INFO L297 olderBase$Statistics]: existing Event has 374 ancestors and is not cut-off event [2023-11-26 11:45:42,247 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is not cut-off event [2023-11-26 11:45:42,247 INFO L297 olderBase$Statistics]: existing Event has 374 ancestors and is not cut-off event [2023-11-26 11:45:42,247 INFO L297 olderBase$Statistics]: existing Event has 374 ancestors and is not cut-off event [2023-11-26 11:45:42,673 INFO L124 PetriNetUnfolderBase]: 239/4356 cut-off events. [2023-11-26 11:45:42,673 INFO L125 PetriNetUnfolderBase]: For 35/37 co-relation queries the response was YES. [2023-11-26 11:45:42,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4620 conditions, 4356 events. 239/4356 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 35169 event pairs, 2 based on Foata normal form. 0/3583 useless extension candidates. Maximal degree in co-relation 4325. Up to 76 conditions per place. [2023-11-26 11:45:42,838 INFO L140 encePairwiseOnDemand]: 1206/1210 looper letters, 12 selfloop transitions, 2 changer transitions 0/1149 dead transitions. [2023-11-26 11:45:42,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1095 places, 1149 transitions, 2498 flow [2023-11-26 11:45:42,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3535 transitions. [2023-11-26 11:45:42,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9738292011019284 [2023-11-26 11:45:42,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3535 transitions. [2023-11-26 11:45:42,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3535 transitions. [2023-11-26 11:45:42,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:42,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3535 transitions. [2023-11-26 11:45:42,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1178.3333333333333) internal successors, (3535), 3 states have internal predecessors, (3535), 0 states have call successors, (0), 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 11:45:42,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:42,852 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:42,852 INFO L175 Difference]: Start difference. First operand has 1095 places, 1146 transitions, 2461 flow. Second operand 3 states and 3535 transitions. [2023-11-26 11:45:42,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1095 places, 1149 transitions, 2498 flow [2023-11-26 11:45:42,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1093 places, 1149 transitions, 2494 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:42,874 INFO L231 Difference]: Finished difference. Result has 1094 places, 1146 transitions, 2467 flow [2023-11-26 11:45:42,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2453, PETRI_DIFFERENCE_MINUEND_PLACES=1091, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2467, PETRI_PLACES=1094, PETRI_TRANSITIONS=1146} [2023-11-26 11:45:42,876 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -22 predicate places. [2023-11-26 11:45:42,876 INFO L495 AbstractCegarLoop]: Abstraction has has 1094 places, 1146 transitions, 2467 flow [2023-11-26 11:45:42,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1174.3333333333333) internal successors, (3523), 3 states have internal predecessors, (3523), 0 states have call successors, (0), 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 11:45:42,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:42,877 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:42,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-26 11:45:42,878 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err65ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:42,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:42,878 INFO L85 PathProgramCache]: Analyzing trace with hash 223741259, now seen corresponding path program 1 times [2023-11-26 11:45:42,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:42,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070613469] [2023-11-26 11:45:42,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:42,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-26 11:45:42,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:42,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070613469] [2023-11-26 11:45:42,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070613469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:42,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:42,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:42,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485158616] [2023-11-26 11:45:42,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:42,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:42,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:42,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:42,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:43,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1164 out of 1210 [2023-11-26 11:45:43,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1094 places, 1146 transitions, 2467 flow. Second operand has 3 states, 3 states have (on average 1165.6666666666667) internal successors, (3497), 3 states have internal predecessors, (3497), 0 states have call successors, (0), 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 11:45:43,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:43,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1164 of 1210 [2023-11-26 11:45:43,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:43,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2818] L69-22-->L69-23: Formula: (= |v_#race~get_subject_3~0_1| 0) InVars {} OutVars{#race~get_subject_3~0=|v_#race~get_subject_3~0_1|} AuxVars[] AssignedVars[#race~get_subject_3~0][465], [Black: 3389#true, 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 1105#L123-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 3399#true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3404#true, 882#L96-25true, 65#L69-23true, Black: 1205#true, Black: 1210#true]) [2023-11-26 11:45:43,256 INFO L294 olderBase$Statistics]: this new event has 313 ancestors and is cut-off event [2023-11-26 11:45:43,256 INFO L297 olderBase$Statistics]: existing Event has 310 ancestors and is cut-off event [2023-11-26 11:45:43,256 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2023-11-26 11:45:43,256 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is cut-off event [2023-11-26 11:45:43,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3286] L96-24-->L96-25: Formula: (= |v_#race~get_subject_3~0_4| 0) InVars {} OutVars{#race~get_subject_3~0=|v_#race~get_subject_3~0_4|} AuxVars[] AssignedVars[#race~get_subject_3~0][454], [Black: 3389#true, 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 1105#L123-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 3399#true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3404#true, 882#L96-25true, 65#L69-23true, Black: 1205#true, Black: 1210#true]) [2023-11-26 11:45:43,494 INFO L294 olderBase$Statistics]: this new event has 310 ancestors and is not cut-off event [2023-11-26 11:45:43,494 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is not cut-off event [2023-11-26 11:45:43,494 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is not cut-off event [2023-11-26 11:45:43,494 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is not cut-off event [2023-11-26 11:45:45,088 INFO L124 PetriNetUnfolderBase]: 488/8847 cut-off events. [2023-11-26 11:45:45,088 INFO L125 PetriNetUnfolderBase]: For 20/38 co-relation queries the response was YES. [2023-11-26 11:45:45,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9347 conditions, 8847 events. 488/8847 cut-off events. For 20/38 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 79958 event pairs, 25 based on Foata normal form. 4/7224 useless extension candidates. Maximal degree in co-relation 9052. Up to 103 conditions per place. [2023-11-26 11:45:45,211 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 18 selfloop transitions, 2 changer transitions 0/1146 dead transitions. [2023-11-26 11:45:45,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1095 places, 1146 transitions, 2508 flow [2023-11-26 11:45:45,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3513 transitions. [2023-11-26 11:45:45,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9677685950413223 [2023-11-26 11:45:45,216 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3513 transitions. [2023-11-26 11:45:45,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3513 transitions. [2023-11-26 11:45:45,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:45,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3513 transitions. [2023-11-26 11:45:45,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1171.0) internal successors, (3513), 3 states have internal predecessors, (3513), 0 states have call successors, (0), 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 11:45:45,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:45,226 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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 11:45:45,226 INFO L175 Difference]: Start difference. First operand has 1094 places, 1146 transitions, 2467 flow. Second operand 3 states and 3513 transitions. [2023-11-26 11:45:45,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1095 places, 1146 transitions, 2508 flow [2023-11-26 11:45:45,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1095 places, 1146 transitions, 2508 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:45:45,247 INFO L231 Difference]: Finished difference. Result has 1095 places, 1145 transitions, 2469 flow [2023-11-26 11:45:45,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2465, PETRI_DIFFERENCE_MINUEND_PLACES=1093, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2469, PETRI_PLACES=1095, PETRI_TRANSITIONS=1145} [2023-11-26 11:45:45,250 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -21 predicate places. [2023-11-26 11:45:45,250 INFO L495 AbstractCegarLoop]: Abstraction has has 1095 places, 1145 transitions, 2469 flow [2023-11-26 11:45:45,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1165.6666666666667) internal successors, (3497), 3 states have internal predecessors, (3497), 0 states have call successors, (0), 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 11:45:45,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:45,251 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:45,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-26 11:45:45,252 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err64ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-26 11:45:45,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:45,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2020881282, now seen corresponding path program 1 times [2023-11-26 11:45:45,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:45,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182387009] [2023-11-26 11:45:45,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:45,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:45,339 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-26 11:45:45,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:45,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182387009] [2023-11-26 11:45:45,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182387009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:45,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:45,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:45,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152516566] [2023-11-26 11:45:45,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:45,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:45,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:45,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:45,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:45,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1173 out of 1210 [2023-11-26 11:45:45,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1095 places, 1145 transitions, 2469 flow. Second operand has 3 states, 3 states have (on average 1174.3333333333333) internal successors, (3523), 3 states have internal predecessors, (3523), 0 states have call successors, (0), 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 11:45:45,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:45,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1173 of 1210 [2023-11-26 11:45:45,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:45,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2832] L69-24-->L69-25: Formula: (= |v_#race~get_subject_7~0_1| 0) InVars {} OutVars{#race~get_subject_7~0=|v_#race~get_subject_7~0_1|} AuxVars[] AssignedVars[#race~get_subject_7~0][438], [Black: 3389#true, 1207#(= |#race~is_null_1~0| 0), 974#L69-25true, 1212#(= |#race~is_null_5~0| 0), 1105#L123-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), 3410#(= |#race~get_subject_7~0| 0), Black: 3399#true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3404#true, Black: 1205#true, 578#L96-23true, Black: 1210#true]) [2023-11-26 11:45:45,557 INFO L294 olderBase$Statistics]: this new event has 313 ancestors and is cut-off event [2023-11-26 11:45:45,557 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is cut-off event [2023-11-26 11:45:45,557 INFO L297 olderBase$Statistics]: existing Event has 310 ancestors and is cut-off event [2023-11-26 11:45:45,558 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2023-11-26 11:45:45,573 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2818] L69-22-->L69-23: Formula: (= |v_#race~get_subject_3~0_1| 0) InVars {} OutVars{#race~get_subject_3~0=|v_#race~get_subject_3~0_1|} AuxVars[] AssignedVars[#race~get_subject_3~0][465], [Black: 3389#true, 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 1105#L123-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), 3410#(= |#race~get_subject_7~0| 0), Black: 3399#true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3404#true, 882#L96-25true, 65#L69-23true, Black: 1205#true, Black: 1210#true]) [2023-11-26 11:45:45,573 INFO L294 olderBase$Statistics]: this new event has 316 ancestors and is cut-off event [2023-11-26 11:45:45,573 INFO L297 olderBase$Statistics]: existing Event has 310 ancestors and is cut-off event [2023-11-26 11:45:45,573 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is cut-off event [2023-11-26 11:45:45,573 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is cut-off event [2023-11-26 11:45:45,745 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][507], [Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 3410#(= |#race~get_subject_7~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3404#true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 3399#true, Black: 1205#true, 578#L96-23true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:45,745 INFO L294 olderBase$Statistics]: this new event has 327 ancestors and is cut-off event [2023-11-26 11:45:45,745 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is cut-off event [2023-11-26 11:45:45,745 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2023-11-26 11:45:45,745 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is cut-off event [2023-11-26 11:45:45,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3272] L96-22-->L96-23: Formula: (= |v_#race~get_subject_7~0_4| 0) InVars {} OutVars{#race~get_subject_7~0=|v_#race~get_subject_7~0_4|} AuxVars[] AssignedVars[#race~get_subject_7~0][456], [Black: 3389#true, 1207#(= |#race~is_null_1~0| 0), 974#L69-25true, 1212#(= |#race~is_null_5~0| 0), 1105#L123-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), 3410#(= |#race~get_subject_7~0| 0), Black: 3399#true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3404#true, Black: 1205#true, 578#L96-23true, Black: 1210#true]) [2023-11-26 11:45:45,841 INFO L294 olderBase$Statistics]: this new event has 310 ancestors and is not cut-off event [2023-11-26 11:45:45,842 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is not cut-off event [2023-11-26 11:45:45,842 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is not cut-off event [2023-11-26 11:45:45,842 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is not cut-off event [2023-11-26 11:45:45,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3272] L96-22-->L96-23: Formula: (= |v_#race~get_subject_7~0_4| 0) InVars {} OutVars{#race~get_subject_7~0=|v_#race~get_subject_7~0_4|} AuxVars[] AssignedVars[#race~get_subject_7~0][456], [Black: 3389#true, 1207#(= |#race~is_null_1~0| 0), 1099#L69-26true, 1212#(= |#race~is_null_5~0| 0), 1105#L123-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), 3410#(= |#race~get_subject_7~0| 0), Black: 3399#true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3404#true, Black: 1205#true, 578#L96-23true, Black: 1210#true]) [2023-11-26 11:45:45,842 INFO L294 olderBase$Statistics]: this new event has 311 ancestors and is cut-off event [2023-11-26 11:45:45,843 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2023-11-26 11:45:45,843 INFO L297 olderBase$Statistics]: existing Event has 317 ancestors and is cut-off event [2023-11-26 11:45:45,843 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2023-11-26 11:45:45,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2832] L69-24-->L69-25: Formula: (= |v_#race~get_subject_7~0_1| 0) InVars {} OutVars{#race~get_subject_7~0=|v_#race~get_subject_7~0_1|} AuxVars[] AssignedVars[#race~get_subject_7~0][438], [Black: 3389#true, 1207#(= |#race~is_null_1~0| 0), 974#L69-25true, 1212#(= |#race~is_null_5~0| 0), 1105#L123-4true, 3410#(= |#race~get_subject_7~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 3399#true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3404#true, Black: 1205#true, 821#L96-24true, Black: 1210#true]) [2023-11-26 11:45:45,843 INFO L294 olderBase$Statistics]: this new event has 311 ancestors and is cut-off event [2023-11-26 11:45:45,843 INFO L297 olderBase$Statistics]: existing Event has 317 ancestors and is cut-off event [2023-11-26 11:45:45,844 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2023-11-26 11:45:45,844 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2023-11-26 11:45:45,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3286] L96-24-->L96-25: Formula: (= |v_#race~get_subject_3~0_4| 0) InVars {} OutVars{#race~get_subject_3~0=|v_#race~get_subject_3~0_4|} AuxVars[] AssignedVars[#race~get_subject_3~0][454], [Black: 3389#true, 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 1105#L123-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), 3410#(= |#race~get_subject_7~0| 0), Black: 3399#true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 882#L96-25true, 3404#true, 65#L69-23true, Black: 1205#true, Black: 1210#true]) [2023-11-26 11:45:45,844 INFO L294 olderBase$Statistics]: this new event has 310 ancestors and is not cut-off event [2023-11-26 11:45:45,845 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is not cut-off event [2023-11-26 11:45:45,845 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is not cut-off event [2023-11-26 11:45:45,845 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is not cut-off event [2023-11-26 11:45:46,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3272] L96-22-->L96-23: Formula: (= |v_#race~get_subject_7~0_4| 0) InVars {} OutVars{#race~get_subject_7~0=|v_#race~get_subject_7~0_4|} AuxVars[] AssignedVars[#race~get_subject_7~0][426], [Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), 3410#(= |#race~get_subject_7~0| 0), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3404#true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 3399#true, Black: 1205#true, 578#L96-23true, 1017#L124-7true, Black: 1210#true]) [2023-11-26 11:45:46,109 INFO L294 olderBase$Statistics]: this new event has 327 ancestors and is not cut-off event [2023-11-26 11:45:46,109 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is not cut-off event [2023-11-26 11:45:46,109 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is not cut-off event [2023-11-26 11:45:46,109 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is not cut-off event [2023-11-26 11:45:46,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][507], [Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 3410#(= |#race~get_subject_7~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3404#true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 3399#true, Black: 1205#true, 1017#L124-7true, 821#L96-24true, Black: 1210#true]) [2023-11-26 11:45:46,110 INFO L294 olderBase$Statistics]: this new event has 328 ancestors and is cut-off event [2023-11-26 11:45:46,110 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is cut-off event [2023-11-26 11:45:46,110 INFO L297 olderBase$Statistics]: existing Event has 334 ancestors and is cut-off event [2023-11-26 11:45:46,110 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is cut-off event